System for communicating labeled routing trees to establish preferred paths ...

SYSTEM FOR COMMUNICATING LABELED ROUTING TREES TO ESTABLISH PREFERRED PATHS AND SOURCE ROUTES WITH LOCAL IDENTIFIERS IN WIRELESS COMPUTER NETWORKS

Inventors: J. Joaquin Garcia-Luna-Aceves, San Mateo, CA (US); Marcelo Spohn, Santa Cruz, CA (US); David A. Beyer,

Los Altos, CA (US)

Assignee: Nokia Corporation, Espoo (FI)

Notice: This patent issued on a continued prosecution application filed under 37 CFR 1.53(d), and is subject to the tWenty year patent term provisions of 35 U.S.C.

154(a)(2).

Subject to any disclaimer, the term of this patent is extended or adjusted under 35 U.S.C. 154(b) by 0 days.

Appl. No.: 09/418,700
Filed: Oct. 15, 1999

Prior Publication Data US 2003/0165117 A1 Sep. 4, 2003

Int. Cl.7 ....................... .. G01R 31/08; H04L 12/28; H04Q 7/24; G06F 15/173

U.S. Cl. ..................... .. 370/238; 370/338; 370/351; 370/256; 709/241; 709/242

Field of Search ............................... .. 370/351, 352, 370/238, 468, 400, 255, 407, 408, 235,

230, 231, 389, 392, 395.21, 395.31, 395.42,

395, 252, 256; 709/232, 238, 241, 242

References Cited U.S. PATENT DOCUMENTS

4,466,060 A 8/1984 Riddle 4,987,536 A 1/1991 Humblet

(List continued on next page.)

FOREIGN PATENT DOCUMENTS

EP 0465201 A2 1/1992 EP 0539737 A1 5/1993 EP 0841763 A1 5/1998 GB 2313254 A 11/1997 WO 96/19887 A 6/1996 WO 99/46899 A2 9/1999 WO 00/39967 A2 7/2000

OTHER PUBLICATIONS

G. MarkoWsky and F.H. Moss, “An Evaluation of Local Path ID SWapping in Computer NetWorks,” IEEE Trans. Commun., vol. COM—29, pp. 329-336 (Mar. 1981).

(List continued on next page.)

Primary Examiner—Hanh Nguyen (74) Attorney, Agent, 0r Firm—Squire, Sanders & Dempsey L.L.P.

(57) ABSTRACT

One or more labeled routing trees (LRTS) are produced at a router of a computer netWork according to a shortest path determination made over a partial topology graph of the netWork, Which graph is produced according to knoWledge of adjacent links of the router and one or more LRTs of neighboring routers. The LRTs of the router may be updated in response to receipt of routing state update messages, and such messages may include local link identifiers assigned by a head of a link to Which the identifiers pertain, and node parameters of a tail of the link to Which the local link identifiers pertain. The routing state update messages may be transmitted Within the netWork: in response to a neW destination node being detected by an existing node Within the netWork, (ii) in response to a destination becoming unreachable by a collection of the existing nodes, (iii) in response to the change in the cost of a path to at least one destination exceeding a threshold and/or (iv) in situations Where a routing loop may be encountered among tWo or more of the nodes of the netWork (e.g., at times When a path implied in the LRT of the router leads to a loop).

9 Claims, 4 Drawing Sheets

U.S. PATENT DOCUMENTS

5,115,433 A 5/1992 Baran et al.

5,231,634 A 7/1993 Giles et al.

5,233,604 A * 8/1993 Ahmadi et al. ........... .. 370/238 5,487,064 A 1/1996 Galand et al.

5,509,123 A 4/1996 Dobbins et al.

5,515,508 A 5/1996 Pettus et al.

5,548,578 A 8/1996 Matsune et al.

5,557,748 A 9/1996 Norris

5,572,528 A 11/1996 Shuen

