H. F. Salama, D. S. Reeves, and Y. Viniotis. Evaluation of Multicast Routing Algorithms for Real-Time Communications on High-Speed Networks. IEEE J. on Selected Areas in Comm., 15(3):332--345, Apr. 1997.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....combined, and any loops eliminated by removing edges from T 1 . The running time of SL is O(jV j ) Its performance is compared to the KPP heuristic, and it is found to produce solutions between 15 and 30 worse than KPP, although still better than a simple least delay solution. Salama et al. [Salama97] evaluate and compare these and a number of other source based multicast routing algorithms. As expected, SL is found to give consistently worse results than KPP in terms of both cost and maximum end to end delay, but runs signi cantly faster. The choice between these two algorithms may be ....

Hussein F. Salama, Douglas S. Reeves, and Yannis Viniotis. Evaluation of Multicast Routing Algorithms for Real-Time Communication on High-Speed Networks. IEEE Journal on Selected Areas in Communications, 15(3):332-345, April 1997. (p 77)

....Steiner tree algorithm. They evaluate these algorithms from the point of view of its suitability to multimedia streams and real time applications. They had used the optimal algorithm they proposed in [16] as a benchmark of other algorithms. A more recent evaluation had been done by Salama et al. [40] where they evaluated three unconstrained shortest path tree algorithms with one unconstrained Steiner tree algorithm. Also, they evaluated one constrained shortest path tree algorithm with three constrained Steiner tree algorithm. An exhaustive survey on problems related to multicasting like ....

H. Salama, D. Reeves and Y. Viniotis, "Evaluation of Multicast Routing Algorithms for Real-Time Communication on High-Speed Networks", IEEE Journal on Selected Areas of Communication, Vol. 15, No. 3, pp. 332-345 April 1997.

....is clear that the commercial value and social impact of a service depends heavily on its ability to maintain a consistent quality level. The emerging multimedia applications have stringent Quality of Service (QoS) requirements. For example, real time applications demand bounded end to end delay [39] [29] Other related end to end QoS metrics are the packet loss ratio and the required bandwidth of a connection, while end to end path length is a routing metric strongly correlated to QoS [46] In this paper, we use the end to end delay as a representative of the end to end QoS requirements. If ....

H. F. Salama, D. S. Reeves, and Y. Viniotis. Evaluation of multicast routing algorithms for real-time communication on highspeed networks. IEEE Journal of Selected Areas in Communications, 15(13):332-345, April 1997.

....minimal cost spanning trees constrained by delay. They propose an algorithm (KPP) that nds a minimal cost tree with a bounded delay from the source to each destination. The algorithm is intended for source routing because it considers the complete knowledge of the network topology. Salama et al. [100] evaluated several multicast routing algorithms that are both centralized and static. The routing objective is to construct trees with bounded maximum delay, while minimum cost to provide e cient network utilization. Routing with resource reservations Rajagopalan and Nair [51] analyze the ....

H. F. Salama, D. S. Reeves, and Y. Viniotis, Evaluation of multicast routing algorithms for real-time communication on high-speed networks, IEEE Journal on Selected Areas in Communications, vol. 15, no. 3, pp. 332345, Apr. 1997.

....the value of k as our simulations indicate in the next section. 5 Simulation Model and Results 5.1 Simulation Model We built a discrete event simulator to investigate the performance of di erent algorithms in a realistic communication environment. We use the same graph generation process as in [15] where the positions of the nodes lie in a rectangular area. A random generator based on Waxman s generator [18] is used to create links interconnecting the nodes. Some modi cations are added to ensure that the generated network is connected and the probability of existence of a short link is ....

H.F. Salama, D.S. Reeves, and Y. Viniotis. Evaluation of Multicast Routing Algorithms for Real-Time Communication on High-Speed Networks. IEEE J. Select. Areas Commun., 15:332-346, April 1997.

