Title :
Flow generation for IP/ATM label-switched routing over random networks
Author :
Harwood, Aaron ; Shen, Hong
Author_Institution :
Sch. of Comput. & Inf. Technol., Griffith Univ., Nathan, Qld., Australia
Abstract :
We address the problem of generating ATM labels which facilitates IP packet flow through the network. We define the virtual flow topology and provide a stochastic algorithm GFLOW, that generates labels for virtual connections using periodic broadcasts providing simple and efficient robustness and oblivious execution. For a random network with N nodes of average degree d¯¯¯ and dimeter Θ(k), we demonstrate how our algorithm can be used to generate a mean l=1+(k-1)d¯¯ labels at each node to provide a probability Θ(1/N) that any pair of nodes will have a virtual connection between them. We show that with probability roughly ½+1/2N any node may route a message along a virtual connection which terminates within an ε-neighborhood of the destination, where ε=Θ (logd¯ (N/k)), with l as stipulated. Of course the number of labels generated at each node is variable and directly relates to the cost in such a way that a network administrator can trade label space for increased performance. We provide simulation results using Matlab mathematical language interpreter that supports our analysis
Keywords :
Internet; asynchronous transfer mode; program interpreters; protocols; IP packet flow; IP/ATM label-switched routing; Matlab mathematical language interpreter; average degree; oblivious execution; random networks; robustness; simulation results; stochastic algorithm GFLOW; virtual connection; virtual flow topology; Asynchronous transfer mode; Broadcasting; Costs; Network topology; Packet switching; Robustness; Routing; Space technology; Stochastic processes; Telecommunication traffic;
Conference_Titel :
Parallel and Distributed Processing Symposium., Proceedings 15th International
Conference_Location :
San Francisco, CA
Print_ISBN :
0-7695-0990-8
DOI :
10.1109/IPDPS.2001.924947