K. Bharath-Kumar and J. Jaffe. Routing to Multiple Destination in Computer Networks. IEEE Trans. on Comm., COM-31:343--351, 1983. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Flexible Multicast Routing Protocol For Group Communication - Aggarwal, Paul, al. (2000) (Correct)
....group and is only duplicated for delivery purposes when necessary. In the past decade, there has been an ever increasing interest in the design and 1389 1286 00 see front matter 2000 Elsevier Science B.V. All rights reserved. PII:S1389 1286(99)00123 1 implementation of multicast capabilities [6,11,13,14,32,42,43]. The idea was first implemented in the multicast backbone (Mbone) 15,42] The Mbone began as a small virtual network on top of the existing Internet, workstations served as routers, and multicast packets were exchanged by encapsulating them in unicast packets, termed tunneling. The Distance ....
K. Bharat-Kumar, J.M. Jaffe, Routing to multiple destinations in computer networks, IEEE Transactions on Communications COM-31 (3) (1983) 343 351.
Issues in Overlay Multicast Networks: Dynamic Routing And.. - Shi, Turner (2002) (Correct)
.... Steiner tree A Steiner tree is the optimal multicast tree in terms of total cost, however, the computation of the optimal Steiner tree is NP complete [6] so we compare to an approximate Steiner tree computed using the well known MST heuristic, which has a worst case approximation ratio of 2 [2] and which typically produces near optimal trees. Shortest path tree The shortest path tree is widely used in IP multicast and in some of the application level multicast schemes [3, 5] Each sender in a multicast group uses its own source rooted shortest path tree. The shortest path tree is the ....
Bharath-Kumar and J. M. Jaffe. Routing to Multiple Destinations in Computer Networks. IEEE Transactions on Communications, 31(3):343--351, March 1983.
Unknown - (Correct)
No context found.
K. Bharath-Kumar and J. Jaffe. Routing to Multiple Destination in Computer Networks. IEEE Trans. on Comm., COM-31:343--351, 1983.
Multicast Routing and Wavelength Assignment in WDM.. - Hu, Shuai, Jia, Zhang (2004) (Correct)
No context found.
K. Bharath-Kumar and J. M. Jaffe, Routing to multiple destinations in computer networks, IEEE Transactions on Communications,31(3) (1983), 343-351.
InternationalSer - Osium On Information (Correct)
No context found.
K. Bharath-Kumar and J. M. Ja#e. Routing to multiple destinations in computer networks. IEEE Trans. Commun., 31(3):343--351, Mar. 1983.
Network Coding with a Cost Criterion - Lun, Médard, Ho, Koetter (2004) (1 citation) (Correct)
No context found.
K. Bharath-Kumar and J. M. Ja#e. Routing to multiple destinations in computer networks. IEEE Trans. Commun., 31(3):343--351, Mar. 1983.
Approximation Algorithms for Concave Cost Network Flow Problems - Munagala (2003) (Correct)
No context found.
K. Bharath-Kumar and J.M. Ja e. Routing to multiple destinations in computer networks. IEEE Transactions on Communications, 31(3):343{ 51, 1983.
The Effect Of Asymmetry On The On-Line Multicast Routing Problem - Faloutsos (Correct)
No context found.
K. Bharath-Kumar and J.M. Ja e. Routing to multiple destinations in computer networks. IEEE Trans. on Communications, 31:343-351, 1983.
Multicast Routing with End-to-End Delay and Delay Variation.. - Rouskas, Baldine (1997) (39 citations) (Correct)
No context found.
K. Bharath-Kumar and J. M. Jaffe, "Routing to multiple destinations in computer networks," IEEE Trans. Commun., vol. COMM-31, no. 3, pp. 343--351, Mar. 1983.
The Greedy, the Naive, and the Optimal Multicast Routing: from.. - Faloutsos (1999) (Correct)
No context found.
K. Bharath-Kumar and J.M. Ja e. Routing to multiple destinations in computer networks. IEEE Trans. on Communications, 31:343-351, 1983.
Network Working Group J. Moy Request for Comments: 1585.. - Status Of This (Correct)
No context found.
Bharath-Kumar, K., and J. Jaffe, "Routing to multiple destinations in Computer Networks", IEEE Transactions on Communications, COM-31[3], March 1983.
An Iterative Algorithm for Delay-Constrained.. - Parsa, Zhu.. (1998) (14 citations) (Correct)
No context found.
K. Bharath-Kumar and J. Jaffe, "Routing to multiple destination in computer networks," IEEE Trans. Commun., vol. COM-31, pp. 343--351, 1983.
A Survey of Combinatorial Optimization Problems in Multicast .. - Oliveira, Pardalos (2003) (Correct)
No context found.
K. Bharath-Kumar, J. Ja#e, Routing to multiple destinations in computer networks, IEEE Transactions on Communications 31 (3) (1983) 343--351.
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