Aggregating Multicast Demands on Virtual Path Trees

نویسندگان

  • Michael Montgomery
  • Gustavo de Veciana
چکیده

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.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multicast Demands on Virtual PathTrees

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 tradeoos between cost, complexity, and eeciency 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, ...

متن کامل

Multipoint LDP (mLDP) In-Band Signaling with Wildcards

There are scenarios in which an IP multicast tree traverses an MPLS domain. In these scenarios, it can be desirable to convert the IP multicast tree "seamlessly" into an MPLS Multipoint Label Switched Path (MP-LSP) when it enters the MPLS domain, and then to convert it back to an IP multicast tree when it exits the MPLS domain. Previous documents specify procedures that allow certain kinds of I...

متن کامل

Efficient Support for Multicast Applications over VP-Based ATM Networks

In this paper, we present a new network design problem that is applicable for designing virtual paths (VP’s) in an asynchronous transfer mode (ATM) network to efficiently support multicast applications, especially real-time multimedia applications. We first address several alternatives for the solution and compare their properties. Then we focus on a new solution which sets up a semi-permanent ...

متن کامل

A Fault-tolerant Multicast Routing Algorithm in ATM Networks

This paper presents a genetic algorithm based method to solve the capacity and routing assignment problem arising in the design of selfhealing networks using the Virtual Path (VP) concept. Past research has revealed that Preplanned Backup Protection method and the Path Restoration scheme can provide a best compromise on the reserved spare capacity and the failure restoration time. Base on a set...

متن کامل

Hydra: Efficient multicast routing in MANETs using sender-initiated multicast meshes

We present Hydra, the first multicast routing protocol for MANETs that establishes a multicast routing structure approximating the set of source-rooted shortest-path trees frommulticast sources to receivers, without requiring the dissemination of control packets from each source of a multicast group. Hydra accomplishes this by dynamically electing a core for the mesh of a multicast group among ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Telecommunication Systems

دوره 16  شماره 

صفحات  -

تاریخ انتشار 2001