DocumentCode
1739691
Title
Path merging and destination removal: new forwarding paradigms in packet switching networks
Author
Benjamin, Shai ; Rubin, Izhak
Author_Institution
California Univ., Los Angeles, CA, USA
Volume
1
fYear
2000
fDate
2000
Firstpage
405
Abstract
We study how two new forwarding paradigms, namely path merging and destination removal, help in reducing the number of labels in the routing table of a packet switching node. We prove upper and lower bounds on the number of labels required for general networks and give tractable solutions for some specific cases (tree, cycle, complete graph). We believe that destination removal, as an extension to multiprotocol label switching (MPLS), may result in further enhancement of the performance of high-speed networks
Keywords
packet switching; protocols; telecommunication network routing; MPLS; complete graph; cycle; destination removal; forwarding paradigms; high-speed networks; lower bounds; multiprotocol label switching; packet switching networks; packet switching node; path merging; routing table labels reduction; tree; upper bounds; Asynchronous transfer mode; Graph theory; Intelligent networks; Merging; Multiprotocol label switching; Packet switching; Routing; Switches; Telecommunication traffic; Tree graphs;
fLanguage
English
Publisher
ieee
Conference_Titel
Global Telecommunications Conference, 2000. GLOBECOM '00. IEEE
Conference_Location
San Francisco, CA
Print_ISBN
0-7803-6451-1
Type
conf
DOI
10.1109/GLOCOM.2000.892037
Filename
892037
Link To Document