.... is to bound the end to end delay on paths from a single source to all destinations and try to minimize the total cost of the tree (as a summation of c(e) for all e 2 T where T is the multicast tree) A survey of those algorithms can be found in [7] and some performance evaluation can be found in [26, 29]. For single metric routing, Shortest Path Tree(SPT) optimizes delay from source to all destinations, and Minimum Cost Spanning Tree(MCST) minimizes the total cost of the tree. Several centralized multiplemetric (e.g. cost and delay) heuristics are variations of such single metric algorithms. The ....

H. Salama, D. S. Reeves, and Y. Viniotis, "Evaluation of multicast routing algorithms for real-time communications on high-speed networks", IEEE Journal on Selected Areas in Communications, Vol.15(3), April 1997.

....for all e 2 T where T is the multicast tree) In IP networks, a source(receiver) node would be a router which has end user computer in its subnet as a traffic source(receiver) of the multicast group. A survey of those algorithms can be found in [2] and some performance evaluation can be found in [12]. Many centralized multiple metric(e.g. cost and delay) heuristic algorithms are variations of the well known single metric algorithms: Shortest Path Tree(SPT) that optimizes delay from source to all destinations, and Minimum Cost Spanning Tree(MCST) that minimizes the total cost of the tree. ....

H. Salama, D. S. Reeves, and Y. Viniotis. Evaluation of multicast routing algorithms for real-time communications on high-speed networks. In IEEE Journal of Selected Areas in Communications, Vol.15(3), pp.332-344, April 1997.

....Steiner tree problem is to find the least cost tree with bounded delay. It is also called the delay constrained least cost routing problem, belonging to the tree constrained tree optimization routing problem class. Finding either a Steiner tree or a constrained Steiner tree is NPcomplete [48]. The delay delayjitter constrained multicast routing problem belongs to the multi tree constrained routing problem class. It is also NP complete [46] under the assumptions that (1) the metrics under constraints are independent and (2) they are allowed to take real numbers or unbounded integer ....

....2) Widyono algorithm uses the constrained Bellman Ford (CBF) algorithm. Widyno pointed out that there are cases where the running time of CBF grows exponentially. However, simulation shows that its average performance is comparable to other algorithms that construct constrained Steiner trees [48]. 3) k and l are constants in the algorithm. A larger k (or l) results in a higher probability of finding a feasible tree and a higher overhead. 11 ( c ) b ) a ) cost mapping t cost mapping: original new 0.0 0 (0.0, 4.0] 1 (4.0, 8.0] 2 (8.0, 12.0] 3 (12.0, 16.0] 4 (16.0, 20.0] 5 ....

[Article contains additional citation context not shown here]

Hussein F. Salama, Douglas S. Reeves, and Yannis Viniotis, Evaluation of Multicast Routing Algorithms for Real-Time Communication on High-Speed Networks. IEEE Journal on Selected Areas in Communications, 15(3):332-345, April 1997.

....with M active senders. At some point in the future it may become necessary to institute some market driven or administrative mechanism for multicast address allocation [20,22,23] There are several studies that compare the performance and resource costs of various multicast routing protocols [3,12,24,28,29]. In addition to link usage (as measured by tree costs) the different protocols are also evaluated in terms of delay and traffic PRICING MULTICAST COMMUNICATION 283 Figure 1. Transmission vs. computing cost trends. Source: Spragins et al. Telecommunications: Protocol and Design (1991) p. 25. ....

....from the local copy. This would mean that the sender would only need to transmit N R copies even in unicast mode. 292 CHUANG AND SIRBU In addition to bandwidth usage, there are many other dimensions to the tradeoff between DM and SM multicast, and these have been extensively studied elsewhere [3,12,24,28,29]. As a general rule of thumb, DMmulticast is perceived to be appropriate for content distribution applications, whereas SM multicast is more suited for teleconferencing and other applications with just a few receivers. The question is: should dense and sparse mode multicast be priced differently ....

