Abstract
In ATM networks, Virtual Path Connections (VPCs) are not only a device for bundling Virtual Circuit Connections (VCCs), but they serve as an intermediate resource management layer wherein tradeoffs between cost, complexity, and efficiency are likely to be made on a slower time scale than connection holding times. In this paper we consider bundling multicast connections on VP trees. In particular, we show that the aggregation of multicast demands onto large VP trees can be an effective way to reduce capacity requirements, balance network loads, and reduce the number of VP trees required.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. Ballardie, Core Based Trees (CBT version 2) multicast routing: Protocol specification, RFC 2189 (September 1997).
A. Ballardie, Core Based Trees (CBT) multicast routing architecture, RFC 2201 (September 1997).
M. Borden, E.S. Crawley, B.S. Davie and S.G. Batsell, Integration of real-time services in an IP-ATM network architecture, RFC 1821 (August 1995).
R.J. Gibbens and F.P. Kelly, Network programming methods for loss networks, IEEE Journal on Selected Areas in Communications 13(7) (September 1995) 1189-1198.
F.P. Kelly, Blocking probabilities in large circuit-switched networks, Advances in Applied Probability 18(2) (June 1986) 473-505.
F.P. Kelly, Routing and capacity allocation in networks with trunk reservation, Mathematics of Operations Research 15(4) (November 1990) 771-793.
S.-B. Kim, An optimal VP-based multicast routing in ATM networks, in: Proc. IEEE INFOCOM '96, Vol. 3 (1996) pp. 1302-1309.
D. Mitra and J.A. Morrison, Erlang capacity and uniform approximations for shared unbuffered resources, IEEE/ACM Transactions on Networking 2(6) (December 1994) 558-570.
M. Montgomery, Managing complexity in large-scale networks via flow and network aggregation, Ph.D. thesis, The University of Texas at Austin (August 1998).
D. Niehaus et al., Performance benchmarking of signaling in ATM networks, IEEE Communications 35(8) (August 1997) 134-143.
F.S. Roberts, Applied Combinatorics (Prentice-Hall, Englewood Cliffs, NJ, 1984).
S. Sigarto, Private communication, SBC Technology Resources, Inc. (March 1998).
C.-F. Su and G. de Veciana, On statistical multiplexing, traffic mixes, and VP management, in: Proc. IEEE INFOCOM '98, Vol. 2 (1998) pp. 643-650.
R. Syski, Introduction to Congestion Theory in Telephone Systems, Studies in Telecommunication, Vol. 4, 2nd ed. (Elsevier, Amsterdam, 1986).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Montgomery, M., de Veciana, G. Aggregating Multicast Demands on Virtual Path Trees. Telecommunication Systems 16, 483–501 (2001). https://doi.org/10.1023/A:1016635515688
Issue Date:
DOI: https://doi.org/10.1023/A:1016635515688