5,596,719 A * 1/1997 Ramakrishnan et al. 370/238 5,600,644 A 2/1997 Chang et al.

5,608,721 A * 3/1997 Natarajan et al. ......... .. 370/238 5,633,866 A * 5/1997 Callon ................. .. 370/397 5,638,371 A 6/1997 Raychaudhuri et al.

5,652,751 A 7/1997 Sharony

5,682,382 A 10/1997 Shepard

5,706,291 A 1/1998 Kainulainen et al.

5,721,725 A 2/1998 Want et al.

5,721,819 A 2/1998 Galles et al.

5,737,318 A 4/1998 Melnik

5,805,593 A 9/1998 Busche

5,845,086 A 12/1998 Doebrich et al.

5,854,899 A 12/1998 Callon et al.

5,881,246 A 3/1999 Crawley et al.

5,896,379 A 4/1999 Haber

5,918,016 A 6/1999 Brewer et al.

5,926,463 A 7/1999 Ahearn et al.

5,933,425 A * 8/1999 Iwata .................. .. 370/351 5,964,841 A 10/1999 Rekhter

5,999,536 A 12/1999 Kawafuji et al.

6,006,272 A 12/1999 Aravamudan et al.

6,026,303 A 2/2000 Minamisawa

6,108,314 A 8/2000 Jones et al.

6,246,669 B1 * 6/2001 Chevalier et al. ......... .. 370/238 6,301,244 B1 * 10/2001 Huang et al. ............. .. 370/351

OTHER PUBLICATIONS

J. Moy, “OSPF Version 2,” RFC 1583, NetWork Working Group (Mar. 1994).

P. NeWman, T. Lyon, and G. Minshall, “FloW Labeled IP: A Connectionless Approach to ATM,” Proc. IEEE Infocom ’96, San Francisco, CA, pp. 1251-1260 (Mar. 1996).

Yakov Rekhter, et al., “Tag SWitching Architecture OvervieW,” Proc. IEEE, vol. 85, No. 12 (Dec. 1997).

M. SchWartz and T. Stern, “Routing Techniques Used in Computer Communications NetWorks,” IEEE Transactions on Communications, vol. COM—28, No. 4, pp. 539-552 (Apr. 1980).

A. Segall and J. J affe, “Route Setup With Local Identifiers,” IEEE Trans. Commun., vol. COM-34, pp. 45-53 (Jan. 1986).

J.J. Garcia-Luna-Aceves, et al., “Wireless Internet GateWays (WINGS),” Annual Military Communications Conference, NeW York, NeW York, XP-000792611, IEEE pp. 1271-1276 (Nov. 3, 1997).

B. Raj agopalan, et al., “A Responsive Distributed Algorithm for Shortest-Path Routing Within Autonomous Systems,” InternetWorking: Research and Experience, XP-000669932 John Wiley & Sons, vol. 2, No. 1 pp. 51-69 (Mar. 1991).

J .J . Garcia-Luna-Aceves and Marcelo Spohn, “Emcient Routing in Packet-Radio NetWorks Using Link-State Information,” 1999 IEEE Wireless Communications and NetWorking Conference, XP-002168435, vol. 3, pp. 1308-1312 (Sep. 24, 1999).

V.O.K. Li and R. Chang, “Proposed Routing Algorithms for the US Army Mobile Subscriber Equipment (MSE) netWork,” Proceedings IEEE MILCOM ’86, Monterey, CA (Oct. 1986).

C. Perkins, “Ad Hoc On Demand Distance Vector (AODV) Routing,” draft-ietf-manet.aodv-00.txt (Nov. 1997).

C.K. Toh, “Wireless ATM & Ad Hoc NetWorks: Protocols and Architectures,” Chapter 9, pp. 193-227 and 293-307, KluWer Academic Publishers (1997).