H.F. Salama, D.S. Reeves and Y. Viniotis, Evaluation of multicast routing algorithms for real-time communication on high-speed networks, IEEE Journal on Selected Areas in Communications 15(3) (1997) 332--345. PRICING MULTICAST COMMUNICATION 297

....has shifted toward the development of routing protocols that find paths based on meeting application requirements and increasing network utilization. Research in this area has concentrated on designing and evaluating Quality of Service (QoS) routing protocols for unicast [11] 12] and multicast [13], 14] In this work, an application is assumed to specify a QoS request to the network as some combination of delay, bandwidth, and loss characteristics. The QoS routing protocol then computes the minimum cost path that has available resources and installs this path for the application. Such ....

Hussein F. Salama, Douglas S. Reeves, and Yannis Viniotis, "Evaluation of Multicast Routing Algorithms for Real-Time Communication on High-Speed Networks," IEEE Journal on Selected Areas in Communications, vol. 15, no. 3, April 1997.

....phase (steps 26 27) also requires O(jEj) time. Therefore, the asymptotic running time of the QDMR algorithm is O(jEj log jV j jEj jEj) O(jEj log jV j) 2 IV. RELATED WORK In this section, we briefly discuss some recently proposed delay constrained Steiner tree heuristics. Reference [14] provides a good survey. The KPP [10] and the CKMB [17] heuristics both extend KMB, an unconstrained Steiner tree heuristic [11] KMB first converts the original network graph into a complete graph connecting multicast group members, where a (logical) edge represents the least cost path between ....

....if the delay bound is violated for some destination node, the least delay path is simply used in its entirety, leading to further increase in tree cost. The time complexity of CDKS is O(jV j 2 ) BSMA [22] is another multicast algorithm that is considered the best in terms of tree cost [14]. BSMA iteratively replaces the edges in the tree until the tree cost can not be further reduced. This makes the algorithm computationally very expensive to be used for large scale networks. The average time complexity of BSMA is O(kjV j 3 log jV j) where k is the average number of lower cost ....

[Article contains additional citation context not shown here]

H. F. Salama, D. S. Reeves, and Y. Viniotis, "Evaluation of multicast routing algorithms for real-time communication on high-speed networks," IEEE J. Select. Areas Commun., vol. 15, pp. 332--346, Apr. 1997.

....minimal cost spanning trees constrained by delay. They propose an algorithm (KPP) that nds a minimal cost tree with a bounded delay from the source to each destination. The algorithm is intended for source routing because it considers the complete knowledge of the network topology. Salama et al. [59] evaluated several multicast routing algorithms that are both centralized and static. The routing objective is to construct trees with bounded maximum delay, while minimum cost to provide good network utilization. 7.7.2 Alternate path routing MORF is a multicast setup protocol intended to be ....

H.F. Salama, D.S. Reeves, and Y. Viniotis. Evaluation of multicast routing algorithms for realtime communication on high-speed networks. IEEE Journal on Selected Areas in Communications, 15(3):332-345, April 1997.

