1 / 9

NOBEL WP2 Meeting

NOBEL WP2 Meeting. Alcatel CIT D27 TE planned activities Madrid, 11-13.04.05. D27 TE planned contributions. Multicriteria Routing Algorithms: end-to-end simulation results of proposals described in D17

tybalt
Download Presentation

NOBEL WP2 Meeting

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. NOBEL WP2 Meeting Alcatel CIT D27 TE planned activities Madrid, 11-13.04.05

  2. D27 TE planned contributions • Multicriteria Routing Algorithms: end-to-end simulation results of proposals described in D17 • Virtual Topology optimisation (IP/MPLS over Transport): include protection in virtual topology design and optimisation of cost function in case of IP/MPLS over SONET/SDH • Traffic Modelling: traces analysis (from UST-IKR) and confrontation with flow model

  3. D27 TE: Multi-criteria routing (1)2004 achievements and plans for 2005 • In 2004: Proposal of an RMC Algorithm (Routing with Multiple Criteria): • fast, network state-sensitive • Multi-criteria: transit delay, bandwidth, hop count, administrative cost • Multi-constrained: on above metrics + on the link CoS • Adaptive: choice of criteria customized to operator’s policy and current network management priorities • Planned in 2005 : • Load Balancing based on RMC output : use of the multiple routes per destinations that are output by RMC. • Goal: Without additional network capacity, • Increase network capacity and availability (operator friendly) • Increase goodput and fairness (user friendly) • Minimize packet loss and traffic oscillations

  4. D27 TE: Multi-criteria routing (2)plans for 2005 (cont.) • RMC Algorithm designed and tested for distributed IP • Prevention of traffic oscillation and deviation • LS DB synchronization mechanisms • … but adaptable to MPLS • No traffic deviation issues • LS DB synchronization is simpler • Core network & end2end level performance assessment • Optimal traffic measurement and information flooding (planned) • Control mechanisms and fine-tuning: • LS Database Synchronization (specified) • Triggering mechanisms (on-alarms, on-demand) (tests ongoing) • Sensitivity analysis : (to load threshold) (simulation ongoing) • Progressive flow shifting: (specified) • flow shifting granularity, pace and duration (simulation ongoing)

  5. D27 TE: Multi-criteria routing (3)plans for 2005 (cont.) • Network & end2end level performance assessment: ongoing RMC implemented on an end2end TCP flows simulator: existing topology, 20 core nodes, different link capacities • Up to 900 000 flows on up to 300 000 DSL terminal nodes simulated • Network-level evaluation: Link utilization, Congestion analysis, Optimization/Sensitivity. • User-level evaluation: Goodputperapplication or per terminal type, Fluctuations of throughput of each application, delays, loss rate etc • First simulation results on distributed IP with synchronized LS DB: overall link load increase • Meet the above mentionned goals

  6. D27 TE: Multi-criteria routing (4)issues and questions • DDTE (Distributed Dynamic Traffic Engineering) and resiliency • Contribution of load-sensitive mono or multi-path routing : what performances are expected ? • Which metrics for QoR? Bounds on each metric? • Priorities over multiple contraints: Restoration Time, Satisfaction rate of demands, … • E.g. Protection with Time < 50ms, but for what Blocking probability for connections? • Need for input data • Examples of core networks with different link capacities • Traffic data (ongoing in NOBEL) in « normal case » • Traffic data with cases of local and global load increase • Scenarii of link and router failures Contact: sabine.randriamasy@alcatel.fr

  7. D27 TE: Virtual topology design (1) • 2004 (D17): Packet over Circuit e.g. IP/MPLS o OTH (SDH, OTN) • Virtual topology design: • method used to provide intermediate results to FT for their study case “Impact of optical layer pass-through in core networks” in D15 • The tool actually provides dimensioning results • 2005 (D27): Evolutions • Simplified support of statistical multiplexing • Today, the tool use a flow based modelisation to estimate traffic aggregation in the path computation to create the virtual topology • Imposes to have detailed traffic matrices where individual flows per type of applications are described • On the contrary, most Reference networks use simpler traffic matrices (Mean traffic, Peak traffic, or even directly SONET/SDH traffic matrix) • A simplified modeling of stat mux compatible with actual traffic matrices format is interesting for coarser analysis

  8. D27 TE: Virtual topology design (2) • 2005 (D27): Evolutions (con’t) • Refinements of cost and inter-working models • Virtual Topology creation relies today only on a simple cost ratio between a Router port and a XC port • Need a finer granularity for the cost ratio depending on functionality required (or not) on each type of line cards • Support of Protection and restoration • Today virtual topology without protection • Improve with 1+1 and shared mesh in transport, FRR at IP level • Possible introduction of third layer (WDM bypass) Contacts: {martin.vigoureux or nicolas.le_sauze} @alcatel.fr

  9. D27 Traffic modelling: • Note: not a big activity (1MM in 2005)! • The main goal is to analyse a real trace and compare mesaured aggregated flow characteristics with the flow (/Guerin) bufferless model • Analysis of traces from UST-IKR • Link 100 Mbit/s, close to access, but already quite high bit-rate and aggregated between all the students • Example at peak hour: Sunday 31/10/2004, around 19:00 [average ~ 34 Mbit/s] • Goal: • Analyse time characteristics: evolution of the Coefficient of Variation of the aggregated flow at different time scales relevant with delays encountered in transport networks • Could CoV (t) be approximated by CoV(0) as done in a bufferless model? • Should be able to present some results at next meeting Contact: {ludovic.noirie or nicolas.le_sauze} @alcatel.fr

More Related