Data communications network
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Aug 25, 1992
Grant Date -
N/A
app pub date -
May 10, 1990
filing date -
May 18, 1989
priority date (Note) -
Expired
status (Latency Note)
Importance
Abstract
A network is arranged to generate circuits between source node (N.sub.S) and destination nodes (N.sub.D) by means of datagrams which are guided at each node over a path (D) which minimizes delay in establishing the circuit. Certain sub-destination nodes (N.sub.B and N.sub.C) are designated as intermediate circuit nodes by the datagram and accordingly a circuit (C) is established. Each circuit node is determined by the preceding circuit node in such a manner as to minimize the hop count to the destination node (N.sub.D). To this end, each node incorporates in its memory (M) a first list (LIST 1) showing the link with the best hop count to each possible destination node and also incorporates a list (LIST 2) of its links with the best transmission delay to the destination node. These lists are updated dynamically by means of routing information packets which are exchanged between neighboring nodes. However, best hop count and best delay information is not transmitted over those links (L) which are themselves the subject of that information. In this manner 'ping-pong' type looping is avoided.
First Claim
Family
International Classification(s)
Cited Art Landscape
Patent Citation Ranking
Advertisement
Advertisement
Advertisement
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully