DocumentCode :
3487428
Title :
Binary-routing: a routing scheme for high traffic networks
Author :
Coleman, James P H
Author_Institution :
Northern Territory Univ., Darwin, NT, Australia
fYear :
1995
fDate :
3-7 Jul 1995
Firstpage :
442
Lastpage :
446
Abstract :
Routing is the process of directing the track a message takes in order to get from the source node to the destination node. As the number of nodes in the network increases, and more network intensive activities occur, routing difficulties increases. The primary problem is the processing that each router has to perform to pass on each single packet. This paper proposes a system, called binary-routing, whereby router processing for each packet becomes almost trivial while still retaining the flexibility and adaptability that is commonly associated with modern networks and their routing system
Keywords :
Internet; network topology; performance evaluation; telecommunication network routing; telecommunication traffic; trees (mathematics); Internet topology; binary-routing scheme; destination node; high traffic networks; minimal spanning tree; multigraph; router processing; source node; Binary trees; IP networks; Internet; Network servers; Network topology; Proposals; Routing; Telecommunication traffic; Web server;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Networks, 1995. Theme: Electrotechnology 2000: Communications and Networks. [in conjunction with the] International Conference on Information Engineering., Proceedings of IEEE Singapore International
Print_ISBN :
0-7803-2579-6
Type :
conf
DOI :
10.1109/SICON.1995.526325
Filename :
526325
Link To Document :
بازگشت