By Topic

Near optimal flow labeling in ATM/IP-LSR networks using multi-segment flows

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Harwood, A. ; Sch. of Comput. & Inf. Technol., Griffith Univ., Brisbane, Qld., Australia ; Hong Shen

Packet or datagram based routing is widely used for the Internet mainly due to its robustness, ease of implementation and autonomous behavior. Hierarchical networks are necessary to provide scalability. Previous developments proposed for ATM technology to be the basis of packet switched routing protocols. This technology provides flows to reduce the number of times a packet's destination address must be looked up in a routing table thereby increasing the performance of the overall system. Basic methods to establish and maintain these flows have emerged. Clearly one cannot define a flow between every (source, destination) pair since the number of destinations (in the Internet) is prohibitively large. We provide a definition of the problem with optimality criteria, and an algorithm that autonomously establishes a dynamic hierarchy of flows over an arbitrary network according to traffic demand. If the network is of size n, our algorithm uses only O(n 0logn0n) labels at each router where n0=e≈3. Packets are routed over a λ-segmented flow such that the label table is accessed at most λ=logn0n-1 times. We show that the total table look-up complexity, O(n0logn02n), is a factor Θ(log n0logn0n) times the optimal, which makes substantial improvement of other results known to us. Our hierarchy of flows naturally exists transparently on top of the underlying hierarchical address space (IP) and requires no additional information

Published in:

Networks, 2000. (ICON 2000). Proceedings. IEEE International Conference on

Date of Conference: