DocumentCode
3412682
Title
Choice of allocation granularity in multipath source routing schemes
Author
Krishnan, Ram ; Silvester, John A.
Author_Institution
Dept. of Electr. Eng.-Syst., Univ. of Southern California, Los Angeles, CA, USA
fYear
1993
fDate
1993
Firstpage
322
Abstract
Multipath source routing schemes can be distinguished by their choice of allocation granularity. The schemes proposed in the literature advocate a per-connection allocation wherein all the packets of a connection are constrained to follow the same path. The authors believe that a smaller allocation granularity permits a finer control to be exerted and would result in improved performance, especially in the presence of bursty traffic sources. A simple two-node network is used to compare the performance of both allocation schemes. An analytical model is developed to compute the resequencing delay distribution for the per-packet allocation. It is observed that as the burstiness of the arrival process increases, the per-packet allocation is able to accommodate bursts in a more graceful fashion, resulting in better performance. The per-packet allocation also permits a more equitable distribution of network resources than the per-connection
Keywords
packet switching; telecommunication network routing; allocation granularity; analytical model; arrival process; bursty traffic sources; multipath source routing; network resources; packet switching; per-connection allocation; per-packet allocation; two-node network; Bandwidth; Communication system traffic control; Delay; Distributed computing; Feedback; Metropolitan area networks; Routing; Telecommunication traffic; Throughput; Traffic control;
fLanguage
English
Publisher
ieee
Conference_Titel
INFOCOM '93. Proceedings.Twelfth Annual Joint Conference of the IEEE Computer and Communications Societies. Networking: Foundation for the Future, IEEE
Conference_Location
San Francisco, CA
Print_ISBN
0-8186-3580-0
Type
conf
DOI
10.1109/INFCOM.1993.253345
Filename
253345
Link To Document