Routing in a private network with compression

Details Routing in a private network with compression Routing in a private network with compression

2005-06-21

2005-06-21

Patel, Ajit (Department: 2664)

Multiplex communications

Data flow congestion prevention or control

Flow control of data transmission through a network

C370S229000

Reexamination Certificate

active

06909694

ABSTRACT:
The invention concerns a method of routing between a source node and a destination node in a network having nodes connected by links, compression being used on at least one of said links, the method comprising at least two routing calculation steps for a given number of compressions, i.e. in a plane P(v). A routing calculation step for a given number of compressions uses information obtained during a routing calculation step for a number of compressions less than said given number. In this way a cost function can be minimized whilst assuring that in the route obtained the total number of compressions remains less than a maximum value. The route can be calculated for a given number of compressions using the Dijkstra algorithm and verifying the number of compressions when adding a node to the route. In this case, on reaching a link for which the given number of compressions is exceeded, the distance to the source node is saved for a subsequent calculation step.

REFERENCES:
patent: 5095480 (1992-03-01), Fenner
patent: 5258983 (1993-11-01), Lane et al.
patent: 5295183 (1994-03-01), Langlois et al.
patent: 5638363 (1997-06-01), Gittins et al.
patent: 5689641 (1997-11-01), Ludwig et al.
patent: 5894588 (1999-04-01), Kawashima et al.
patent: 5930348 (1999-07-01), Regnier et al.
patent: 6111870 (2000-08-01), Kurtz
patent: 6122283 (2000-09-01), Lee
patent: 6226304 (2001-05-01), Ravishankar et al.
patent: 6330231 (2001-12-01), Bi
patent: 6359902 (2002-03-01), Putzolu
patent: 6483835 (2002-11-01), Tanigawa et al.
patent: 196 14 926 (1997-10-01), None
patent: 2 283 154 (1995-04-01), None
patent: WO 98/16083 (1998-04-01), None
Sameh Rabie: “Traffic Management in Multi-Service Enterprise Networks”, ISS 1995. World Telecommunications Congress. (International Switching Symposium), Advance Switching Technologies for Universal Telecommunications at the beginning of the 21stCentury, Berlin, Apr. 23-28, 1995, vol. 1, No. SYMP. 15, Apr. 23, 1995, XP0004955590.
Fiedler, C.: “Sprachkommunikation in >>Corporate Network<<” Telcom Report, vol. 18, No. 1, Jan. 1, 1995, p. 20/21 XP000491914.
Torrieri, D.: “Algorithms for finding an Optimal Set of Short Disjoint Paths in a Communication Network” IEEE Transactions on Communications, vol. 40, No. 11, Nov. 1, 1992, pp. 1698-1702, XP000336308.
“Optimal Compression and Routing in Networks” IBM Technical Disclosure Bulletin, vol. 34, No. 3, Aug. 1, 1991, pp. 19-21, XP000210435.
Chia-Jui Wang et al.: “The Use of Artificial Neural Networks for Optimal Message Routing” IEEE Network: The Magazine of Computer Communications, vol. 9, No. 2, Mar. 1, 1995, pp. 16-24, XP000493486.

Affiliated with

Also associated with

Rating

Routing in a private network with compression does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Routing in a private network with compression, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Routing in a private network with compression will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3499938