U.S. patents available from 1976 to present.
U.S. patent applications available from 2005 to present.

Method for rerouting a data stream

Patent 5590118 Issued on December 31, 1996. Estimated Expiration Date: Icon_subject August 23, 2015. Estimated Expiration Date is calculated based on simple USPTO term provisions. It does not account for terminal disclaimers, term adjustments, failure to pay maintenance fees, or other factors which might affect the term of a patent.

Patent References

Automatic fault recovery in a packet network
Patent #: 4999829
Issued on: 03/12/1991
Inventor: Fite, Jr., et al.

Telecommunication network trouble recovery system
Patent #: 5065399
Issued on: 11/12/1991
Inventor: Hasegawa, et al.

Self-healing network with distributed failure restoration capabilities
Patent #: 5235599
Issued on: 08/10/1993
Inventor: Nishimura, et al.

Restoration in communications networks
Patent #: 5435003
Issued on: 07/18/1995
Inventor: Chng, et al.

Searching system for determining alternative routes during failure in a network of links and nodes Patent #: 5513345
Issued on: 04/30/1996
Inventor: Sato, et al.

Inventor

Assignee

Application

No. 518268 filed on 08/23/1995

US Classes:

370/218, Packet switching system or element714/4Of network

Examiners

Primary: Olms, Douglas W.
Assistant: Phillips, Charles E.

Attorney, Agent or Firm

Foreign Patent References

  • 0436201 EP. 07/13/1991
  • 0538853 EP. 04/13/1993

International Classes

H04L 012/24
G06F 011/20

Foreign Application Priority Data

1994-08-23 EP

Abstract

A method is described for rerouting a data stream previously routed via a route through a switching network which has now failed. The method includes the steps of detecting the failure on a link (L19) between first (SN1) and second (SN9) switching nodes in one of these switching nodes (SN1); transmitting from this one switching node (SN1) a request message (REQ) with first (IDA) and second (IDB) address fields containing addresses of the first (1) and second (9) switching nodes, respectively; in each switching node having received the request message (REQ) retransmitting it, until an alternative route for the data stream is found between two end switching nodes of said alternative route; and by one of these end switching nodes (SN1) chosen according to a predetermined rule after the alternative route has been found, allocating the data stream to this alternative route and transmitting it thereon.

Other References

  • Conference Record, IEEE Global Telecommunicaitons Conference, 2-5 Dec. 1990, vol. 1 pp. 459-463, San Diego, CA XP218771, H. Komine et al "A Distributed Restoration Algorithm for Multiple-Link and Node Failures of Transport Networks"
  • Proceedings, IEEE Global Telecommunications Conference, 29 Nov. -2 Dec. 1993, vol. 3, pp. 1596-1600 Houston, J. Bicknell et al, "Performance Analysis of Fast Distributed Network Restoration Algorithms"
  • Symposium Record, IEEE 1992 Network Operations and Management Symposium, 6-9 Apr. 1992, Vo. 2 pp. 231-241, Memphis, XP 344698, H. Fujii et al "Transfer Mechanisms and Operation of Self-Healing Algorithms in ATM Networks"
  • "A fast distributed network restoration algorithm" by C. E. Chow, e.a., published in the Proceedings of the 12th International Phoenix Conference on Computers and Communications, Mar. 23-25, 199
PatentsPlus Images
Enhanced PDF formats
loading...
PatentsPlus: add to cart
PatentsPlus: add to cartSearch-enhanced full patent PDF image
$9.95more info
PatentsPlus: add to cart
PatentsPlus: add to cartIntelligent turbocharged patent PDFs with marked up images
$18.95more info
 
Sign InRegister
Username  
Password   
forgot password?