摘要:
A method is disclosed for determining whether to use a preempt/resume protocol or an alternate protocol in transmitting data packets from a local system to a remote system. Each system informs the other whether it supports preempt/resume and provides the sizes of the largest low priority data packets it can send and receive. The local system always elects the alternate protocol unless both support preempt/resume. The local system then selects the lesser of (a) the largest low-priority data packet it can send and (b) the largest low-priority data packet the remote system can receive. Use of prompt/resume is initiated by the local system only where a packet of the selected size would be delayed in reaching the remote system by more than a predetermined interval.
摘要:
A packet communications network in which multicast transmissions are made reliable by transmitting acknowledgements to all neighbors of every receiving node, including the source node. This allows the relinquishment of message holding buffers as soon as all near neighbors acknowledge receipt of the message after only tile longest round trip time to the nearest neighbors, rather than the round trip to the furthest destination. Moreover, highly reliable ancillary point-to-point transmission facilities can be used to retransmit multicast messages indicated as being lost by failure of acknowledgment. Finally, network partitions occurring during the multicast procedure do not necessarily lose the multicast message to the remote partitions since any node receiving the message can insure delivery to all other nodes in that partition.
摘要:
Access control for a packet communications network includes a dynamic bandwidth updating mechanism which continuously monitors the mean bit rate of the signal source and the loss probability of the connection. These values are filtered to remove noise and then used to test whether the values fall within a pre-defined acceptable adaptation region in the mean bit rate, loss probability plane. Values falling outside of this region trigger bandwidth updating procedures which, in turn, result in acquiring a new connection bandwidth, and determining new filter parameters and new parameters for a leaky bucket access mechanism.
摘要:
Systems and methods consistent with this invention allow for each node within one or more rings to obtain connection and topology information from other nodes within these rings. In such a system, each node is able to maintain connection table and topology tables for each node and each ring within a ring network. In particular, such information can be kept current because this scheme allows for dynamic updating of connection and topology information in real time. With such current information, a node is able to utilize this information to execute such operations as squelching connections on a protect line and timeslot interchange. In addition, by supporting timeslot interchange, the ring can be managed as more than a single logical entity as well as can have better bandwidth management utilization.
摘要:
A method and system for aggregating a plurality of parallel communications links transmitting data between adjacent nodes in a network is provided. The method simplifies network topology by replacing multiple parallel communications links between nodes in the network with a single aggregated link. The method advertises the available bandwidth of each aggregated link to the network, the available bandwidth being the maximum bandwidth available for any one of the parallel links in the aggregate. The method permits each aggregated link to select which of the parallel links in the aggregate is to be used to transfer data from one node to the other. Aggregating links can be automatic and based on one or more predetermined criteria, such as the service class supported by the parallel links.
摘要:
Systems and methods consistent with this invention allow for each node within one or more rings to obtain connection and topology information from other nodes within these rings. In such a system, each node is able to maintain connection table and topology tables for each node and each ring within a ring network. In particular, such information can be kept current because this scheme allows for dynamic updating of connection and topology information in real time. With such current information, a node is able to utilize this information to execute such operations as squelching connections on a protect line and timeslot interchange. In addition, by supporting timeslot interchange, the ring can be managed as more than a single logical entity as well as can have better bandwidth management utilization.
摘要:
A packet communications system utilizes a route determining mechanism by identifying principal paths between the source and the destination in the system. Principal paths are minimum hop count paths with a transmission delay less than a specified threshold. Principal path links are accepted as legs of the optimum path, if feasible, i.e., if the resulting load on the link is less than a specified principal threshold. Secondary links are accepted only if the resulting load on the link is less than a specified secondary threshold, where the secondary threshold is less than the principal threshold. All paths must also have a transmission delay less than a specified threshold. Each request for a route includes the source node, the destination node, the load required, the maximum transmission delay and, if desired, the quality of service parameters which all of the legs of the route must satisfy. A modified Bellman-Ford breadth-first search algorithm is used to identify the principal links and, using these principal link identifications, determining the optimum path.
摘要:
A method, system and egress switching node for maintaining a network connection in an optical network reduces the number of spans needed for reestablishing a network connection. The invention learns which channels are used by the network connection and propagates such channel assignment data to the switching nodes for storage therein. When a span failure occurs, a notification is sent to the switching nodes identifying which span has failed. The switch nodes use the notification and channel assignment data to perform protection switching such that the rerouted network connection selects the channel that was used by the network connection on the failed span. Likewise, the egress switching node uses the selected channel to drop the network connection from the protecting fibers. This enables a network connection to travel a shorter distance after a protection switch.
摘要:
A system and method for automatically generating a topology of a network having synchronous optical network (SONET) switches. Switches in the network pass information about itself to other switches in the network so that every switch can maintain a topology of the network. Using this knowledge of the network topology, each switch can generate a communication route within the network and automatically allot bandwidth for the route. Each switch may generate a new route in response to a line failure.
摘要:
A system and method for automatically generating a protection route as an alternative to a working route through a network of switches prior to network failure. A switch selects the proposed protection route so that the protection route is disjoint from the working route. Next, a switch or switches determines whether bandwidth is available for the proposed protection route. If so, the protection route is set-up for activation when needed.