.... to bound the end to end delay on paths from a single source to all destinations and try to minimize the total cost of the tree (as a summation of c(e) for all e # T where T is the multicast tree) A survey of those algorithms can be found in [7] and some performance evaluation can be found in [26], 29] For single metric routing, Shortest Path Tree(SPT) optimizes delay from source to all destinations, and Minimum Cost Spanning Tree(MCST) minimizes the total cost of the tree. Several centralized multiple metric(e.g. cost and delay) heuristics are variations of such single metric ....

H. Salama, D. S. Reeves, and Y. Viniotis, "Evaluation of multicast routing algorithms for real-time communications on high-speed networks", IEEE Journal on Selected Areas in Communications, Vol.15(3), April 1997.

....focussed on the undirected versions of the Steiner problems. However, there are many networks in practice where the communications links are asymmetric and cannot be modeled by undirected edges. The problem of multicast routing in asymmetric networks has received considerable attention recently [21, 22]. From a theoretical point of view, the directed version of the Steiner tree problem is very useful for the following reason. A wide variety of problems involving connectivity and covering, in both directed and undirected graphs, can be reduced to this problem in approximation preserving ways. ....

H.F. Salama, "Evaluation of multicast routing algorithms for real-time communication on high-speed networks", IFIP Sixth International Conference on High Performance Networking, pp. 27-42 (1995).

....tree can be as large as the number of destinations. There is need to study the performance of different heuristics to generate multicast trees in a realistic network environment by taking QoS requirements of the application under identical network conditions [11] In a recent study, Salama et al. [6] has given a comprehensive study of a number of multicast algorithms for real time communication. However, their work does not couple the performance analysis of algorithms with QoS routing metrics. In this paper, we first introduce a new routing metric and then propose two QoS based multicast ....

H.F. Salama, D.S. Reeves, and Y. Viniotis. Evaluation of Multicast Routing Algorithms for Real-Time Communication on High-Speed Networks. IEEE J. Select. Areas Commun., 15(3):332--345, April 1997.

....multicast trees considered only source specific trees. Several algorithms for constructing delay constrained source specific multicast trees has been studied by several research groups in recent years [2, 3, 4, 5, 6, 7, 8] We present a comparison of different source specific algorithms in [9]. In this paper, we study delay constrained shared multicast trees. Shared trees have the following advantages over source specific trees. It takes less overhead to construct and maintain one shared tree per multicast session than to construct a source specific tree for every source. With shared ....

H. Salama, D. Reeves, and Y. Viniotis, "Evaluation of Multicast Routing Algorithms for Real-Time Communication on High-Speed Networks." accepted for publication in the IEEE Journal on Selected Areas in Communications.

No context found.

H. F. Salama, D. S. Reeves, and Y. Viniotis. Evaluation of Multicast Routing Algorithms for Real-Time Communications on High-Speed Networks. IEEE J. on Selected Areas in Comm., 15(3):332--345, Apr. 1997.

No context found.

H. F. Salama, D. S. Reeves, and Y. Viniotis, "Evaluation of Multicast Routing Algorithms for Real-Time Communication on High-Speed Networks," IEEE J. on Select. Areas Comm., vol. 15, no. 3, April 1997.

No context found.

Hussein F. Salama, Douglas S. Reeves, and Yannis Viniotis. Evaluation of multicast routing algorithms for real-time communication on high-speed networks. IEEE Journal on Selected Areas in Communications, 15(3):332--345, April 1997.

No context found.

H.F. Salama, D.S. Reeves, and Y. Viniotis, Evaluation of Multicast Routing Algorithms for Real-Time Communication on High-Speed Networks, IEEE Journal on Selected Areas in Communications, 3:332--345 (1997).

No context found.

H. F. Salama, D. S. Reeves, and Y. Viniotis. Evaluation of multicast routing algorithms for real-time communication on high-speed networks. IEEE Journal of Selected Areas in Communications, 15(13):332-345, April 1997.

No context found.

H. F. Salama, D. S. Reeves, and Y. Viniotis, "Evaluation of multicast routing algorithms for real-time communications on high-speed networks, " IEEE J. Select. Areas Commun., vol. 15, pp. 332--345, Apr. 1997.

No context found.

H. F. Salama, D. S. Reeves, Y. Viniotis, Evaluation of multicast routing algorithms for real-time communication on high-speed networks, IEEE Journal on Selected Areas In Communications 15 (3).

No context found.

Hussein F. Salama, Douglas S. Reeves, Yannis Viniotis, "Evaluation of Multicast Routing Algorithms for Real-Time Communication on High-Speed Networks", in IEEE JSAC, Vol 15, No. 3, April 1997, pp.332-345.

No context found.

Hussein F. Salama, Douglas S. Reeves, Yannis Viniotis, "Evaluation of Multicast Routing Algorithms for Real-Time Communication on High-Speed Networks", in IEEE JSAC, Vol 15, No. 3, April 1997, pp.332-345.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC