Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
IEEE/ACM Transactions on Networking (TON)
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
IEEE/ACM Transactions on Networking (TON)
Network support for multimedia: a discussion of the Tenet approach
Computer Networks and ISDN Systems - Special issue on a multi-dimensional view of multimedia
Videoconferencing on the Internet
IEEE/ACM Transactions on Networking (TON)
Concurrent Asynchronous Broadcast on the MetaNet
IEEE Transactions on Computers
Pseudo-isochronous cell forwarding
Computer Networks and ISDN Systems
Adaptive group multicast with time-driven priority
IEEE/ACM Transactions on Networking (TON)
Resource sharing for multi-party real-time communication
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3
"Time-driven priority" flow control for real-time heterogeneous internetworking
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Reliable concurrent multicast from bursty sources
IEEE Journal on Selected Areas in Communications
Combined space and time analysis of Banyan networks
HPSR'09 Proceedings of the 15th international conference on High Performance Switching and Routing
Mutually independent hamiltonian cycles of binary wrapped butterfly graphs
Mathematical and Computer Modelling: An International Journal
Optical Switching and Networking
| Hi-index | 0.00 |
In general topology networks, routing from one node to another over a tree embedded in the network is intuitively a good strategy, since it typically results in a route length of O(log n) links, being n the number of nodes in the network. Routing from one node to another over a ring embedded in the network would result in route length of O(n) links. However, in group (many-to-many) multicast, the overall number of links traversed by each packet, i.e., the networks elements on which resources must be possibly reserved, is typically O(N) for both tree and ring embedding, where N is the size of the group. This paper focuses on the tree versus ring embedding for real-time group multicast in which all packets should reach all the nodes in the group with a bounded end-to-end delay. In this paper, real-time properties are guaranteed by the deployment of time-driven priority in network nodes.In order to have a better understanding of the nontrivial problem of ring versus tree embedding, we consider the following group multicast scenarios: 1) static--fixed subset of active nodes, 2) dynamic--fixed number of active nodes (i.e., the identity of active nodes is changing over time, but its size remains constant), and 3) adaptive--the number and identity of active nodes change over time.Tree and ring embedding are compared using the following metrics: 1) end-to-end delay bound, 2) overall bandwidth allocated to the multicast group, and 3) signaling overhead for sharing the resources allocated to the group. The results are interesting and counterintuitive, since, as shown, embedding a tree is not always the best strategy. In particular, dynamic and adaptive multicast on a tree require a protocol for updating state information during operation of the group. Such a protocol is not required on the ring where the circular topology, and implicit token passing mechanisms are sufficient. Moreover, the bandwidth allocation on the ring for the three multicast scenarios is O(N), while on a general tree it is O(N) for the static multicast scenario and O(N2) for the dynamic and adaptive multicast scenarios.