R.M. Metcalfe and D.R. Boggs, “Ethernet: Distributed packet sWitching for local computer netWorks,” Communications of the ACM, vol. 19, No. 7, pp. 395-403 (1976). F.A. Tobagi and L. Kleinrock, “Packet sWitching in radio channels: Part III—polling and (dynamic) split-channel reservation multiple access,” IEEE Trans. Commun., vol. COM-24, No. 8, pp. 832-845 (1976).

P. Karn, “MACA—a neW channel access method for packet radio,” in ARRL/CRRL Amateur Radio 9th Computer NetWorking Conference, pp. 134-140, ARRL (Apr. 1990). C.L. Fullmer and J .J . Garcia-Luna-Acheves, “Solutions to Hidden Terminal Problems in Wireless NetWorks,” Proceedings of ACM SIGCOMM ’97, Cannes, France (Sep. 14-18, 1997).

V. Bharghavan, A. Demers, S. Shenker, and L. Zhang, “MACAW: A Media Access Protocol for Wireless LAN ’s,” Proceedings of ACM Sigcomm ’94, London, UK, pp. 212-225 (Aug. 31-Sep. 2, 1994).

J i-Her Ju and Victor O.K. Li, “An Optimal Topology-Transparent Scheduling Method in Multihop Packet Radio NetWorks,” IEEE/ACM Transactions on NetWorking, vol. 6, No. 3, pp. 298-306 (Jun. 1998).

Chenxi Zhu and M.S. Corson, “A Five-Phase Reservation Protocol (FPRP) for Mobile AD Hoc NetWorks,” Proceedings of IEEE INFOCOM ’98.

Z. Tang and J .J . Garcia-Luna-Acheves, “Hop Reservation Multiple Access (HRMA) for Multichannel Packet Radio NetWorks,” Proceedings of IEEE IC3N ’98: Seventh International Conference on Computer Communication NetWorks, Lafayette, Louisiana (Oct. 12-15, 1998).

I. Chlamtac and A. Lerner, “Fair Alrogrithms for Maximal Link Activation in Multihop Radio NetWorks,” IEEE Transactions on Communications, vol. COM-35, No. 7 (Jul. 1987).

J . Haartsen, et al., “Bluetooth: Vision, Goals, and Architecture,” Mobile Computing and Communications RevieW, XP-0007854002, US, ACM, NeW York, NY, vol. 2, No. 4, pp. 38-45 (Oct. 1, 1998).

L. Kleinrock and F.A. Tobagi, “Packet SWitching in Radio Channels: Part 1—Carrier Sense Multiple Access Modes and Their Throughput-Delay Characteristics,” IEEE Trans. Comm., vol. COM-23, No. 12, pp. 1400-1416 (1975). Barry M. Leiner, Donald L. Nielson, and Fouad A. Tobagi, “Issues in Packet Radio NetWork Design,” Proceedings of the IEEE, vol. 75, No. 1, pp. 6-20 (Jan. 1987).

David B. Johnson and David M. Maltz, “Protocols for Adaptive Wireless and Mobile NetWorking,” IEEE Pers. Commun., vol. 3, No. 1 (Feb. 1996).

V. Park and M. Corson, “A Highly Adaptive Distributed Routing Algorithm for Mobile NetWorking,” IEEE INFOCOMM ’97, Kobe, Japan (Apr. 1997).

Rohit Dube, et al., “Signal Stability-Based Adaptive Routing (SSA) for Ad Hoc Mobile NetWorks,” IEEE Pers. Commun., vol. 4, No. 1, pp. 36-45 (Feb. 1997).

<4

Zygmunt J . Hass and Marc R. Pearlman, The Performance of Query Control Schemes for the Zone Routing Protocol,” Proc. ACM SIGCOMM ’98, Vancouver, British Columbia (Aug. 1998).

J . Broch, et al., “A Performance Comparison of Multi-Hop Wireless Ad Hoc NetWorking Routing Protocols,” Proc. ACM MOBICOMM ’98, Dallas, Texas (Oct. 1998).

