Arrangement for preventing count-to-infinity in flooding...

Details Arrangement for preventing count-to-infinity in flooding... Arrangement for preventing count-to-infinity in flooding...

2011-04-12

2011-04-12

Ngo, Ricky (Department: 2464)

Multiplex communications

Data flow congestion prevention or control

Flow control of data transmission through a network

C370S254000, C370S351000

Reexamination Certificate

active

07924726

ABSTRACT:
Each router in a network is configured for generating router advertisement messages according to a flooding distance vector routing protocol. Each router advertisement message output according to the flooding distance vector routing protocol includes reachability information for at least one destination, and an originating router identifier indicating a router having originated the reachability information. If any router receiving the router advertisement message detects a match between the originating router identifier and the corresponding assigned router identifier, the received router advertisement message is disregarded during calculation of the best paths from the network. If the originating router identifier identifies another router, the router floods the received router advertisement message to other ports, and output its own router advertisement message based on the received router advertisement message and that specifies the originating router identifier from the received router advertisement message.

REFERENCES:
patent: 5253248 (1993-10-01), Dravida et al.
patent: 6118760 (2000-09-01), Zaumen et al.
patent: 6535498 (2003-03-01), Larsson et al.
patent: 6628624 (2003-09-01), Mahajan et al.
patent: 7035227 (2006-04-01), Garcia-Luna-Aceves et al.
patent: 7042850 (2006-05-01), Stewart
patent: 2002/0023163 (2002-02-01), Frelechoux et al.
patent: 2003/0037167 (2003-02-01), Garcia-Luna-Aceves et al.
patent: 2003/0090996 (2003-05-01), Stewart
patent: 2003/0140165 (2003-07-01), Chiu et al.
patent: 2003/0202473 (2003-10-01), Patrick et al.
patent: 2003/0218988 (2003-11-01), Han et al.
patent: 2004/0039839 (2004-02-01), Kalyanaraman et al.
patent: 2004/0057440 (2004-03-01), Thubert et al.
patent: 2004/0081152 (2004-04-01), Thubert et al.
patent: 2004/0258002 (2004-12-01), Tran et al.
patent: 2005/0195835 (2005-09-01), Savage et al.
patent: 2005/0265259 (2005-12-01), Thubert et al.
Elizabeth M. Royer, University of California, Santa Barbra Chai-Keong Toh, Georgia Institute of technology, 1999 IEEE “A Review of current Routing Protocols for Ad Hoc Mobile Wireless Networks”.
Rabjenovic et al. (Hereafter Rabjenovic ) Internal Routing Protocol Gigabit CARNet Network-Selection and Transition, Jun. 7, 2004.
Coltun et al, “OSPP for IPv6”, Network Working Group, Request for Comments: 2740, Dec. 1999.
Coltun et al, “OSPF for IPv6”, Network Working Group, Request for Comments: 2740, Dec. 1999, pp. 1-80.
Perkins, ed, “Ad Hoc Networking”, 2001, pp. 20-22, 53-57, Addison-Wesley.
“Internetworking Technologies Handbook,” Apr. 10, 2002, Chapter 40, pp. 40-1-40-6, Cisco Systems, Inc.
Malkin. “RIP Version 2 Carrying Additional Information”, Network Working Group, Request for Comments: 1723, Nov. 1994.
Moy, “OSPF Version 2”, Network Working Group, Request for Comments: 2328, Apr. 1998.
Albrightson et al., “EIGRP—A Fast Routing Protocol Based on Distance Vectors”, Proc. Networld/Interop 94, 1994, XP008106882, pp. 1-13.
Hedrick, “Routing Information Protocol”, Network Working Group, Request for Comments: 1058, Jun. 1988, pp. 1-33.

Affiliated with

Also associated with

Rating

Arrangement for preventing count-to-infinity in flooding... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Arrangement for preventing count-to-infinity in flooding..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Arrangement for preventing count-to-infinity in flooding... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2667134