Generalized load sharing for packet-switching networks. II. Flow-based algorithms

For pt.1 see ibid., p.694-702 (2006). In this paper, we extend the load sharing framework to study how to effectively perform flow-based traffic splitting in multipath communication networks. The generalized load sharing (GLS) model is employed to conceptualize how traffic is split ideally on a set...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on parallel and distributed systems 2006-07, Vol.17 (7), p.703-712
Main Authors: Ka-Cheong Leung, Li, V.O.K.
Format: Article
Language:English
Subjects:
Algorithms
Communication networks
Communication system traffic control
Communications networks
Computer communications
Computer networks
dispersity routing
high speed networks
Internet
inverse multiplexing
Load management
Load sharing
multipath routing
multiprotocol label switching
network striping
performance modeling
Protocols
Quality of service
Round robin
Routing
Routing (telecommunications)
Splitting
Studies
Telecommunication traffic
Traffic control
traffic dispersion
Traffic engineering
Traffic flow
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:For pt.1 see ibid., p.694-702 (2006). In this paper, we extend the load sharing framework to study how to effectively perform flow-based traffic splitting in multipath communication networks. The generalized load sharing (GLS) model is employed to conceptualize how traffic is split ideally on a set of active paths. A simple flow-based weighted fair routing (WFR) algorithm, called call-by-call WFR (CWFR), has been developed to imitate GLS so that all packets belonging to a single flow are sent on the same path. We have investigated how to couple the proposed basic packet-by-packet WFR (PWFR) and CWFR algorithms so as to permit a traffic splitter to handle both connection-oriented and connectionless traffic simultaneously. Our simulation studies, based on a collection of Internet backbone traces, reveal that WFR outperforms two other traffic splitting algorithms, namely, generalized round robin routing (GRR), and probabilistic routing (PRR). These promising results form a basis for designing future adaptive constraint-based multipath routing protocols
ISSN:1045-9219
1558-2183
DOI:10.1109/TPDS.2006.91