J . Jubin and J . TornoW, “The DARPA Packet Radio NetWork Protocols,” Proceedings of the IEEE, vol. 75, No. 1, pp. 21-32 (Jan. 1987).

C. Perkins and P. BhagWat, “Highly Dynamic DestinationSequenced Distance-Vector Routing (DSDV) for Mobile Computers,” Proc. ACM SIGCOMM ’94, London, UK (Oct. 1994).

S. Murthy and J .J . Garcia-Luna-Aceves, “An Emcient Routing Protocol for Wireless NetWorks,” ACM Mobile NetWorks and Applications Journal, Special issue on Routing in Mobile Communication NetWorks (1996).

J.J. Garcia-Luna-Aceves, et al., “Wireless Internet GateWays (WINGS),” Proc. IEEE MILCOM ’97, Monterey, California (Nov. 1997).

M. Pursley and H.B. Russell, “Routing in Frequency-Hop Packet Radio NetWorks With Partial-Band Jamming,” IEEE Trans. Commun., vol. 41, No. 7, pp. 1117-1124 (1993). R. Ramanathan and M. Steenstrup, “Heirarchically-organized, Multihop Mobile Wireless NetWorks for Quality-ofService Support,” ACM Mobile NetWorks and Applications, vol. 3, No. 1, pp. 101-119 (1998).

C.V. Ramamoorthy and W. Tsai, “An Adaptive Heirarchical Routing Algorithm,” Proceedings of IEEE COMPSAC ’83, Chicago, Illinois, pp. 93-104 (Nov. 1993).

M. Steenstrup, “Routing in Communications NetWorks,” Chapter 11, pp. 351-389 and 390-396, Prentice-Hall (1995).

J .J . Garcia-Luna-Aceves and J . Behrens, “Distributed, scalable routing based on vectors of link states,” IEEE Journal on Selected Areas in Communications, vol. 13, No. 8 (1995).

J .J. Garcia-Luna Aceves and M. Spohn, “Scalable LinkState Internet Routing,” Proc. IEEE International Conference on NetWork Protocols, (ICNP ’98), Austin, Texas (Oct. 14-16, 1998).

P.A. Humblet, “Another Adaptive Shortest-Path Algorithm,” IEEE Trans. On Commun., vol. 39, No. 6, pp. 995-1003 (Jun. 1991).

C. Cheng, R. Reley, S.P.R. Kumar, and J .J . Garcia-LunAAceves,“A Loop-Free Extended Bellman-Ford Routing Protocol Without Bouncing Effect,” Proc. ACM SIGCOMM ’89, pp. 224-236.

S. Murthy and J .J . Garcia-Luna-Aceves, “Loop-Free Internet Routing Using Heirarchical Routing Trees,” Proc. IEEE INFOCOMM ’97, Kobe, Japan (Apr. 7-11, 1997).

L. Kleinrock and F. Kamoun, “Hierarchical Routing for Large NetWorks: Performance Evaluation and Optimization,” Computer NetWorks, vol. 1, pp. 155-174 (1977).

J . Behrens and J .J . Garcia-Luna-Aceves, “Hierarchical Routing Using Link Vectors,” Proc. IEEE INFOCOMM ’98, San Francisco, California (Mar. 29-Apr. 2, 1998).

D. Bersekas and R. Gallager, “Data NetWorks: Second Edition,” Chapters 4 and 5, pp. 271-492 and 537-551, Prentice-Hall, Inc. (1992).

J . Broch, et al., “The Dynamic Source Routing Protocol for Mobile Ad Hoc NetWorks,” draft-ietf-manet-dsr-01.txt (Dec. 1998).

Matta, Ibrahim and Shankar, A. Udaya, “Type-of-Service Routing in Datagram Delivery Systems,” Proceedings of the

Conference on Computer Communications IEEE, Issue 3 (1994), 15 pages.

* cited by examiner