US 6,097,718 AGrant
Snapshot Routing With Route Aging
Issue Date:2000-08-01
•14 Claims
•1 Drawing Sheets
Abstract
A method and system for maintaining and updating routing information in a packet switching network for a set of quasidynamic routes, in which intermittent routing updates are permitted, so that routes are no longer "always static" or "always dynamic", but may change over time between static and dynamic, and are treated accordingly. The invention is particularly applicable to dial-on-demand serial communication links, but is also useful in any situation where it is desired to reduce the overhead from routing updates over a communication link, or where transmission over a communication link is not reliable. A protocol manager for a dynamic routing protocol is modified to determine, for each route, (1) whether to send updated routing information for that route (at the time it would otherwise send an up-date for a particular route), and (2) whether to age that route in its routing tables (at the time it would otherwise age that route). The modified protocol manager thus prevents automatic aging of routes, while avoiding the use of manually configured static routing tables. Routing information is thus learned automatically and dynamically at appropriate times, and refreshed periodically so that it eventually reflects actual changes to the network topology.
Metadata
Assignee
- Cisco Technology, Inc.
Inventor
- Joel P. Bion
Application Information
Application Number:US 5820758
Filing Date:1996-01-02
Priority Date:1996-01-02
Art Unit:278
Classifications
IPC:
H04L 1228H04L 1256H04J 322
Field of Search:
370395379351;406;400;399;229;319;403;385;402;410;409;396;404;389;254;401;446;248;352200.72;200.68;200.73;200.79273
Patent Drawings (1 sheets)
Description
Background of the Invention
1. Field of the Invention
This invention relates to maintaining and updating routing information in a packet switching network.
2. Description of Related Art
In routing messages in a computer network or in a network of networks (an "internetwork"), protocols for routing mes- sage packets generally provide two types of routes to a destination--static routes and dynamic routes. Static routes are preselected and configured before routing in a set of routing tables; typically this is performed manually. Dynamic routes are configured dynamically in response to routing information from other nodes; these routes require periodic updates (i.e., refreshes) of connectivity information, typically involving route refresh, adjacent node refresh, or other means.
One problem which has arisen in the art is that of intermittent connections--connections which are not continuously active, and for which lack of connectivity information refresh does not necessarily indicate that the connection has failed. For example, one type of intermittent connection is a dial-up link, such as used for dial-on-demand routing. For these communication links, it is generally undesirable and sometimes impossible to have routing and connectivity updates transmitted continuously. For example, in dial-on-demand routing, it is not generally possible to communicate routing and connectivity updates when the dial-up link is inactive.
One known method of treating dial-on-demand routing has been to statically configure the remote router with routing information indicating which devices can be located through a particular port (often a serial dial-up link) on the remote router. When a packet arrives at the remote router destined for one or more such devices, then the dial-up link is activated. Because the dial-up link can access a large number of devices at a large number of sites, large static tables are required. Static tables must be updated either manually or through periodic downloading of information in response to manual requests. Such manual management of these static tables is a significant task.
Known routing protocols (such as distance vector algorithms or link state algorithms) utilize dynamic routing updates and therefore cannot generally accommodate intermittent connections. These protocols "age" routing or connectivity information--if a device advertising the route is not heard from for a preselected time interval, existing routing protocols presume that the routes through the device are no longer available using that device, and the routing tables are updated accordingly.
Accordingly, it would be advantageous to provide a method and system in which routes including intermittent connections enjoyed the best aspects of both dynamic routes and static routes. Ideally, such routes and connectivity information could be dynamically updated using known protocol techniques for dynamic routes, but would not age during times when routing or connectivity information was not available for those connections.
Summary of the Invention
The invention provides a method and system for maintaining and updating routing and connectivity information in a packet switching network for a set of quasidynamic routes, in which intermittent routing and connectivity updates are permitted, so that routes and connectivity information are no longer "always static" or "always dynamic", but may change over time between static and dynamic, and are treated accordingly. The change can be in response to input from an external source, or, more generally, from an event noticed by the routing protocol. The invention is particularly applicable to dial-on-demand serial communication links, but is also useful in any situation where it is desired to reduce the overhead from routing and connectivity updates over a communication link, or where transmission over a communication link is not reliable.
In a preferred embodiment, a protocol manager for a dynamic routing protocol is modified to determine, for each route, (1) whether to send updated routing information for that route (at the time it would otherwise send an update for a particular route), and (2) whether to age that route in its routing tables (at the time it would otherwise age that route). The modified protocol manager thus prevents automatic aging of routes, while avoiding the use of manually configured static routing tables. Routing information is thus learned automatically and dynamically at appropriate times, and refreshed periodically so that it eventually reflects actual changes to the network topology.
In a preferred embodiment, the invention is implemented on a router in two component parts: a snapshot engine and a modified routing protocol engine. For two connected routers, the snapshot engine comprises a client for one and a server for the other. The routing protocol engine does not need to know by what criteria the snapshot engine decides the answers to the two questions indicated above; it only needs to be able to get the answers from the snapshot engine. In alternative embodiments, the protocol engine may be modified to in corporate this intelligence and answer these questions itself.
In a preferred embodiment, the client snapshot engine determines a set of "active periods" and a set of "quiet periods" for receiving routing updates from the server. During the active period, the communication link is activated, routing and connectivity information is exchanged between the server and client, routing tables are updated at the server and client, and routing information can age at a "normal" rate at the server and client. In this manner, the routing information is automatically periodically refreshed through inherent operation of the protocol, and without pack et overhead. During quiet periods, routing information is maintained statically at the server and client without aging, and treated as valid until the next active period for that communication link.
In a preferred embodiment, the client snapshot engine enters active periods at predetermined time intervals, during which it sends updated routing information to the server, and the server responds by sending updated routing information to the client. The server knows the length of the active period. No clock synchronization is necessary. Aging of a route at the client is driven by the reception of packets at the client from the router that originally provided that route to the client. Aging is event-driven. The aging of a route N from router R is triggered only by receipt of new information after a quiet period from router R.
Brief Description of the Drawings
FIG. 1 shows a block diagram of a communication link in a system including an internetwork.
FIG. 2 shows a block diagram of a system having a protocol manager and a snapshot engine.
Description of the Preferred Embodiment
In the following description, a preferred embodiment of the invention is described with regard to preferred process steps and data structures. However, those skilled in the art would recognize, after perusal of this application, that embodiments of the invention may be implemented using a set of general purpose computers operating under program control, and that modification of a set of general purpose computers to implement the process steps and data structures described herein would not require undue invention.
Client/Server Model for Updated Connectivity Information
FIG. 1 shows a block diagram of a communication link in a system including an internetwork.
A network of networks (an "internetwork") 100 comprises a set of networks 101, each having one or more devices 102 coupled thereto. Between two networks 101 are coupled one or more routers 103, for communicating messages between those two networks 101.
A first device 102 coupled to a first network 101 comprises an information server 110, and provides connectivity information about the internetwork. This connectivity information comprises a set of static routes 111, each comprising an ordered pair having a value for a network 101 and a value for a next-hop device 102. Each ordered pair thus informs a router 103 to which local device 102 (i.e., which device 102 on a network 101 to which the router 103 is directly connected) to send a message, to cause that message to arrive at a remote device 102 on the specified network 101.
A second device 102 coupled to a second network 101 comprises a client 112 for the connectivity information, which it obtains from the server 110. The client 112 records the connectivity information in a connectivity table 113.
The connectivity table 113 includes a set of static routes 111(a), which are preselected and entered into the connectivity table 113 at a time before the client 112 attempts to route any messages. For example, static routes 111(a) may be entered into the connectivity table 113 when the client 112 is powered on or when it is restarted.
The connectivity table 113 also includes a set of dynamic routes 111(b), which are learned from servers 110 such as neighbor routers 103 and updated in the connectivity table 113 periodically, in response to updated connectivity information.
Typically, a routing protocol employed by one or more routers 103 includes a technique for updating the dynamic routes 111(b) in the connectivity table 113, in response to updated connectivity information. For example, in a "distance vector" protocol, the dynamic routes 111(b) are advertised by a neighbor router 103 (or other server 110) with every update, and the client 112 updates the connectivity table 113 accordingly. The dynamic routes 111(b) associated with each next-hop device 102 are "aged" to indicate how long it has been since a message from that next-hop device 102. The present invention is preferably implemented in conjunction with a distance vector protocol, but it is equally applicable to a link state protocol or another protocol, and the embodiments disclosed herein would also work with such protocols.
The connectivity table 113 also includes a set of quasidynamic routes 111(c). As used herein, quasidynamic routes are routes which are not "always static" or "always dynamic", but may change over time between static and dynamic, and are treated accordingly, preferably in response to events noted by the routing protocol.
Quasidynamic routes are like dynamic routes 111(b), but sending updates and aging routes 111 for quasidynamic routes is subject to a snapshot engine 130. The snapshot engine 130 determines for each quasidynamic route 111(c), in response to requests from a protocol engine 140 for the client 112, whether to age that route 111 in the connectivity table 113, and in response to requests from a protocol engine 140 for the server 110, whether to send periodic or updated connectivity information for that route 111.
For a quasidynamic route 111(c), the client 112 and the server 110 are coupled by a communication link 120. In a preferred embodiment, the communication link 120 comprises a telephone connection coupled using a telephone network when the client 112 dials the server 110, such as a "dial-on-demand" connection. However, in alternative embodiments, the communication link 120 could comprise a wide variety of other types of connection, including an intermittent connection, a mobile connection, or a low bandwidth connection (or a connection whose bandwidth is variable). In general, the communication link 120 may comprise any type of connection in which it is undesirable to frequently transmit connectivity information.
In a preferred embodiment, the client 112 may use the communication link 120 to couple to more than one server 110. For example, if the communication link 120 is a telephone connection, the client 112 may use the telephone connection to couple to a first server 110 in a first location, followed by a second server 110 in a second location, and so on. Similarly, more than one client 112 may use the communication link 120 to couple to a single server 110. For example, if the communication link 120 is a telephone connection, a first client 112 in a first location may use the telephone connection to couple to the server 110, after which a second client 112 in a second location may use the telephone connection to couple to the server 110, and so on.
In alternative embodiments, the client 112 may be coupled to the server 110 by a primary communication link 120 which is maintained substantially constantly, and by a secondary communication link 120 which is used to couple the client 112 and the server 110 as a backup for the primary communication link 120. In such alternative embodiments, the client 112 maintains a primary set of dynamic routes 111(b) in the connectivity table 113 which relate to the primary communication link 120, and a secondary set of dynamic routes 111(b) in the connectivity table 113 which relate to the secondary communication link 120. The secondary set of dynamic routes 111(b) are used when and if the primary communication link 120 is lost. In some alternative embodiments, the client 112 may maintain the secondary set of dynamic routes 111(b) in a separate connectivity table 113 or in backup storage for inclusion in the connectivity table 113 when and if the primary communication link 120 is lost.
When the client 112 is coupled to the server 110 using the communication link 120, the snapshot engine 130 permits the connectivity table 113 to be updated in response to updated connectivity information, by the protocol engine 140 according to the routing protocol and at the regular intervals dictated by that routing protocol.
However, when the client 112 is not coupled to the server 110 using the communication link 120, the snapshot engine 130 freezes those routes 111 in the connectivity table 113. The routes are thus held unchanged in the connectivity table 113 for much longer times, and only updated at intervals selected by the snapshot engine 130. The selected intervals may be responsive to selected events, such as telephone busy signals. In a preferred embodiment, the selected intervals are typically much longer than the regular intervals dictated by the routing protocol, but they are in fact selected to account for changes in the real world status communication link 120, such as losing a telephone connection.
Operation of Snapshot Engine and Protocol Engine
FIG. 2 shows a block diagram of a system having a snapshot engine and a protocol engine.
In a preferred embodiment, the snapshot engine 130 comprises a software element operating on a processor at the client 112 (or at the server 110) and in conjunction with operating system software on that processor. Similarly, a protocol engine 140 also comprises a software element operating on a processor at the client 112 (or at the server 110) and in conjunction with operating system software on that processor. The snapshot engine 130 operates in conjunction with a timer 131 set by a timer-set message 132 and responding with a timer-hit message 133, while the protocol engine 140 operates in conjunction with a protocol timer 141. Preferably, the snapshot engine 130 also operates in conjunction with an operator process 200, which is itself responsive to commands from an operator.
The protocol engine 140 implements the network routing protocol, which preferably comprises one or more of the protocols shown in table 2-1. Other protocols may also be accommodated.
The operation of the snapshot engine 130, both at the client 112 and at the server 110, requires no additional packets to be transmitted or received on the communication link 120. Thus, the operation of the snapshot engine 130 is fully compatible with session layer protocols, such as IPXWAN.
The snapshot engine 130 determines a set of "active periods" for receiving updated connectivity information regarding routes 111 using the communication link 120, during which quasidynamic routes 111(c) therein are aged according to the protocol technique as if they were dynamic routes 111(b), and a set of "quiet periods" during which quasidynamic routes 111(c) are held constant as if they were static routes 111(a).
In a preferred embodiment, active periods occur at preselected times, depending on the nature of the communication link 120. For example, if the communication link 120 is a dial-on-demand telephone connection, one active period might occur every 4 hours, every 12 hours, or every 24 hours, or some other preselected periodic time, depending on a settable parameter. Active periods last at least a preselected time period which exceeds three times a route update time for the protocol, so that updated connectivity information can reasonably be expected to be received at least once during each active period. For example, an active period may last for at least 3 minutes, for 10 minutes, or for some other preselected time period, depending on a second settable parameter. The duration of an active period may also be extended by events. For example, where the communication link 120 is a dial-on-demand telephone connection, the active period may be extended if the telephone connection fails to be established (causing a retry) or is unexpectedly terminated (also causing a retry).
In alternative embodiments, other and further active time triggers may be used. Such other and further active time triggers may include the reinitialization or restart of either protocol engine 140, or operator process 200 making an explicit request to start the active time.
In a preferred embodiment, when the snapshot engine 130 is first invoked for the communication link 120, it starts by placing all routes 111 using the communication link 120 into the active period. Preferably, this initial active period lasts a preselected time period, long enough that it is expected that routes 111 using the communication link 120 are learned and that connectivity information therefore are recorded in the connectivity table 113.
The snapshot engine 130 triggers the protocol engine 140 by transmitting a send-update message 210. In response to the send-update message 210, the protocol engine 140 causes the server 110 to start sending the appropriate protocol packet 211 to the client 112.
The snapshot engine 130 at the client 112 transmits the send-update message 210 at the beginning of each active period, thus in response to a timer-hit message 133 indicating that an active period should begin. The snapshot engine 130 at the server 110 does not transmit the send-update message 210.
Protocol packets 211 arrive at the protocol engine 140 for either the client 112 or the server 110 comprising updated connectivity information. (These protocol packets 211 arrive at the protocol engine 140 for the server 110 when the snapshot engine 130 for the client 112 has transmitted a send-update message 210; however, this operation is symmetrical for the client 112 and the server 110.) In response to these packets 211, the protocol engine 140 transmits a received-update message 212 to the snapshot engine 130. The received-update message 212 comprises a timestamp for the time when the packet 211 comprising updated connectivity information was received.
In response to the received-update message 212, the snapshot engine 130 transmits a start-aging message 213 to the protocol engine 140, comprising a timestamp for the time from when the protocol engine 140 should start aging routes 111. The protocol engine 140 examines each route 111 in the connectivity table 113 to determine if that route 111 is static, dynamic, or quasidynamic. Quasidynamic routes 111(c) are controlled by the snapshot engine 130. Thus, receipt of packets 211 comprising updated connectivity information causes the server 110 to also enter the active period for quasidynamic routes 111(c) using the communication link 120.
For each quasidynamic route 111(c) which the protocol engine 140 has determined, according to the unmodified protocol technique, that the route 111 should be aged, the protocol engine 140 transmits a want-to-age message 214 to the snapshot engine 130. In response to the want-to-age message 214, the snapshot engine 130 transmits an OK-to-age message 215 having a "yes" or a "no" answer. During the route's active periods, the answer will be "yes", while during the route's quiet periods, the answer will be "no". The protocol engine 140 receives the OK-to-age message 215 and either ages the route 111 or does not, accordingly. Thus, quasidynamic routes 111(c) are aged during active periods and remain static (not aged) during quiet periods.
According to the protocol, the protocol engine 140 at the server 110 will at some time desire to send a protocol packet 211 having updated connectivity information to the client 112. (These times include when the server 110 receives updated connectivity information from the client 112.) Before doing so, for each quasidynamic route 111(c), the protocol engine 140 transmits a want-to-send message 216 to the snapshot engine 130. In response to the want-to-send message 216, the snapshot engine 130 transmits an OK-to-update message 217 having a "yes" or "no" answer. During the route's active periods, the answer will be "yes". while during the route's quiet periods, the answer will be "no". The protocol engine 140 receives the OK-to-update message 217 and either sends the protocol packet 211 or does not, accordingly. Thus, quasidynamic routes 111(c) are updated during active periods and remain static (not updated) during quiet periods.
In response to a request by an operator, the operator process 200 transmits a operator-command message 220 to the snap-shot engine 130. In response to the operator-command message 220, the snapshot engine 130 transmits a command-response message 221 to the operator process 200. The command-response message 221 comprises information about the snapshot process 130 or about quasidynamic routes 111 in the connectivity table 113, if requested by the operator-command message 220, and confirmation of an activity taken for the snapshot process 130 or for quasidynamic routes 111(c) in the connectivity table 113, if requested by the operator-command message 220.
The operator-command message 220 may comprise a request for the status of the snapshot process 130 and about quasidynamic routes 111(c) in the connectivity table 113. In this event, the command-response message 221 comprises information about the snapshot process 130 or about quasidynamic routes 111(c) in the connectivity table 113.
The operator-command message 220 may comprise a command to set the time period for active periods and for quiet periods, to configure the snapshot engine 130 as a client 112, to set options for the snapshot engine 130, and to cause the snapshot engine 130 to enter the active time for one or more servers. In this event, the command-response message 221 comprises an acknowledgment that the command has been performed. In a preferred embodiment, options for the snapshot engine 130 comprise those shown in table 2-2.
Support for dial-on-demand telephone connections comprises associating the communication link 120 with a set of remote telephone numbers to call to establish telephone connections. Dialer rotary groups are preferred because they will not go down when the dialer drops. PPP and CHAP authentication are preferred for dial-on-demand telephone connections.
Additional operator-command messages 220 are shown in table 2-3.
Those skilled in the art will recognize, after perusal of this application, that other and further messages from the operator process 200, and responses thereto, are within the scope and spirit of the invention. Such other and further messages would be clear after perusal of this application, and would not require invention or undue experimentation.
The snapshot engine 130 maintains a data structure, called a "snapshot activity block". For clients 112, there is one snapshot activity block per server 110 to be coupled to the communication link 120. For servers 110, there is one snapshot activity block per router 103 supplying connectivity information, per protocol used at that router 103.
Each snapshot activity block is assigned to one of the states shown in table 2-4.
The "client.sub.-- post.sub.-- active.sub.-- next.sub.-- quiet" and "client.sub.-- post.sub.-- active.sub.-- next.sub.-- active" states are intended as short transition states between the "active" state and the "client.sub.-- quiet" state.
A timer for the time to remain in the indicated state is periodically decremented, after which the state is changed as shown in table 2-5.
At the client 112, when a snapshot activity block is in the "active" state, once per minute the snapshot engine 130 requests that the communication link 120 be made active. For a dial-on-demand connection, if the telephone connection is already active, this merely resets the appropriate timers; if the telephone connection is not active, this causes a telephone dialer to attempt to make the connection. Once per second the snapshot engine 130 requests the telephone dialer to reset its dialer interface idle timers, to ensure the telephone connection remains coupled for the entire active period.
At the server 110, the snapshot engine 130 does not attempt to maintain the communication link 120 connected, but allows the client 112 to decide. When any telephone connection becomes connected, the server 110 maintains that telephone connection in the active state for the entire active period, plus an extra 2 minutes, so that any client 112 attempting to connect to the server 110 using that communication link 120 may maintain the telephone connection for a full active period.
Alternative Embodiments
Although preferred embodiments are disclosed herein, many variations are possible which remain within the concept, scope, and spirit of the invention, and these variations would become clear to those skilled in the art after perusal of this application.
Claims
I claim:
1. A method for routing messages in a network, comprising the steps of following a routing protocol, said routing protocol comprising transmitting updated connectivity information between routers and aging a route in a routing table; making a first determination whether to transmit said updated connectivity information between routers, and transmitting said updated connectivity information responsive to said first determination wherein said first determination to transmit is synchronized between routers; making a second determination independent of said first determination whether to age said route, and aging said route responsive to said second determination.
2. A method as in claim 1, wherein said step of making a first determination is responsive to a first event detected by said routing protocol.
3. A method as in claim 1, wherein said step of making a second determination is responsive to a second event detected by said routing protocol.
4. A method as in claim 1, wherein said step of making a second determination is responsive to an active period or a quiet period for said route.
5. A method as in claim 4, wherein said active period is a preselected duration and said quiet period is a preselected minimum duration.
6. A method as in claim 1, wherein said route comprises a telephone connection and said step of making a first determination is responsive to a condition of said telephone connection.
7. A method as in claim 1, wherein said route comprises a telephone connection and said step of making a second determination is responsive to a condition of said telephone connection.
8. A system comprising a protocol engine disposed for following a routing protocol comprising transmitting updated connectivity information between routers and aging a route in a routing table; means for making a first determination whether to transmit said updated connectivity information between routers and for making a second determination whether to age said route; wherein said protocol engine is disposed for requesting said means to make said first determination and for transmitting updated connectivity information responsive to said first determination wherein said first determination to transmit is synchronized between routers, and to make said second determination independent of said first determination and for aging said route responsive to said second determination.
9. A system as in claim 8, wherein said means is responsive to an event detected by said routing protocol.
10. A system as in claim 8, wherein said means is responsive to an active period or a quiet period for said router.
11. A system as in claim 10, wherein said active period is a preselected duration and said quiet period is a preselected minimum duration.
12. A system as in claim 8, wherein said route comprises a telephone connection and said means is responsive to a condition of said telephone connection.
13. In a system having a communication link and first and second devices coupled to said communication link, a method comprising maintaining a routing table at said first device, said routing table comprising at least one quasidynamic route, said quasidynamic route comprising information regarding at least one destination reachable from said second device; following a dynamic routing protocol, said dynamic routing protocol comprising transmitting updated connectivity information between routers and aging a route in said routing table; making a first determination whether to transmit said updated connectivity information making a second determination independent of said first determination whether to age said route; modifying said dynamic routing protocol by transmitting updated connectivity information responsive to said first determination; and modifying said dynamic routing protocol by aging said route responsive to said second determination.
14. A system as in claim 8 wherein said routing table further comprises: at least one quasidynamic route, said quasidynamic route comprising information regarding at least one destination reachable from said second device; wherein said means for making a first determination is a snapshot engine coupled to said protocol engine, said snapshot engine disposed for making a first determination whether to transmit said updated connectivity information and for making a second determination whether to age said route; wherein said protocol engine is disposed for requesting said snapshot engine to make said first determination and for transmitting updated connectivity information responsive to said first determination, and to make said second determination and for aging said route responsive to said second determination.
Patent Citations (174)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| USRe33900 | 1992-04-01 | Howson | |
| US4131767 | 1978-12-01 | Weinstein | |
| US4161719 | 1979-07-01 | Parikh et al. | |
| US4316284 | 1982-02-01 | Howson | |
| US4397020 | 1983-08-01 | Howson | |
| US4419728 | 1983-12-01 | Larson | |
| US4424565 | 1984-01-01 | Larson | |
| US4437087 | 1984-03-01 | Petr | |
| US4438511 | 1984-03-01 | Baran | |
| US4439763 | 1984-03-01 | Limb | |
| US4445213 | 1984-04-01 | Baugh et al. | |
| US4446555 | 1984-05-01 | Devault et al. | |
| US4456957 | 1984-06-01 | Schieltz | |
| US4464658 | 1984-08-01 | Thelen | |
| US4499576 | 1985-02-01 | Fraser | |
| US4506358 | 1985-03-01 | Montgomery | |
| US4507760 | 1985-03-01 | Fraser | |
| US4532626 | 1985-07-01 | Flores et al. | |
| US4644532 | 1987-02-01 | George et al. | |
| US4646287 | 1987-02-01 | Larson et al. | |
| US4677423 | 1987-06-01 | Benvenuto et al. | |
| US4679227 | 1987-07-01 | Hughes-Hartogs | |
| US4723267 | 1988-02-01 | Jones et al. | |
| US4731816 | 1988-03-01 | Hughes-Hartogs | |
| US4750136 | 1988-06-01 | Arpin et al. | |
| US4757495 | 1988-07-01 | Decker et al. | |
| US4763191 | 1988-08-01 | Gordon et al. | |
| US4769810 | 1988-09-01 | Eckberg, Jr. et al. | |
| US4769811 | 1988-09-01 | Eckberg, Jr. et al. | |
| US4771425 | 1988-09-01 | Baran et al. | |
| US4819228 | 1989-04-01 | Baran et al. | |
| US4827411 | 1989-05-01 | Arrowood et al. | |
| US4833706 | 1989-05-01 | Hughes-Hartogs | |
| US4835737 | 1989-05-01 | Herrig et al. | |
| US4879551 | 1989-11-01 | Georgiou et al. | |
| US4893306 | 1990-01-01 | Chao et al. | |
| US4903261 | 1990-02-01 | Baran et al. | |
| US4922486 | 1990-05-01 | Lidinsky et al. | |
| US4933937 | 1990-06-01 | Konishi | |
| US4960310 | 1990-10-01 | Cushing | |
| US4962497 | 1990-10-01 | Ferenc et al. | |
| US4962532 | 1990-10-01 | Kasiraj et al. | |
| US4965772 | 1990-10-01 | Daniel et al. | |
| US4970678 | 1990-11-01 | Sladowski et al. | |
| US4980897 | 1990-12-01 | Decker et al. | |
| US4991169 | 1991-02-01 | Davis et al. | |
| US5003595 | 1991-03-01 | Collins et al. | |
| US5014265 | 1991-05-01 | Hahne et al. | |
| US5020058 | 1991-05-01 | Holden et al. | |
| US5033076 | 1991-07-01 | Jones et al. | |
| US5054034 | 1991-10-01 | Hughes-Hartogs | |
| US5059925 | 1991-10-01 | Weisbloom | |
| US5072449 | 1991-12-01 | Enns et al. | |
| US5088032 | 1992-02-01 | Bosack | |
| US5115431 | 1992-05-01 | Williams et al. | |
| US5128945 | 1992-07-01 | Enns et al. | |
| US5136580 | 1992-08-01 | Videlock et al. | |
| US5166930 | 1992-11-01 | Braff et al. | |
| US5199049 | 1993-03-01 | Wilson | |
| US5206886 | 1993-04-01 | Bingham | |
| US5208811 | 1993-05-01 | Kashio et al. | |
| US5212686 | 1993-05-01 | Joy et al. | |
| US5224099 | 1993-06-01 | Corbalis et al. | |
| US5226120 | 1993-07-01 | Brown et al. | |
| US5228062 | 1993-07-01 | Bingham | |
| US5229994 | 1993-07-01 | Balzano et al. | |
| US5237564 | 1993-08-01 | Lespagnol et al. | |
| US5241682 | 1993-08-01 | Bryant et al. | |
| US5243342 | 1993-09-01 | Kattemalalavadi et al. | |
| US5243596 | 1993-09-01 | Port et al. | |
| US5247516 | 1993-09-01 | Berstein et al. | |
| US5249178 | 1993-09-01 | Kurano et al. | |
| US5253251 | 1993-10-01 | Aramaki | |
| US5255291 | 1993-10-01 | Holden et al. | |
| US5260933 | 1993-11-01 | Rouse | |
| US5260978 | 1993-11-01 | Fleisher et al. | |
| US5268592 | 1993-12-01 | Bellamy et al. | |
| US5268900 | 1993-12-01 | Hluchj et al. | |
| US5271004 | 1993-12-01 | Proctor et al. | |
| US5274631 | 1993-12-01 | Bhardwaj | |
| US5274635 | 1993-12-01 | Rahman et al. | |
| US5274643 | 1993-12-01 | Fisk | |
| US5280470 | 1994-01-01 | Buhrke et al. | |
| US5280480 | 1994-01-01 | Pitt et al. | |
| US5280500 | 1994-01-01 | Mazzola et al. | |
| US5283783 | 1994-02-01 | Nguyen et al. | |
| US5287103 | 1994-02-01 | Kasprzyke et al. | |
| US5291482 | 1994-03-01 | McHarg et al. | |
| US5305311 | 1994-04-01 | Lyles | |
| US5307343 | 1994-04-01 | Bostica et al. | |
| US5311509 | 1994-05-01 | Heddes et al. | |
| US5313454 | 1994-05-01 | Bustini et al. | |
| US5313582 | 1994-05-01 | Hendel et al. | |
| US5317562 | 1994-05-01 | Nardin et al. | |
| US5319644 | 1994-06-01 | Liang | |
| US5327421 | 1994-07-01 | Hiller et al. | |
| US5331637 | 1994-07-01 | Francis et al. | |
| US5345445 | 1994-09-01 | Hiller et al. | |
| US5345446 | 1994-09-01 | Hiller et al. | |
| US5359592 | 1994-10-01 | Corbalis et al. | |
| US5361250 | 1994-11-01 | Nguyen et al. | |
| US5361256 | 1994-11-01 | Doeringer et al. | |
| US5361259 | 1994-11-01 | Hunt et al. | |
| US5365524 | 1994-11-01 | Hiller et al. | |
| US5367517 | 1994-11-01 | Cidon et al. | |
| US5371852 | 1994-12-01 | Attanasio et al. | |
| US5386567 | 1995-01-01 | Lien et al. | |
| US5390170 | 1995-02-01 | Sawant et al. | |
| US5390175 | 1995-02-01 | Hiller et al. | |
| US5394394 | 1995-02-01 | Crowther et al. | |
| US5394402 | 1995-02-01 | Ross | |
| US5400325 | 1995-03-01 | Chatwani et al. | |
| US5408469 | 1995-04-01 | Opher et al. | |
| US5416842 | 1995-05-01 | Aziz | |
| US5422880 | 1995-06-01 | Heitkamp et al. | |
| US5422882 | 1995-06-01 | Hiller et al. | |
| US5423002 | 1995-06-01 | Hart | |
| US5426636 | 1995-06-01 | Hiller et al. | |
| US5428607 | 1995-06-01 | Hiller et al. | |
| US5430715 | 1995-07-01 | Corbalis et al. | |
| US5434463 | 1995-07-01 | Onishi et al. | |
| US5442457 | 1995-08-01 | Hamid | |
| US5442630 | 1995-08-01 | Gagliardi et al. | |
| US5452297 | 1995-09-01 | Hiller et al. | |
| US5473599 | 1995-12-01 | Li et al. | |
| US5473607 | 1995-12-01 | Hausman et al. | |
| US5477541 | 1995-12-01 | White et al. | |
| US5485455 | 1996-01-01 | Dobbins et al. | |
| US5490140 | 1996-02-01 | Abensour et al. | |
| US5491687 | 1996-02-01 | Christensen et al. | |
| US5491804 | 1996-02-01 | Heath et al. | |
| US5497368 | 1996-03-01 | Reijnierse et al. | |
| US5504747 | 1996-04-01 | Sweazey | |
| US5509006 | 1996-04-01 | Wilford et al. | |
| US5517494 | 1996-05-01 | Green | |
| US5517620 | 1996-05-01 | Hashimoto et al. | |
| US5519704 | 1996-05-01 | Farinacci et al. | |
| US5526489 | 1996-06-01 | Nilakanatan et al. | |
| US5530963 | 1996-06-01 | Moore et al. | |
| US5535195 | 1996-07-01 | Lee | |
| US5539734 | 1996-07-01 | Burwell et al. | |
| US5546379 | 1996-08-01 | Thaweethai et al. | |
| US5555244 | 1996-09-01 | Gupta | |
| US5561669 | 1996-10-01 | Lenney et al. | |
| US5583862 | 1996-12-01 | Callon | |
| US5592470 | 1997-01-01 | Rudrapatna et al. | |
| US5598581 | 1997-01-01 | Daines et al. | |
| US5600798 | 1997-02-01 | Cherukuri et al. | |
| US5604868 | 1997-02-01 | Komine et al. | |
| US5608726 | 1997-03-01 | Virgile | |
| US5617417 | 1997-04-01 | Sathe et al. | |
| US5617421 | 1997-04-01 | Chin et al. | |
| US5631908 | 1997-05-01 | Saxe | |
| US5632021 | 1997-05-01 | Jennings et al. | |
| US5634010 | 1997-05-01 | Ciscon et al. | |
| US5644713 | 1997-07-01 | Makishima | |
| US5644718 | 1997-07-01 | Belove et al. | |
| US5666353 | 1997-09-01 | Klausmeier et al. | |
| US5673265 | 1997-09-01 | Gupta et al. | |
| US5678006 | 1997-10-01 | Valizadeh et al. | |
| US5680116 | 1997-10-01 | Hashimoto et al. | |
| US5687324 | 1997-11-01 | Green et al. | |
| US5724351 | 1998-03-01 | Chao et al. | |
| US5754547 | 1998-05-01 | Nakazawa | |
| US5835710 | 1998-11-01 | Nagami et al. | |
| US5854903 | 1998-12-01 | Morrison et al. | |
| US5898686 | 1999-04-01 | Virgile | |
| EPX384758 | 1990-02-01 | ||
| EPX431751A1 | 1990-11-01 | ||
| EPX/567217A2 | 1993-10-01 | ||
| WOXWO93/07692 | 1993-04-01 | ||
| WOXWO93/07569 | 1993-04-01 | ||
| WOXWO94/01828 | 1994-01-01 | ||
| WOXWO95/20850 | 1995-08-01 |
Non-Patent Literature (11)
- Chowdhury, et al., "Alternative Banddwidth Allocation Algorithms for Packet Video in ATM Networks", 1992, IEEE Infocom 92, pp. 1061-1068.
- Zhang, et al., "Rate-Controlled Static-Priority Queueing", 1993, IEEE, pp. 227-236.
- Doeringer, et al., "Routing on Longest-Matching Prefixes", IEEE ACM Transactions on Networking, Feb. 1, 1996, vol. 4, No.1, pp. 86-97.
- IBM, "Method and Apparatus for the Statistical Multiplexing of Vocie, Data, and Image Signals", Nov., 1992, IBM Technical Data Bulletin n6 11-92, pp. 409-411.
- Esaki, et al., "Datagram Delivery in an ATM-Internet, " IEICE Transactions on Communiations vol. E77-B, No. 3, (1994) Mar., Tokyo, Japan.
- Allen, M., "Novell IPX Over Various WAN Media (IPXWAN)", Network Working Group RFC 1551 Dec. 1993, pp. 1-22.
- Becker, D., 3c589.c: A 3c589 EtherLink3 ethernet drive for linux, becker@CESDIS .gsfc.nasa.gov, May 3, 1994, pp. 1-13.
- Pei, et al., "Putting Routing Tables in Silicon", IEEE Network magazine, Jan. 1992, pp. 42-50.
- Perkins, D., "Requirements for an Internet Standard Point-to-Point Protocol", Network Working Group, RFC 1547, Dec. 1993, pp. 1-19.
- Simpson, W., "the Point-to-Point Protocol (PPP)", Nework Working Group, RFC 1548, Dec. 1993, pp. 1-53.
- Tusuchiya, P.F., "A Search Algorithm for Table Entries with NonContinguous Wildcarding", Abstract, Bellcore.