Your SlideShare is downloading. ×
0
Multi-domain Virtual Content-Aware Networks Mapping on Network Resources
Multi-domain Virtual Content-Aware Networks Mapping on Network Resources
Multi-domain Virtual Content-Aware Networks Mapping on Network Resources
Multi-domain Virtual Content-Aware Networks Mapping on Network Resources
Multi-domain Virtual Content-Aware Networks Mapping on Network Resources
Multi-domain Virtual Content-Aware Networks Mapping on Network Resources
Multi-domain Virtual Content-Aware Networks Mapping on Network Resources
Multi-domain Virtual Content-Aware Networks Mapping on Network Resources
Multi-domain Virtual Content-Aware Networks Mapping on Network Resources
Multi-domain Virtual Content-Aware Networks Mapping on Network Resources
Multi-domain Virtual Content-Aware Networks Mapping on Network Resources
Multi-domain Virtual Content-Aware Networks Mapping on Network Resources
Multi-domain Virtual Content-Aware Networks Mapping on Network Resources
Multi-domain Virtual Content-Aware Networks Mapping on Network Resources
Multi-domain Virtual Content-Aware Networks Mapping on Network Resources
Multi-domain Virtual Content-Aware Networks Mapping on Network Resources
Multi-domain Virtual Content-Aware Networks Mapping on Network Resources
Multi-domain Virtual Content-Aware Networks Mapping on Network Resources
Multi-domain Virtual Content-Aware Networks Mapping on Network Resources
Multi-domain Virtual Content-Aware Networks Mapping on Network Resources
Multi-domain Virtual Content-Aware Networks Mapping on Network Resources
Multi-domain Virtual Content-Aware Networks Mapping on Network Resources
Upcoming SlideShare
Loading in...5
×

Thanks for flagging this SlideShare!

Oops! An error has occurred.

×
Saving this for later? Get the SlideShare app to save on your phone or tablet. Read anywhere, anytime – even offline.
Text the download link to your phone
Standard text messaging rates apply

Multi-domain Virtual Content-Aware Networks Mapping on Network Resources

1,143

Published on

Published in: Technology, Business
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total Views
1,143
On Slideshare
0
From Embeds
0
Number of Embeds
1
Actions
Shares
0
Downloads
0
Comments
0
Likes
0
Embeds 0
No embeds

Report content
Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
No notes for slide

