Updating link state information in networks

Multiplex communications – Wide area network – Packet switching

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

370 60, 370 941, 340827, 379221, H04J 324, H04M 700

Patent

active

051289261

ABSTRACT:
Stored information used for routing packets of a network of nodes interconnected by links. A link state packet is sent to the first node indicating the states of links connected to some given node in the network. At the first node, an attempt is made to derive from the link state packet sent in step (a), the states of the links. If the states of fewer than all of the links connected to the given node are derived in step (b), the stored information used for routing packets is updated using the derived link states without regard to other link state packets sent to the first node. Another aspect features organizing, at a node in a network of nodes interconnected by links, a database of entries concerning respective links, by (a) providing indicators associated with the entries, (b) when a link becomes inoperable, setting or clearing the indicator associated with the entry related to the link, and (c) when the link becomes operable, clearing or setting the indicator. Another aspect features organizing information concerning the states of links interconnecting nodes of a network of nodes, the information being grouped in link state packets indicating the states of links connected to respective source nodes. The link state packets are ordered, a range of the link state packets in the order is selected, and a summary is formed including information indicating the boundaries of the selected range, and information identifying each link state packet in the selected range.

REFERENCES:
patent: 4466060 (1984-08-01), Riddle
patent: 4534024 (1985-08-01), Maxemchuk et al.
patent: 4617657 (1986-10-01), Drynan et al.
patent: 4656658 (1987-04-01), King
patent: 4669113 (1987-05-01), Ash et al.
patent: 4670871 (1987-06-01), Vaidya
patent: 4679189 (1985-11-01), Olson et al.
patent: 4691314 (1985-10-01), Bergins et al.
patent: 4700184 (1987-10-01), Noirel et al.
patent: 4704724 (1987-11-01), Krishnan et al.
patent: 4706080 (1987-11-01), Sincoskie
patent: 4737983 (1988-04-01), Frauenthal et al.
patent: 4740954 (1988-04-01), Cotton et al.
patent: 4742511 (1988-05-01), Johnson
patent: 4788721 (1988-11-01), Krishnan et al.
patent: 4825206 (1988-05-01), Brice, Jr. et al.
patent: 4833543 (1986-12-01), Verbiest
patent: 4875208 (1989-10-01), Furuhashi et al.
Dijkstra, "A Note on Two Problems in Connexion with Graphs", Numerische Mathematik, vol. 1 (1959), pp. 269-271.
McQuillan et al., "The New Routing Algorithm for the Arpanet", IEEE Transactions on Communications, vol. COM-28 (1980), pp. 711-719.
DARPA, "Internet Protocol".
OSPF, "The OSPF Specification".
ISO "8473 Protocol for Providing the Connectionless-mode Network Service".
ISO, "IS/IS Intra-Domain Routeing Exchange Protocol".
Perlman ("Fault-Tolerant Broadcast of Routing Information", Computer Networks 7 (1983), North-Holland, Inc., pp. 395-405.
Humblet et al. ("Topology Broadcast Algorithms", Computer Networks and ISDN Systems 16 (1988/89), North-Holland, Inc., pp. 179-186.
Bertsekas et al. (Chapter 5 of Data Networks, Prentice-Hall, Englewood Cliffs, NJ, 1987).
Perlman ("Network Layer Protocols with Byzantine Robustness", M.I.T. Ph.D. Thesis).

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

Updating link state information in networks does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Updating link state information in networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Updating link state information in networks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-1834910

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