In this report, we present a general framework for the problem of QoS multicast and unicast routing with resource allocation. Our framework uses functional forms derived from various queuing service disciplinesfor the QoS parameters rather than static metrics. We give formal definitions of the QoS multicast and unicast routing with resource allocation problems. This problem formulation is diffe...

There is an increasing need to support user mobility in today's computing environments. The incorporation of multicast routing support in a mobile computing environment presents several challenges. Of special interest are mobile multicast schemes suitable for TCP/IP networks in general, and the Internet in particular. This paper outlines a design of network layer modules in a 4.3 BSD UNIX TM sy...

PIM-SM is the routing protocol which describes the exchange of the network topology information in order to construct logical multicast trees. Multicast traffic is routed along these multicast trees in order to more efficiently utilize the network resources. In this paper, we evaluate capabilities of the open-source implementations which allow routing of multicast traffic: Quagga, and Pimd.

Our aim is to investigate reliable transmission for multicast communication and explore its relationship to multicast routing. We derive two characterizations that enable the comparison of routing algorithms and error recovery mechanisms with respect to the multicast tree topology, namely the probability mass function of successful receptions and the expected number of retransmissions needed to...

An important problem in both wireless and wired communication networks is to be able to efficiently multicast information to a group of network sites. Multicasting reduces the transmission overhead of both wireless and wired networks and the time it takes for all the nodes in the subset to receive the information. Since transmission bandwidth is a scarce commodity especially in wireless network...

Multicast 1 is one of the best available service models for scalable, manyto-many delivery of data on the Internet. Multicast achieves scalability by letting sources send a packet only once, regardless of the number of receivers. In network-layer multicast, network elements (routers, switches, and so on) replicate packets at network branching points, delivering copies to all interested receiver...

To support real-time multimedia applications in BISDN networks, QoS guaranteed multicast routing is essential. Traditional multicast routing algorithms used for solving the Steiner tree problem cannot be used in this scenario, because QoS constraints on links are not considered. In this paper, we present two e$cient source-based multicast routing algorithms in directed networks. The objective o...

A novel internet multicast routing protocol is presented to possess efficiency and effectiveness for multicast packet routing with short delay, high throughput, resource utilization and scalability for a single multicast group g. The protocol has two features: (1) Multiple Shared-Trees (MST) are configured to provide efficient, dynamic and quality multicast routing; (2) Anycasting approach is a...

Multicast 1 is one of the best available service models for scalable, many-to-many delivery of data on the Internet. Multicast achieves scalability by letting sources send a packet only once, regardless of the number of receivers. In network-layer multicast, network elements (routers, switches, and so on) replicate packets at network branching points, delivering copies to all interested receive...

In this paper we describe a debugging tool that is an eeective means of analyzing problems with multicast packet routing in a network. Multicast packet routing is a source-driven distributed calculation performed by the routers in a multicast network. The routes taken by multicast packets are diicult to predict manually due to the large number of variables that must be considered. The multicast...