Transcript

  • 1. Multi-domain Virtual Content-Aware Networks Mapping on Network Resources Eugen Borcoci, Radu Miruţă, Serban Obreja radu.miruta@elcom.pub.ro EUSIPCO 2012 Bucharest, Romania
  • 2. Authors’ affiliation: Eugen Borcoci, Radu Miruta, Serban Obreja -University Politehnica of Bucharest, RomaniaAcknowledgment: This work has been partially supported by theEuropean Research Integrated Project FP7 ALICANTE“MediA Ecosystem Deployment Through UbiquitousContent-Aware Network Environments” 2010-2013 and partially bythe national Romanian project POSDRU/88/1.5/S/61178. www.ict-alicante.eu EUSIPCO 2012 Bucharest, Romania 2
  • 3. Main objectivesThe paper proposes and develops: a solution for inter-domain planning and VCAN mapping; a combined algorithm to perform jointly QoSrouting, admission control and resource reservation (VCANmapping). EUSIPCO 2012 Bucharest, Romania 3
  • 4. CONTENTS1. Introduction2. ALICANTE System Architecture and VCAN Management3. VCAN Planning and Provisioning4. Experimental Results5. Conclusions EUSIPCO 2012 Bucharest, Romania 4
  • 5. 1. Introduction• ALICANTE : New challenging concepts (Future Internet – oriented) – Content Aware Networking (CAN) – Network Aware Application (NAA)• Novel virtual CAN layer – on top of IP – as a part of a full layered architecture – focused, but not limited to, on multimedia distribution with Quality of Services (QoS) assurance – Create Virtual Content Aware Networks (VCAN), multi-domain, QoS enabled • realised as parallel planes customised for different content types • at requests of high level Services Providers (SP) • addressed to VCAN Providers (CANP)• The system is based on a flexible cooperation between providers, operators and end-users• The system enables end-users – to access multimedia services in various contexts – and also to become private content providers• The paper focus: how to plan and map a VCAN requested by the SP on several network domains, while meeting the SP needs and also the NP policies EUSIPCO 2012 Bucharest, Romania 5
  • 6. 2. ALICANTE System Architecture• ALICANTE defines several environments containing business actors: – User Environment (UE) • End-Users (EU) – Service Environment (SE) • Service Providers (SP) • Content Providers (CP) – Network Environment (NE) • CAN Providers (CANP) - new type of provider • Network Providers (NP) - traditional ISPs – Home Box – new entity located at EU premises • Media flow processing, management, adaptation, routing, caching functionsEnvironment : - group of functions defined around the same goal and possibly spanning, vertically, one or more several architectural (sub-) layers - it has a broader scope, than “layer” EUSIPCO 2012 Bucharest, Romania 6
  • 7. 2. ALICANTE System Architecture HB + SP Env. SrvMgr@SP General VCAN Mapping: 11. SP asks (via SLA negotiation) a CANMgr2 CANMgr1 CANMgr3 CAN 2.1 2.2 layer CANMgr (any) to construct one or Mgmt. 3 3 3 several VCANs;2. The initiator CANMgr negotiates Intra-NRM@NP with other CANMgrs to agree and CND 4 CND2 reserve resources for the VCAN; 2 CND1 (if the VCAN spans several core network domains) Multi-domain VCAN Media flow CANMgr = CAN Manager of the CANP3. Each CANMgr of the CANP Intra-NRM= Intra-domain Network Resource Manager negotiates local resources with NP MANE = Media Aware Network Element (includes CA behavior) Note: 1:1 mapping between CANMgrs and Intra-NRMs4. After successfully negotiations, each Intra-NRM configures its routers (MANE + core routers) 7 EUSIPCO 2012 Bucharest, Romania
  • 8. 3. VCAN Planning and Provisioning•Solution proposed in this paper -VCAN mapping done on two hierarchical levels: inter and intra-domain•The inter-domain mapping problem: -given an inter-domain graph and a Traffic Matrix (TM) – for a VCAN belonging to agiven class of services (CoS) - how to map it onto real graph while respecting the inter-domain min. bandwidth constraints and also optimising the resource usage.•Assumptions: -CANMgrs know inter-domain topology and inter-domain link capacities allocated for this CoS (*) -Intra-NRM knows its intra-domain topology and link capacities allocated for this CoS(*) • Inter-domain - initiator CANMg  Determines the CNDs participating at VCAN;  Runs a combined algorithm to find inter-domain QoS enabled paths and make the inter-domain VCAN mapping  Determines each intra-domain needs for this VCAN Inputs: ONT graph, link QoS characteristics and TM; (*) discovering Outputs: the path for each CND composing the VCAN this info is out of scope of this paper • Intra-domain – similar actions for intra-domain EUSIPCO 2012 Bucharest, Romania 8
  • 9. 3. VCAN Planning and Provisioning Inter-domain CNDj SP mapping VCAN CNDk CNDn CNDm CANMgrm Simple example of Intra-domain mapping: CNDm a VCAN spanning TM -> Network three domains graph paths ONT(CNDm) EUSIPCO 2012 Bucharest, Romania 9
  • 10. 3. VCAN Planning and ProvisioningRouting, Mapping and Admission Control algorithm: •Run by the CANMgr/Intra-NRM: mapping VCAN QoS requirements onto physical network resources; •Input: the network graph, TM; •Output: the mapping of TM on real paths and admission control while respecting the min. band. constraints and also optimizing the network resource usage; •Used metric: 1/Bandwidth_ij ->additive link metric -Note: more complex metrics can be defined (e.g. considering the delay also) EUSIPCO 2012 Bucharest, Romania 10
  • 11. 3. VCAN Planning and ProvisioningThe algorithm summary:1. Split the Traffic Matrix TM (requests) in several trees, 1/ingress node (I1, I2, …In);2. On the current graph, repeat for 1 to n: 2.1. Compute the DJ_SPT (root_I1);// where DJ means Dijkstra algorithm 2.2. Select the TM branches that can be satisfied (i.e. Bij > Breq for that direction);//Mapping and AC 2.3 Reserve capacities for these branches (subtraction);//a reduced graph is obtained 2.4. Compute the overall utilization for each path reserved : Upath= Sum_links(Breq/Bavail)*NHF(path); //NHF is a factor taking into account the number ofnodes traversed. 2.5 List the unsatisfied branches;3. Aggregate for all inputs (satisfied and not satisfied branches) and compute VCAN utilization (sum over all paths mapped onto the real graph);Optimisation: change order {I1, ..In} and repeat 1..3. EUSIPCO 2012 Bucharest, Romania 11
  • 12. 3. VCAN Planning and ProvisioningThe overall complexity: k!*m*n^2  k- no. of requests;  m- no. of groups of requests with common source node;  n- no. of nodes.Some pragmatic solutions to improve the performance: 1. Stop repetitions of the step 2 if the overall utilization fulfill some enough good thresholds fixed by local CANP policy; 2. Assign a priority order for processing requests ->no permutations are needed; 3. Process the requests in increasing order of their bandwidth (maybe the SP will accept a partial fulfillment of its high bandwidth requests).Obs – in the ALICANTE context, the algorithm does not have to run in real time given that it is used at provisioning actions -> applying pragmatic optimizations the complexity is not a critical issue EUSIPCO 2012 Bucharest, Romania 12
  • 13. 4. Implementation example and results CND B Capacity 5 Request 10 11 10 7 CND D 8 Resources Availability Matrix and Requested Matrix CND ECND A 3 12 9 CND C Core Network Domain Topology Graph and the set of Traffic Matrix requests The algorithm output EUSIPCO 2012 Bucharest, Romania 13
  • 14. Evaluation results 7,7586 4,5142 0,67 0,670 No of solved req Best cost first order second orderChart 1 – Different best cost value at different processing order of requests EUSIPCO 2012 Bucharest, Romania 14
  • 15. Evaluation results 0,90 0,85 0,80 0,75 0,71 0,67 0,70 0,60 0,50 0,40 0,30 0,20 0,083 0,08 0,10 0,036 0,009 0,00 5 nodes, 3 9 nodes, 13 75 nodes, 4 75 nodes, 7 requests requests requests requests No of solved requests Processing time (seconds)Chart 2 – Time and number of solved requests vs. different topologies at the same number of permutations (4) EUSIPCO 2012 Bucharest, Romania 15
  • 16. Fresh resultsEUSIPCO 2012 Bucharest, Romania 16
  • 17. 5. Conclusions• Achievements: – Specification, design, implementation and initial evaluation of a combined algorithm to perform: • QoS constrained routing • admission control • resource reservation • VCAN (parallel planes - QoS capable) mapping onto IP network • Numerical examples for algorithm implementation - showing the variability of performance with the graph complexity, number of requests and order of evaluation• Future work- in progress – CAN/Network layer : integration of the described algorithm into CAN layer framework – evaluate performances of the real implementation – extend the simulations for large networks • evaluate scalability • compare the simulation results to the measured results – Comparison of the method with other approaches EUSIPCO 2012 Bucharest, Romania 17
  • 18. Thank you !EUSIPCO 2012 Bucharest, Romania 18
  • 19. Backup slide – the blind searchFor the unsatisfied requests, a blind search is added. For each request with the source node A and destination B recursively trial is attempted to reach node B using depth first search until node B is reached. Using a backtracking approach it tries to find the first possible flow from A to B: for each adjacent node with an edge that satisfies the constraints it uses a depth first search for the destination node; when this is complete it backtracks to the source node (previous node) of the current node. When the destination is reached it does the same to the next unsolved request and so on. EUSIPCO 2012 Bucharest, Romania 19
  • 20. Backup slide – VCAN mappingTwo-levels of VCAN mappinginter-domain : CAN Plan&Prov@CANMgr runs an algorithmindependent of intra-domain resources knowledge intra-domain : CAN Plan&Prov@Intra-NRM- runs a similar algorithm making its own VCAN mappingPros: good business model (Intra-NRM does not disclose itsinternal topology and capacities) better scalability, more simpleCons: no global optimum guarantee EUSIPCO 2012 Bucharest, Romania 20
  • 21. Backup slide – VCAN multi-domain peering Inter-domain topology discovery- Overlay Network Service The ONS can act in two ways (mode in order to obtain the overlay (virtual) topologies of other NDs.  proactive (push) mode  reactive (also called pull or on demand) – In ALICANTE case if a CANMgr wants to build an ONT • it will query its directly linked (at data plane level) neighbor domains ( i.e. the corresponding CAN Managers). It is supposed that it has the knowledge of such neighbors. There two possibilities of a querry: – a. non-selective querry/demand- the asking CANMgr wants to know all neighborhood of the asked neighbors – b. selective demand- the asking CANMgr wants to know answers only from those AS neighbors which have paths to a given set of destinations. EUSIPCO 2012 Bucharest, Romania 21
  • 22. Backup slide - VCAN• Virtual Content-Aware Network (VCAN) is an overlay network offering an enhanced support for packet payload inspection, processing and caching in network nodes.• The specific components in charge of creating this VCAN are the MANE, i.e., the new CAN routers• Can improve data delivery by classifying and controlling messages in terms of content, application and individual subscribers• Improves QoS assurance, via classifying the packets and associating them to the appropriate CANs. It may apply content/name-based routing and forwarding. EUSIPCO 2012 Bucharest, Romania 22

×