DocumentCode :
3298961
Title :
Multicast models and routing algorithms for high speed multi-service networks
Author :
Ravindran, K. ; Sankhla, M.
Author_Institution :
Dept. of Comput. & Inf. Sci., Kansas State Univ., Manhattan, KS, USA
fYear :
1992
fDate :
9-12 Jun 1992
Firstpage :
194
Lastpage :
201
Abstract :
The abstraction of tree structured communication channels used in wide-area packet multicasting are generalized by introducing the notions of acyclic graph and two user specifiable attributes, data directionality and transport quality of service. The abstraction is useful for multiservice networks in which applications have diverse transport requirements such as variable data rates and unidirectional data flow. Canonical multicast primitives suitable for a variety of data delivery requirements that allow flexible creation and removal of edges in a graph are presented. Simple and extensible routing algorithms to realize the primitives are also presented
Keywords :
directed graphs; protocols; tree data structures; acyclic graph; data directionality; high speed multi-service networks; multicast models; routing algorithms; transport quality; tree structured communication channels; unidirectional data flow; user specifiable attributes; variable data rates; wide-area packet multicasting; Communication channels; Communication switching; Computer architecture; Computer networks; Digital TV; Multicast algorithms; Optical switches; Packet switching; Routing; Tree graphs;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Distributed Computing Systems, 1992., Proceedings of the 12th International Conference on
Conference_Location :
Yokohama
Print_ISBN :
0-8186-2865-0
Type :
conf
DOI :
10.1109/ICDCS.1992.235039
Filename :
235039
Link To Document :
بازگشت