Method and apparatus for multicast routing in a network

Electrical computers and digital processing systems: multicomput – Computer-to-computer data routing

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S390000

Reexamination Certificate

active

06321270

ABSTRACT:

BACKGROUND OF THE INVENTION
1. Field of the Invention
The present invention relates to networks and, more specifically, to a system for routing data through a network.
2. Background
The flow of data through a network is accomplished by transmitting data from one network node to another until the destination node is reached. Various protocols are available for transmitting data through a network. The protocol selected may be based on the type of network, the network topology, the type of data flowing through the network, and other factors. Two different classes of routing protocols are available for transmitting data through a network: unicast routing protocols and multicast routing protocols. Unicast routing protocols transmit data from a single source node to a single destination node. Multicast routing protocols transmit data from one or more source nodes to multiple destination nodes. Typically, the multiple destination nodes are members of a multicast group such that each member of the group receives data addressed to the group. Multicast routing protocols allow the sending nodes to transmit data to a single multicast address identifying the multicast group rather than generating separate packets or data flows for each destination node in the group.
Multicast routing protocols utilize multicast distribution trees to identify multicast group members and paths from the source node to each group member. A separate multicast distribution tree is typically provided for each sending node in a multicast group. Multicast distribution trees are updated in response to changes in network topology and changes in multicast group membership. For example, an existing multicast distribution tree may be expanded when new multicast group members are added. An existing multicast distribution tree may be reduced, or pruned, if existing group members are removed from a multicast group.
Various mechanisms are available for controlling the maintenance of multicast distribution trees and controlling the flow of multicast data through a network. Known multicast routing protocols use a “core” or “rendezvous point” for both controlling the maintenance of multicast distribution trees and controlling the flow of data in a multicast session. The core or rendezvous point is a particular node in the network responsible for maintaining and updating the multicast distribution tree. Additionally, the core or rendezvous point is responsible for handling the flow of data to all multicast group members. By combining the control and data flow operations in a single node, a failure in that control node will cause disruption of both the control functions and the data flow associated with the multicast session.
Other known multicast routing protocols distribute multicast group membership information to all nodes in the network or network area, thereby avoiding the use of a single node responsible for both control and data flow. By distributing multicast group membership information to all nodes, each node in the network is capable of calculating the multicast distribution tree as needed. This distribution of group membership information requires that each node store information related to all multicast sessions, regardless of whether the node is actually participating in the particular multicast session. By requiring distribution of group membership information to every node, this system increases the overall traffic flowing through the network. Additionally, the distribution of group membership information to every node increases the amount of information which must be stored by each node in the network. Thus, network nodes may require additional storage facilities to maintain the various multicast information. As mentioned above, each node receives and stores multicast group information regardless of whether the node is actually participating in the particular multicast session. Therefore, much of the information transmitted to and stored by a particular node may not be used by the node, thereby resulting in the transmission and storage of unnecessary information.
It is therefore desirable to provide a system that does not needlessly transmit multicast group information to all nodes in a network. Furthermore, a robust system would eliminate the single point of failure caused by combining multicast control and data flow operations into a single network node.
SUMMARY OF THE INVENTION
The present invention selects a particular network node as a control point associated with one or more multicast sessions. The control point is responsible for distributing multicast control information to all multicast group members in the network or network area. Multicast session data is not required to flow through the control point. Instead, the control point transmits control information to other network nodes providing instructions for handling multicast session data. Thus, failure of the control point does not cause the entire multicast session to fail. Additionally, the control point transmits control information only to those nodes participating in a particular multicast session. Therefore, the invention does not transmit multicast control information to nodes that are not participating in the multicast session.
An embodiment of the invention provides a system for controlling a multicast session in a network by selecting one of the network nodes as a control point associated with the multicast session. The selected control point determines multicast control information for the multicast session. The control information is then transmitted by the control point to the network nodes participating in the multicast session.
Another aspect of the invention selects one of the network nodes as a secondary control point associated with the multicast session. The secondary control point maintains a copy of control information determined by the control point.
Other embodiments of the invention provide for the establishment of a new control point if the existing control point fails.
Another feature of the invention updates the multicast control information in response to network changes. The updated multicast control information is then transmitted to network nodes participating in the multicast session.


REFERENCES:
patent: 5157663 (1992-10-01), Major et al.
patent: 5195086 (1993-03-01), Baugartner et al.
patent: 5355371 (1994-10-01), Auerbach et al.
patent: 5361256 (1994-11-01), Doeringer et al.
patent: 5517494 (1996-05-01), Green
patent: 5606669 (1997-02-01), Bertin et al.
patent: 5732086 (1998-03-01), Liang et al.
Ballardie, A.J., Reeve, S., Jain, N. “Core Based Tress (CBT) Multicast—Protocol Specification—>draft-ietf-idmr-cbt-spec-05.txt≦,” Inter-Domain Multicast Routing , Internet-Draft, 32 pages.
Deering, S., et al., “Protocol Independent Multicast-Sparse Mode (PIM-SM): Protocol Specification,” draft-ietf-idmr-PIM-SM-spec-02.ps. Internet-Draft, 41 pages.
Multicast Extensions to OSPF (MOSPF), J. Moy, Network Working Group Request for Comments: 1584, Mar. 1994.
Distance Vector Multicast Routing Protcol (DVMRP), T. Pusateri, Internet Engineering Task Force (IETF), draft-ietf-idmr-dvmrp-v3-02, Jul. 1996.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Method and apparatus for multicast routing in a network does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method and apparatus for multicast routing in a network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for multicast routing in a network will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2596746

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.