Efficient method for storing multicast trees

Details Efficient method for storing multicast trees Efficient method for storing multicast trees

1998-10-21

2003-10-14

Kizou, Hassan (Department: 2662)

Multiplex communications

Channel assignment techniques

Messages addressed to multiple destinations

C370S229000, C370S235000, C370S254000, C370S270000, C370S390000, C370S396000, C370S400000

Reexamination Certificate

active

06633579

ABSTRACT:

FIELD OF THE INVENTION
The present invention is related to multicast connections. More specifically, the present invention is related to multicast connections which have no overlapping branches.
BACKGROUND OF THE INVENTION
Multicast (point-to-multipoint or multipoint-to-point) connections in an ATM network do not necessarily have to form perfect tree graphs to work properly. Branches of a given Be multicast connection can overlap and form “loops” without affecting the correctness of the data flow. Overlapping branches, however, may cause gross inefficiency. A given node on the connection may receive multiple copies of the same data cells unnecessarily, thus wasting bandwidth and processing capacity.
Some multicast connections (e.g., LAN emulation connections) have long holding times. Inefficiency caused by branch overlapping can degrade the overall throughput of the network significantly over a long period of time.
The present invention provides a mechanism for storing and maintaining at the root node of a given multicast connection all the information about the connection necessary to ensure that the connection does not have overlapping branches as parties are added to and deleted from the connection. The stored information is used in conjunction with a path selection algorithm.
SUMMARY OF THE INVENTION
The present invention pertains to a system for multicasting. The system comprises a network comprising nodes and links connecting the nodes. The system comprises a mechanism for forming a multicast connection which does not have overlapping branches.
The present invention pertains to a node in an ATM network. The node comprises a forming mechanism for forming multicast connections in the network which do not have overlapping branches as parties are added or deleted from the connections. The node comprises a port mechanism which connects to the network through which the connections are sent to the network. The forming mechanism is connected to the port mechanism.
The present invention pertains to a method for forming multicast connections. The method comprises the steps of forming a first connection between a first node and a second node. Then there is the step of forming a second multicast connection between the first node and a third node by extending the first connection.


REFERENCES:
patent: 5233604 (1993-08-01), Ahmadi et al.
patent: 5295154 (1994-03-01), Meier et al.
patent: 5331637 (1994-07-01), Francis et al.
patent: 5459725 (1995-10-01), Bodner et al.
patent: 5600642 (1997-02-01), Pauwels et al.
patent: 5606669 (1997-02-01), Bertin et al.
patent: 5630184 (1997-05-01), Roper et al.
patent: 6088333 (2000-07-01), Yang et al.
patent: 6094687 (2000-07-01), Drake, Jr. et al.
patent: 6321270 (2001-11-01), Crawley
patent: 6327252 (2001-12-01), Silton et al.
T. Tedijanto et al. Support for Leaf Initiated Join in PNNI. 1996 ATM Forum/96-1401R3. pp. 1-31.

Affiliated with

Also associated with

Rating

Efficient method for storing multicast trees does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Efficient method for storing multicast trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient method for storing multicast trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3167804