AIMD-based online MPLS traffic engineering for TCP flows via distributed multi-path routing

Simple item page
dc.citation.epage1371en_US
dc.citation.issueNumber11-12en_US
dc.citation.spage1353en_US
dc.citation.volumeNumber59en_US
dc.contributor.authorAlparslan O.en_US
dc.contributor.authorAkar, N.en_US
dc.contributor.authorKarasan, E.en_US
dc.date.accessioned2016-02-08T10:25:36Z
dc.date.available2016-02-08T10:25:36Z
dc.date.issued2004en_US
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.description.abstractWith this paper, we propose a distributed online traffic engineering architecture for MPLS networks. In this architecture, a primary and secondary MPLS LSP are established from an ingress LSR to every other egress LSR. We propose to split the TCP traffic between the primary and secondary paths using a distributed mechanism based on ECN marking and AIMD-based rate control. Inspired by the random early detection mechanism for active queue management, we propose a random early reroute scheme to adaptively control the delay difference between the primary and secondary LSPS. Considering the adverse effect of packet reordering on TCP performance for packet-based load balancing schemes, we propose that the TCP splitting mechanism operates on a per-flow basis. Using flow-based models developed for Internet traffic and simulations, we show that flow-based distributed multi-path traffic engineering outperforms on a consistent basis the case of a single path in terms of per-flow goodputs. Due to the elimination of out-of-order packet arrivals, flow-based splitting also enhances TCP performance with respect to packet-based splitting especially for long TCP flows that are hit hard by packet reordering. We also compare and contrast two queuing architectures for differential treatment of data packets routed over primary and secondary LSPS in the MPLS data plane, namely first-in-first-out and strict priority queuing. We show through simulations that strict priority queuing is more effective and relatively more robust with respect to the changes in the traffic demand matrix than first-in-first-out queuing in the context of distributed multi-path routing.en_US
dc.identifier.issn0003-4347
dc.identifier.urihttp://hdl.handle.net/11693/24202
dc.language.isoEnglishen_US
dc.publisherSpringeren_US
dc.source.titleAnnales des Telecommunications/Annals of Telecommunicationsen_US
dc.subjectDistributed systemen_US
dc.subjectInterneten_US
dc.subjectNetwork routingen_US
dc.subjectQueueen_US
dc.subjectResource sharingen_US
dc.subjectTCP/IPen_US
dc.subjectTeletrafficen_US
dc.subjectDistributed systemsen_US
dc.subjectNetwork routingen_US
dc.subjectQueueen_US
dc.subjectResource sharingen_US
dc.subjectTCP/IPen_US
dc.subjectTeletrafficen_US
dc.subjectComputer simulationen_US
dc.subjectDistributed computer systemsen_US
dc.subjectInterneten_US
dc.subjectNetwork protocolsen_US
dc.subjectPacket networksen_US
dc.subjectQueueing networksen_US
dc.subjectRoutersen_US
dc.subjectTelecommunication trafficen_US
dc.titleAIMD-based online MPLS traffic engineering for TCP flows via distributed multi-path routingen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
AIMD-based online MPLS traffic engineering for TCP flows via distributed multi-path routing.pdf
Size:
2.91 MB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Department of Electrical and Electronics Engineering