DocumentCode
290837
Title
Exploiting geographic spread (GS) for wide-area asynchronous transfer mode (ATM) dynamic multipoint routing
Author
Kadirire, J. ; Knight, G.
Author_Institution
Univ. Coll. London, UK
fYear
1995
fDate
26-29 Mar 1995
Firstpage
262
Lastpage
267
Abstract
This paper looks at how geographic spread (GS) can be used to aid with the routing of dynamic multipoint connections in wide-area packet switched networks like ATM networks. It presents the geographic spread dynamic multipoint (GSDM) routing algorithm proposed by Kadirire (see ACM SIGCOM Computer Communications Review October 1994) and investigates how the algorithm performs when the GS, the multicast group size and the number of nodes in the graph are increased. We also compare the GSDM with the greedy algorithm of Waxman (1988) and present simulation results over random graphs that demonstrate the performance of these algorithms
Keywords
asynchronous transfer mode; graph theory; packet switching; telecommunication network routing; wide area networks; ATM networks; computer networks; dynamic multipoint routing algorithm; geographic spread; greedy algorithm; multicast group size; nodes; performance; random graphs; simulation results; wide-area asynchronous transfer mode; wide-area packet switched networks;
fLanguage
English
Publisher
iet
Conference_Titel
Telecommunications, 1995. Fifth IEE Conference on
Conference_Location
Brighton
Print_ISBN
0-85296-634-2
Type
conf
DOI
10.1049/cp:19950153
Filename
396089
Link To Document