Efficient rendezvous point tree to shortest path tree...

Details Efficient rendezvous point tree to shortest path tree... Efficient rendezvous point tree to shortest path tree...

2003-06-04

2008-11-18

Rao, Seema S. (Department: 2616)

Multiplex communications

Data flow congestion prevention or control

Flow control of data transmission through a network

C370S252000, C370S400000

Reexamination Certificate

active

07453807

ABSTRACT:
A method of operating a network node in PIM-SM (Protocol Independent Multicast-Sparse Mode) is disclosed. In one embodiment, a Rendezvous Point Tree (RPT) to Shortest Path Tree (SPT) switch over process is initiated after the packet flow rate of the RPT data stream is compared against a predetermined threshold using a reverse rate limiting technique. If the packet flow rate of the RPT data stream exceeds the threshold, further analysis can be performed to decide whether the RPT to SPT switch over process should be initiated. Otherwise, if the packet flow rate does not exceed a predetermined threshold, the network node continues to receive multicast packets via the RPT until the predetermined threshold is reached.

REFERENCES:
patent: 6321270 (2001-11-01), Crawley
patent: 2001/0034793 (2001-10-01), Madruga et al.
patent: 2003/0007485 (2003-01-01), Venkitaraman et al.
patent: 2003/0088696 (2003-05-01), McCanne

Affiliated with

Also associated with

Rating

Efficient rendezvous point tree to shortest path tree... 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 rendezvous point tree to shortest path tree..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient rendezvous point tree to shortest path tree... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4034441