Cost analysis of multicast transport architectures in multiservice networks

The paper provides a cost analysis of multicast channels in terms of transport resources allocated by the network. The analysis takes into account the diverse transport requirements of applications in multiservice networks such as multisource broadcasting of data to a common set of destinations, bidirectional/unidirectional data transfers among entities, and variable transfer rates of data. The cost model consists of mapping the transport attributes to resource demands and computing the network-wide resource consumptions for data transport. The cost analysis is independent of the specifics of the backbone network transporting the multicast data and, hence, can provide a network-independent measure of the cost-effectiveness of various multicast architectures. The usefulness of the cost model is illustrated by analyzing multicast data transport costs in "group shared tree" (GST) and "source-specific tree" (SST) architectures, with both empirical and simulation studies. The cost analysis methodology can be useful in the design and/or evaluation of multiservice data transport architectures. It can also offer a basis for the network provider to implement customer billing functions in a "pay-for-service" type of network management environment envisaged for multiservice networks.

[1]  Deborah Estrin,et al.  The PIM architecture for wide-area multicast routing , 1996, TNET.

[2]  Stephen E. Deering,et al.  Multicast routing in datagram internetworks and extended LANs , 1990, TOCS.

[3]  George C. Polyzos,et al.  Multicasting for multimedia applications , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[4]  George N. Rouskas,et al.  Multicast Routing with End-to-End Delay and Delay Variation Constraints , 1997, IEEE J. Sel. Areas Commun..

[5]  Andrew T. Campbell,et al.  A quality of service architecture , 1994, CCRV.

[6]  John Moy,et al.  Multicast routing extensions for OSPF , 1994, CACM.

[7]  Claudio Topolcic,et al.  Experimental Internet Stream Protocol: Version 2 (ST-II) , 1990, RFC.

[8]  Béla Bollobás,et al.  Random Graphs , 1985 .

[9]  Scott Shenker,et al.  Fundamental Design Issues for the Future Internet (Invited Paper) , 1995, IEEE J. Sel. Areas Commun..

[10]  Deborah Estrin,et al.  An architectural comparison of ST-II and RSVP , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[11]  Stephen E. Deering,et al.  Distance Vector Multicast Routing Protocol , 1988, RFC.

[12]  Dinesh C. Verma,et al.  Routing reserved bandwith multi-point connections , 1993, SIGCOMM 1993.

[13]  Deborah Estrin,et al.  An architecture for wide-area multicast routing , 1994, SIGCOMM 1994.

[14]  Pawel Winter,et al.  Steiner problem in networks: A survey , 1987, Networks.

[15]  K. Bharath-Kumar,et al.  Routing to Multiple Destinations in Computer Networks , 1983, IEEE Trans. Commun..

[16]  James Kadirire Minimising packet copies in multicast routing by exploiting geographic spread , 1994, CCRV.

[17]  Nicholas F. Maxemchuk,et al.  Video Distribution on Multicast Networks , 1997, IEEE J. Sel. Areas Commun..

[18]  Deborah Estrin,et al.  Sharing the “cost” of multicast trees: an axiomatic analysis , 1997, TNET.

[19]  Jon Crowcroft,et al.  Core Based Trees (CBT) An Architecture for Scalable Inter-Domain Multicast Routing , 1993, SIGCOMM 1993.

[20]  K. Ravindran,et al.  A Flexible Network Architecture for Data Multicasting in "Multiservice Networks" , 1995, IEEE J. Sel. Areas Commun..

[21]  K. Ravindran Communication Channels for Data Multicasting in Multi-service Networks , 1995 .

[22]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..