Static dense multicast path and bandwidth management

Details Static dense multicast path and bandwidth management Static dense multicast path and bandwidth management

2007-07-17

2007-07-17

Dinh, Khanh (Department: 2151)

Electrical computers and digital processing systems: multicomput

Computer-to-computer protocol implementing

Computer-to-computer data transfer regulating

C709S220000, C709S224000, C370S216000, C370S233000

Reexamination Certificate

active

10455833

ABSTRACT:
Improved algorithms are provided for performing path management for a plurality of select data transmission sessions in a multicast network. The algorithms include: constructing a weighted graph which represents topology of the network; assigning load correlated costs to network links; and computing least cost paths for each of the data transmission sessions which accounts for global bandwidth utilization.

REFERENCES:
patent: 6314093 (2001-11-01), Mann et al.
patent: 6362836 (2002-03-01), Shaw et al.
patent: 6363319 (2002-03-01), Hsu
patent: 6842463 (2005-01-01), Drwiega et al.
patent: 2003/0009582 (2003-01-01), Qiao et al.
patent: 2005/0174934 (2005-08-01), Kodialam et al.
patent: 2006/0067235 (2006-03-01), Acharya et al.
patent: 2007/0008884 (2007-01-01), Tang
“Core Based Tree (CBT) Multicast—Architectural Overview and Specification”, Tony Ballardie, University College London, Internet Draft of Internet Engineering Task Force (IETF); Apr. 15, 1995, 36 pages.
“Approximation Algorithms for Directed Steiner Problems”, Moses Charikar, et al., 15 pages.
“An Overview of Quality-of-Service Routing for the Next Generation High-Speed Networks: Problems and Solutions”, Shigang Chen, et al., 19 pages.
“An Architecture for Wide-Area Multicast Routing”, Stephen Deering, et al., 10 pages.
“The PIM Architecture for Wide-Area Multicast Routing”, Stephen Deering, et al., 12 pages.
“Packing Steiner Trees: A Cutting Plane Algorithm and Computational Results”, M. Grotschel, et al., 33 pages.
“Packing Steiner Trees: Polyhedral Investigations”, M. Grotschel, et al., 29 pages.
“Packing Steiner Trees: Further Facets”, M. Grotschel, et al., 20 pages.
“Packing Steiner Trees: Separation Algorithms”, M. Grotschel, et al., 31 pages.
“Survey of Multicast Routing Algorithms and Protocols”, Pragyansmita Paul, et al., 25 pages.
“The Multicast Packing Problem”, Shiwen Chen, et al., 24 pages.
“Quality of Service Routing for Supporting Multimedia Applications”, Zheng Wang, et al., 16 pages.
“An Iterative Algorithm for Delay-Constrained Minimum Cost Multicasting”, Mehrdad Parsa, et al., 40 pages.

Affiliated with

Also associated with

Rating

Static dense multicast path and bandwidth management does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Static dense multicast path and bandwidth management, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Static dense multicast path and bandwidth management will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3813520