US20040213167A1 - System for communicating labeled routing trees to establish preferred paths and source routes with local identifiers in wireless computer networks - Google Patents

System for communicating labeled routing trees to establish preferred paths and source routes with local identifiers in wireless computer networks Download PDF

Info

Publication number
US20040213167A1
US20040213167A1 US10843616 US84361604A US2004213167A1 US 20040213167 A1 US20040213167 A1 US 20040213167A1 US 10843616 US10843616 US 10843616 US 84361604 A US84361604 A US 84361604A US 2004213167 A1 US2004213167 A1 US 2004213167A1
Authority
US
Grant status
Application
Patent type
Prior art keywords
link
routing
router
tg
labeled
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
US10843616
Inventor
J. Garcia-Luna-Aceves
Marcelo Spohn
David Beyer
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nokia Solutions and Networks Oy
Original Assignee
Nokia Wireless Routers Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/02Topology update or discovery
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/48Routing tree calculation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATIONS NETWORKS
    • H04W28/00Network traffic or resource management
    • H04W28/16Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
    • H04W28/18Negotiating wireless communication parameters
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATIONS NETWORKS
    • H04W76/00Connection management
    • H04W76/10Connection setup
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATIONS NETWORKS
    • H04W8/00Network data management
    • H04W8/22Processing or transfer of terminal data, e.g. status or physical capabilities
    • H04W8/24Transfer of terminal data
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATIONS NETWORKS
    • H04W8/00Network data management
    • H04W8/26Network addressing or numbering for mobility support

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: (i) 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).

Description

    STATEMENT OF GOVERNMENT LICENSE RIGHTS
  • [0001] The United States Government has a paid-up license in portions of this invention and the right in limited circumstances to require the patent owner to license others on reasonable terms as provided for by the terms of Contract No.: DAAH01-98-C-R005, awarded by the U.S. Army Aviation & Missile Command.
  • FIELD OF THE INVENTION
  • The present invention relates to routing protocols in computer networks, and more particularly, routing protocols in ad hoc networks with radio links. [0002]
  • BACKGROUND
  • Multi-hop packet-radio networks, or ad hoc networks, consist of mobile hosts interconnected by routers that can also move. The deployment of such routers is ad hoc and the topology of such networks is very dynamic, because of host and router mobility, signal loss and interference, and power outages. In addition, the channel bandwidth available in ad hoc networks is relatively limited compared to wired networks, and untethered routers may need to operate with battery-life constraints. In these networks, routing must preferably be accomplished using as few a number of control messages and neighbor-to-neighbor handshakes as possible, in order to conserve channel bandwidth for user data and preserve the battery life of untethered nodes. Because of the dynamics of the topology in an ad hoc network, broadcast radio links are preferable for interconnecting routers without the need for topology planning. [0003]
  • Routing protocols for computer networks can be categorized according to: (a) the type of information the protocols use to compute preferred paths, and (b) the way in which routers obtain routing information. In terms of the type of information used by routing protocols, routing protocols can be classified into link-state protocols and distance-vector protocols. Routers running a link-state protocol use topology information to make routing decisions; routers running a distance-vector protocol use distances and, in some cases, path information, to destinations to make routing decisions. [0004]
  • In terms of the way in which routers obtain information, routing protocols have been classified as either table-driven or on-demand. In an on-demand routing protocol, routers maintain path information for only those destinations that they need to contact as a source or relay of information. The basic approach consists of allowing a router that does not know how to reach a destination to send a flood-search message to obtain the path information it needs. One of the first routing protocols of this type was proposed to establish virtual circuits in the MSE network, see V.O.K. Li and R. Chang, “Proposed routing algorithms for the US Army mobile subscriber equipment (MSE) network,” Proc. IEEE MILCOM'86, Monterey, Calif., October 1986, and there are several other, recent examples of this approach (e.g., AODV, see C. Perkins, “Ad Hoc On Demand Distance Vector (AODV) Routing,” draft-ietf-manet-aodv-00.txt, November 1997; ABR, see C -K. Toh, “Wireless ATM & Ad Hoc Networks,” Kluwer, November 1996; DSR, see D. Johnson and D. Maltz, “Protocols for Adaptive Wireless and Mobile Networking,” IEEE Pers. Commun., Vol. 3, No. 1, February 1996; TORA, see V. Park and M. Corson, “A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks,” Proc. IEEE INFOCOM 97, Kobe, Japan, April 1997; SSA, see R. Dube et al., “Signal Stability-Based Adaptive Routing (SSA) for Ad Hoc Mobile Networks,” IEEE Pers. Commun., February 1997; and ZRP, see Z. Haas and M. Pearlman, “The Zone Routing Protocol for Highly Reconfigurable Ad Hoc Networks,” Proc. ACM SIGCOMM 98, Vancouver, British Columbia, August 1998). The Dynamic Source Routing (DSR) protocol has been shown to out perform many other on-demand routing protocols. J. Broch et al, “A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols,” Proc. ACM MOBICOM 98, Dallas, Tex., October 1998. The existing on-demand routing protocols differ on the specific mechanisms used to disseminate flood-search packets and the responses thereto, the means used to cache information received during other nodes' searches, and the manner in which to determine the cost of a link and the existence of a neighbor. However, one common characteristic of all of the on-demand routing protocols reported to date is that such protocols are based on distances to destinations. Stated differently, there have been no on-demand link-state routing protocol proposals to date. [0005]
  • In a table-driven scheme, each router maintains path information for each known destination in the network and updates its routing-table entries as needed. Examples of table-driven algorithms based on distance vectors are the routing protocol of the DARPA packet-radio network, J. Jubin and J. Tornow, “The DARPA Packet Radio Network Protocols,” Proceedings of the IEEE, Vol. 75, No. 1, January 1987; DSDV, C. Perkins and P. Bhagwat, “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers,” Proc. ACM SIGCOMM 94, London, UK, October 1994; WRP, S. Murthy and J. J. Garcia-Luna-Aceves, “An Efficient Routing Protocol for Wireless Networks,” ACM Mobile Networks and Applications Journal, Special issue on Routing in Mobile Communication Networks, 1996; WIRP, J. J. Garcia-Luna-Aceves et al., “Wireless Internet Gateways (WINGS),” Proc. IEEE MILCOM'97, Monterey, Calif., November 1997; and least-resistance routing protocols, 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. [0006]
  • Prior table-driven approaches to link-state routing in packet-radio networks are based on topology broadcasts. However, disseminating complete link-state information to all routers incurs excessive communication overhead in an ad hoc network because of the dynamics of the network and the small bandwidth available. Accordingly, all existing link-state routing approaches for packet-radio networks have been based on hierarchical routing schemes. R. Ramanathan and M. Steenstrup, “Hierarchically-organized, Multihop Mobile Wireless Networks for Quality-of-Service Support,” ACM Mobile Networks and Applications, Vol.3, No. 1, pp. 101-119, 1998; C. V. Ramamoorthy and W. Tsai, “An Adaptive Hierarchical Routing. Algorithm,” Proceedings of IEEE COMPSAC '83, Chicago, Ill., pp. 93-104, November 1983; and M. Steenstrup (ed.), Routing in Communication Networks, Prentice-Hall, 1995. Also, prior proposals for link-state routing using partial link-state data without clusters, see, e.g., 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; and J.J. Garcia-Luna-Aceves and M. Spohn, “Scalable Link-State Internet Routing,” Proc. IEEE International Conference on Network Protocols (ICNP 98), Austin, Tex., Oct. 14-16, 1998, require routers to explicitly inform their neighbors which links they use and which links they stop using. [0007]
  • A number of prior routing protocols are based on the notion of routing trees, in which routers communicate either the state (i.e., cost or length) of the links in a shortest-path routing tree, or the distance from the root of the tree and the second-to-last hop in the routing tree for each node in the tree. An early example of this type of protocol was proposed in U.S. Pat. No. 4,466,060 to Riddle. In Riddle's protocol, a router communicates different routing trees to different neighbors; such trees are called “exclusionary trees” and specify the preferred paths to destinations excluding those paths that involve the router to which the update is being sent. An update packet or message specifies an entire exclusionary tree. Another protocol based on routing trees was reported by Garcia-Luna-Aceves, J. J. Garcia-Luna-Aceves, “A Fail-Safe Routing Algorithm for Multihop Packet-Radio networks,” Proc. IEEE Infocom 86, Miami, Fla., April 1986, which protocol differs from Riddle's protocol in that the same routing tree is sent incrementally by a router to all its neighbors. A. Humblet, “Another Adaptive Shortest-Path Algorithm,” IEEE Trans. Comm., Vol.39, No.6, June 1991, pp.995-1003 (and see U.S. Pat. No. 4,987,536); Cheng et al., C. Cheng et al., “A Loop-Free Extended Bellman-Ford Routing Protocol without Bouncing Effect”, Proc. ACM SIGCOMM 89, pp.224-236; B. Rajagopalan and M. Faiman, “A Responsive Distributed Shortest-Path Routing Algorithm within Autonomous Systems,” Journal of Internetworking: Research and Experience}, Vol. 2, No. 1, March 1991, pp. 51-69; and S. Murthy and J.J. Garcia-Luna-Aceves, “Loop-Free Internet Routing Using Hierarchical Routing Trees,” Proc. IEEE INFOCOM 97, Kobe, Japan, Apr. 7-11, 1997, have all proposed protocols based on source trees in which a router communicates to its neighbors the same shortest-path routing tree incrementally and these latter examples differ from the above-cited protocol by Garcia-Luna-Aceves in the way in which a router obtains its own source tree from the trees reported by its neighbors. An important feature of all prior routing tree-based protocols is the fact that they are all based on communicating routing trees in terms of the lengths of the links and the identifiers of the nodes that form part of the routing trees. [0008]
  • SUMMARY OF THE INVENTION
  • In one embodiment of the present scheme, 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: (i) 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 delta, 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). [0009]
  • In another embodiment, the present routing protocol allows for distributing local link identifiers among nodes of a computer network within routing state update messages. These local link identifiers are preferably assigned by a head of a link to which the identifiers pertain. The routing state update messages may include state parameters for nodes at tails of links to which the identifiers pertain. The routing protocol may further provide for distributing labeled routing trees of the nodes of the computer network among the nodes, for example wherein each node of the computers network may distribute its labeled routing trees to its neighboring nodes. [0010]
  • In such a routing protocol each node of the computer network preferably maintains one labeled routing tree per type of service offered in the network. These labeled routing trees may be generated according to a partial topology graph derived from the node's adjacent links and labeled routing trees of neighboring nodes, for example by applying a path selection algorithm to the partial topology graph. The labeled routing trees may then be updated in response to receipt of the routing state update messages. Such updates may be made according to either an optimum routing approach or a least overhead routing approach, depending upon which approach is used within the computer network. [0011]
  • For the optimum routing approach, routing state update messages are preferably transmitted: (i) when a routing state update message which causes a link to be added to a subject node's labeled routing trees is received, (ii) when a more recent routing state update message regarding an existing link in the subject node's labeled routing trees is received, and/or (iii) when a destination becomes unreachable by the subject node. In the least overhead routing approach, routing state update messages may be transmitted: (i) when a subject node finds a new destination or any neighbors of the subject node report same, (ii) when a destination becomes unreachable by the subject node or any of its neighbors, (iii) when the subject node finds that the change in the cost of a path to at least one destination exceeds a threshold delta, (iv) when a path implied in any of the labeled routing trees of the subject node leads to a loop, and/or a new successor chosen to a given destination has an address larger than an address of the subject node and a reported distance from the new successor to a particular destination is larger than a reported distance from a previous successor to that particular destination. Another embodiment provides a routing update message that includes information regarding performance characteristics and addressing information for a link of a computer network and a node of the network at a tail end of the link. In some cases, the routing update may further include a time stamp assigned by a node at a head end of the link, a type of service vector, and addressing information for the node at a head end of the link. The performance characteristics preferably include link state parameters (e.g., link delay, link cost, available bandwidth, and/or reliability) of the link, while the type of service vector preferably specifies a type of service routing tree in which the link is being used by a node transmitting the routing update message. The addressing information of the link is preferably specified in the form of a local link identifier assigned to the link by the node at a head end of the link. [0012]
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • The present invention is illustrated by way of example, and not limitation, in the figures of the accompanying drawings in which like reference numerals refer to similar elements and in which: [0013]
  • FIG. 1 illustrates an example of an ad hoc wireless network with routers configured in accordance with the present routing protocol; [0014]
  • FIGS. 2[0015] a-2 d illustrate an example of a six-node wireless network with routers configured in accordance with the present routing protocol and the labeled routing trees developed at various ones of the routers;
  • FIGS. 3[0016] a-3 f illustrate an example of a six-node wireless network with routers configured in accordance with the present routing protocol and the routing state updates generated after certain link failures within the network; and
  • FIGS. 4[0017] a-4 f illustrate an example of how a link failure within a wireless network made up of a number of routers configured in accordance with the present routing protocol may not lead to the generation of new update messages by such routers when all such routers still have a path to all available destinations in the network.
  • DETAILED DESCRIPTION
  • A scheme for enabling routing of data packets in a computer network along preferred paths either on a hop-by-hop basis, or by specifying a source route efficiently by means of local identifiers is disclosed herein. Although discussed with reference to certain illustrated embodiments, upon review of this specification, those of ordinary skill in the art will recognize that the present scheme may find application in a variety of systems. Therefore, in the following description the illustrated embodiments should be regarded as exemplary only and should not be deemed to be limiting in scope. [0018]
  • In the present scheme, each packet being routed carries a routing operation code (ROC) instructing the receiving router which routing method to apply to forward the packet. A packet can be forwarded in any of the following forwarding modes: (a) a conventional hop-by-hop routing mode, which uses the routing table of the router; or (b) a source-routing mode, in which the entire source route is specified in the packet using local link identifiers instead of the addresses of relay routers as is common in prior source routing approaches. These forwarding modes are enabled using the present routing protocol, termed the Adaptive Internet Routing (AIR) protocol, which allows for the dissemination of link-state information and node-state information in the form of labeled routing trees (LRTs). [0019]
  • With AIR, a router sends updates to its neighbors regarding the links and nodes in its preferred paths to destinations. The links and nodes along the preferred paths from a source to each desired destination constitute an LRT that implicitly specifies the complete paths from the source to each destination. Each link is labeled with a local link identifier (LLID). [0020]
  • Each link in an LRT is directed and has a head-of-link node and a tail-of-link node. The head of the link labels the link with an LLFD that differentiates that link from all other links from the same node to other neighbors. The LLID of a link is much smaller (in terms of the number of bits required to specify the LLID) than the address of a node. [0021]
  • Each router maintains an LRT for each type of service defined in the network (e.g., minimum-hop, minimum delay, and maximum bandwidth paths of the smallest number of hops). Each router also maintains a routing or topology graph that includes the state information about adjacent links and the LRTs reported by its neighbors. Each router computes its LRT for a given type of service based on the link and node information available in its topology graph. [0022]
  • A router reports changes to any of its LRTs to all its neighbors incrementally or atomically. The rules used to decide when a router should communicate changes to the state of a node or link can be based on optimum routing or least overhead routing approaches. The aggregation of adjacent links and routing trees reported by neighbors then constitutes the partial topology known by a router. To minimize the number of times the state of a link is communicated to neighbors, a router may assign a type vector to each link, with each bit of the vector indicating in which LRT the link is being used by the router. [0023]
  • AIR does not require backbones, the dissemination of complete cluster topology within a cluster, or the dissemination of the complete inter-cluster connectivity among clusters. Furthermore, AIR can be used with distributed hierarchical routing schemes proposed in the past for either distance-vector or link-state routing. See, e.g., L. Kleinrock and F. Kamoun, “Hierarchical Routing for Large Networks: Performance Evaluation and Optimization,” Computer Networks, Vol. 1, pp. 155-174, 1977; M. Steenstrup (ed.), Routing in Communication Networks, Prentice-Hall, 1995; S. Murthy and J. J. Garcia-Luna-Aceves, “Loop-Free Internet Routing Using Hierarchical Routing Trees,” Proc. IEEE INFOCOM 97, Kobe, Japan, Apr. 7-11, 1997; and J. Behrens and J. J. Garcia-Luna-Aceves, “Hierarchical Routing Using Link Vectors,” Proc. IEEE INFOCOM 98, San Francisco, Calif., Mar. 29-Apr. 2, 1998. [0024]
  • A router chooses its preferred paths for a given type of service using a local path-selection algorithm. One preferred path-selection algorithm for use according to the present scheme is a modification of the shortest-path first (SPF) algorithm. The result of running the path-selection algorithm over the topology graph is an LRT for a given type of service that specifies, for each node in the LRT: the address of the head of the link incident to the node, the state parameters of the link, the state parameters of the node, and the LLID assigned to the link by the head of the link. Of course, other path selection algorithms may be used to provide similar outputs. [0025]
  • From its LRT, a router can compute a source route to a given destination. Because links are labeled with LLIDs assigned by the head of the links, a router can uniquely specify a source route to a destination using its own address followed by a sequence of LLIDs corresponding to its preferred path to the destination, rather than as a sequence of much larger network or link-level addresses. Although source routing and the use of local link identifiers have been used independently of one another in routing and bridging protocols in the past, AIR is the first routing protocol that disseminates the LLIDs of links, thus allowing a compact specification of source routes, making much more efficient use of the available bandwidth. [0026]
  • The present routing scheme is thus well suited for an ad hoc network that provides a seamless extension of the Internet Protocol (IP) to the ad hoc wireless environment. AIR will be described in terms of its operation in internet radios or IRs, which are wireless routers. However, it will be evident to those of ordinary skill in the art that AIR applies to computer networks and inter-networks that need not be based on wireless links for router interconnection. FIG. 1 illustrates aspects of an exemplary ad hoc internet that will assist in understanding the remaining discussion. [0027]
  • Ad hoc network [0028] 10 may be considered as a number of sub-networks 12 a, 12 b, 12 c, which provide an extension of the Internet 14 through a number of Internet Radios or IRs 16 a-16 i. Each IR 16 a-16 i is a wireless router with an assigned IP address and a medium access control (MAC) address. In general, IRs 16 a-16 i operate over one or a multiplicity of radio channels using spread-spectrum wireless communication techniques common in the art. For example, the IRs 16 a-16 i may operate in one of the unregulated UHF frequency bands, thereby obviating the need for operating licenses. Coupling of ad hoc network 10 to the Internet 14 is achieved through a router 18, which may be operated by an Internet Service Provider (ISP). As shown, a single ISP may operate a LAN 20 to which multiple IRs are connected. In such a scheme, IRs 16 a and 16 b may act as “AirHeads”, providing gateway service to Internet 14 via router 18. Some IRs, e.g., IRs 16 d and 16 e of FIG. 1, may be associated with hosts, 22 a, 22 b and 22 c, which can be accessed by any Internet user through ad hoc network 10. Like any router, each IR 16 a-16 i processes all messages, changes in the cost of an adjacent link, adjacent-link failures, and new-neighbor notifications one at a time and in the order in which it detects them.
  • Any IR [0029] 16 a-16 i in FIG. 1 can consider another IR to be adjacent (we call such an IR a “neighbor”) if there is radio connectivity between the two IRs and one IR, e.g., IR 16 g, can receive and acknowledge packets from the other IR, e.g., IR 16 h. Accordingly, a physical broadcast link connecting multiple IRs is mapped into multiple point-to-point bidirectional links defined for the same IRs. Each pair of adjacent IRs defines two point-to-point bidirectional links between them, one in each direction. Each point-to-point bidirectional link has a head node of the link and a tail node of the link.
  • The present routing scheme can be brought to practice together with the methods described in co-pending U.S. application Ser. No. 09/248,738, entitled “Adaptive Communication protocol for Wireless Networks,” filed Feb. 10, 1999, and assigned to the Assignee of the present invention, incorporated herein by reference, for the assignment of logical link identifiers by one node to each of its one-hop neighbors. However, it will be evident to those of ordinary skill in the art that the present scheme can make use of any link-level service that enables a router to use a local identifier for each of its one-hop neighbors. The description of the present routing scheme thus assumes the existence of local identifiers for the links between a router and its immediate neighbors. [0030]
  • An underlying protocol, the above-noted neighbor protocol, assures that each IR [0031] 16 a-16 i detects within a finite time the existence of a new neighbor IR and the loss of connectivity with a neighbor IR. The neighbor protocol assumed in the present scheme can be brought to practice using link-layer retransmission strategies common in the art.
  • I. AIR Operation [0032]
  • In AIR, each IR reports to its neighbors the characteristics of every link and IR it uses to reach a destination in the ad hoc network. The set of links and IRs used by an IR in its preferred path to destinations is called the LRT of the IR. If multiple types of service (TOS) are defined in the network, an IR maintains one LRT per TOS. An IR therefore knows its adjacent links and the LRTs reported by its neighbors for each TOS, and the aggregation of an IR's adjacent links and the LRTs reported by its neighbors constitutes a partial topology graph. The links in the LRT and topology graph should be adjacent links or links reported by at least one neighbor. An IR may use the topology graph to generate its own LRT for each TOS. Each IR derives its LRT and routing table specifying the successor to each destination for each TOS by running a local path-selection algorithm for each TOS on its topology graph. [0033]
  • An IR communicates the updates it makes to its routing tree for any TOS. Because each IR communicates its routing tree for each TOS to its neighbors, the deletion of a link no longer used to reach a destination for a given TOS is implicit with the addition of the new link used to reach the destination and need not be sent explicitly as an update; an IR makes explicit reference to a failed link only when the deletion of a link causes the IR to have no paths to one or more destinations, in which case the IR cannot provide new links to make the deletion of the failed link implicit. [0034]
  • The basic update unit used in AIR to communicate changes to routing trees is the routing-state update (RSU), which describes the state of a link and the node at the end of the link. The head node of a link is the only IR that can report changes in the parameters of that link. RSUs are validated using sequence numbers, and each IR erases a link from its topology graph if the link is not present in the routing trees of any of its neighbors. [0035]
  • The operation of AIR can be described formally by pseudocode. As with any such description, however, there are various equivalent formulations that, upon review of the code provided, will be evident as being equivalent thereto to someone of ordinary skill in the art. The pseudocode description is set forth at the end of this detailed description, and the following variables and expressions are used therein: [0036]
  • T: a constant defining the number of Types of Service (TOS) in the network [0037]
  • Delta[T]: Delta [0], Delta [1], . . . , Delta [T-1] is a vector corresponding to thresholds to changes in the cost of a path to a destination for a given TOS. [0038]
  • AGEOUT_INTERVAL:a constant defining the time a failed link stays in the Topology Graph before being aged-out [0039]
  • ORA:a constant, TRUE if AIR is running under the Optimum Routing Approach [0040]
  • LORA:a constant, TRUE if AIR is running under the Least Overhead Routing Approach [0041]
  • TG[0042] i:Topology Graph at router i
  • LRT[0043] i:Current Labeled Routing Tree at router i
  • LRT[0044] I′:Labeled Routing Tree created the last time an update message was generated by i
  • N[0045] i:set of neighbors of router i
  • NS[0046] i:set to TRUE if i has not sent its Labeled Routing Tree to a neighbor
  • M[0047] i:set to TRUE if i must report changes to the Labeled Routing Tree
  • T[0048] i:system time used to generate time stamps to RSUs
  • (u, v, llid, t; 1[T], {n}, tos[T], del):An entry for link (u, v) in TG[0049] i, LRTi, TGi k, and LRTi k, where kεNi and {I}={llid, 1[T], tos[T], del}.
  • u:Network address of the head of the link [0050]
  • v:Network address of the tail of the link [0051]
  • llid:Local link identifier [0052]
  • t:timestamp [0053]
  • 1[T]:1[0], 1[1], . . . , 1[T-1] is a vector corresponding to the performance parameters of the link. The parameter 1[0] corresponds to the cost of the link, the remaining parameters may be delay, bandwidth, and reliability of the link, etc. [0054]
  • {n}:The state parameters of router v [0055]
  • tos[T]:tos[0], tos[1], . . . , tos[T-1] is the Type of Service bit-vector. A bit x is set to 1 when the link is added to the Labeled Routing Tree with TOS x. [0056]
  • del:Set to TRUE if the link cannot be used in the computation of the Labeled Routing Trees [0057]
  • (d[T], pred[T], suc[T], d′[T], d″[T], suc′[T], nbr): Variables assigned to a vertex v in TG[0058] i, LRTi, TGi k, and LRTi k, where kεNi
  • d[T]:Cost of the path i→v in Labeled Routing Tree x; ∀xε[0; T-1][0059]
  • pred[T]:Predecessor (link) of vertex v in Labeled Routing Tree x; ∀xε[0; T-1][0060]
  • suc[T]:Next-hop towards vertex v in Labeled Routing Tree x; ∀xε[0; T-1][0061]
  • d′[T]:Previous distance to v reported by suc′[T][0062]
  • d″[T]:Cost of the path i→v the last time the cost of the path changed by Δ[T][0063]
  • suc′[T]:Previous successor towards v in Labeled Routing Tree x; ∀xε[0; T-0 1][0064]
  • nbr:Set to i if the cost of the path to v has increased but no update message must be generated [0065]
  • (u, v, llid, t, 1[T], {n}, tos[T]): Entry in an update message (RSU) [0066]
  • u:Network address of the head of the link [0067]
  • v:Network address of the tail of the link [0068]
  • llid:Local link identifier [0069]
  • t:Time stamp assigned to RSU [0070]
  • 1[T]:Vector corresponding to the performance parameters of the link [0071]
  • {n}:The state parameters of router v [0072]
  • tos[T]:Type of Service bit-vector [0073]
  • The pseudocode specifies the main procedures of AIR used to update the routing table and the link-state database at a router i for both an Optimum Routing Approach (ORA) and a Least Overhead Routing Approach (LORA). Procedure NodeUp is executed when a router i starts up. The neighbor set of the router is empty initially. [0074]
  • If the neighbor protocol reports a new link to a neighbor k (procedure {\em NeighborUp), the router then runs Update with the appropriate message as input; the RSU in the message gets a current time stamp. The same approach is used for link failures (NeighborDown) and changes in the parameters of a link (LinkChange). When a router establishes connectivity to a new neighbor, the router sends its complete labeled routing tree to the neighbor (much like a distance vector protocol sends its complete routing table). The RSUs that are to be broadcast to all neighbors are inserted into MSG[0075] i.
  • The procedure Update is executed when router i receives an update message from neighbor k or when the parameters of an outgoing link have changed. First, the topology graphs TG[0076] i and TGi k are updated, then the labeled routing trees LRTi k and LRTi are updated, which may cause the router to update its routing table and to send its own update message.
  • The state of a link in the topology graph TG[0077] i is updated with the new parameters for the link if the routing-state update in the received message is valid, i.e., if the RSU has a larger time stamp than the time stamp of the link stored in TGi.
  • The parameters of a link in TG[0078] i k are always updated when processing an RSU sent by a neighbor k, even if the link-state information is outdated, because they report changes to the labeled routing tree of the neighbor. A node in a labeled routing tree LRTi k for a given TOS can have only one link incident to it. Hence, when i receives an RSU for link (u,v) from k the current incident link (u′, v) to v, u≠u′, is deleted from TGi k.
  • The information of an RSU reporting the failure of a link is discarded if the link is not in the topology graph of the router. [0079]
  • A shortest-path algorithm (SPF) based on Dijkstra's SPF (procedure BuildShortestPathTree) is run on the updated topology graph TG[0080] i k to construct a new labeled routing tree LRTi k, and then run on the topology graph TGi to construct a new labeled routing tree LRTi.
  • The incident link to a node v in router's i new labeled routing tree is different from the link in the current labeled routing tree LRT[0081] i only if the cost of the path to v has decreased or if the incident link in LRTi was deleted from the labeled routing trees of all neighbors.
  • A new labeled routing tree newLRT for a neighbor k, including the router's new labeled routing tree, is then compared to the current labeled routing tree LRT[0082] i k (procedure UpdateNeighborTree), and the links that are in LRTi k but not in newLRT are deleted from TGi k. After deleting a link (u, v) from TGi k the router sets TGi(u, v).del to TRUE if the link is not present in the topology graphs TGi x, γXεNi.
  • If a destination v becomes unreachable, i.e., there is no path to v in the new labeled routing tree newLRT, then RSUs will be broadcast to the neighbors for each link in the topology graph TG[0083] i that have v as the tail node of the link and a link cost infinity.
  • This specification assumes that the Link Layer provides reliable broadcast of network-level packets and consequently update messages specify only incremental changes to the router's labeled routing tree instead of the complete labeled routing tree. [0084]
  • The new router's labeled routing tree newLRT is compared to the last reported labeled routing tree ({LRT[0085] i}′ for LORA and LRTi for ORA) (procedure ReportChanges), and an update message that will be broadcast to the neighbors is constructed from the differences of the two trees. An RSU is generated if the link is in the new labeled routing tree but not in the current labeled routing tree, or if the parameters of the link have changed. For the case of a router running LORA, the labeled routing trees are only compared with each other if at least one of the four rules described in section V, below, is met, i.e., Mi=TRUE.
  • If the new router's labeled routing tree was compared against the last reported labeled routing tree then the router removes from the topology graph all the links that are no longer used by any neighbor in their labeled routing trees (failed links are only removed from the topology graph by agine). [0086]
  • Finally, the current shortest-path tree LRT[0087] i k is discarded and the new one becomes the current labeled routing tree. The router's labeled routing tree is then used to compute the new routing table, using for example a depth-first search in the shortest-path tree.
  • II. Information Exchanged in AIR [0088]
  • Prior routing protocols based on topology information or distance information are based on the parameters of links exclusively. In contrast, AIR uses an update unit that conveys information about the performance characteristics and addressing information for a link and the node at the end of the link. More specifically, an RSU includes the following elements: [0089]
  • a) A time stamp that validates the RSU; [0090]
  • b) A type-of-service vector; [0091]
  • c) The network address of the head node of the link; [0092]
  • d) The network address of the tail node of the link; [0093]
  • e) The link state parameters of the link between the two IRs; and [0094]
  • f) The node state parameters of the tail of the link. [0095]
  • An update message sent by an IR contains at least one RSU. The time stamp of the RSU is assigned by the head of the link and should not be altered by any other node relaying the RSU in an update message. The type-of-service (TOS) vector is a bit vector specifying the TOS routing tree in which the link is being used by the node sending the RSU. The state parameters of a link are specified as a list of tuples, with each tuple consisting of a type and a content. There are two classes of state parameters for a link: performance parameters and addressing parameters. The performance of a link can be characterized in terms of its delay, cost, bandwidth, and reliability, for example. An addressing parameter specifies an identifier assigned to the link. An example of such an identifier in the present scheme is the local link identifier (LLID) assigned to the link by the head of the link. The state parameters of the tail of a link may include, for example, the remaining battery life of the node. [0096]
  • III. Information Stored in AIR [0097]
  • FIGS. 2[0098] a-2 d illustrate the fact that IRs running AIR need maintain only partial topology information. These illustrations provide an example of a six-node wireless network (each node labeled a-f, respectively). For simplicity, these Figures assume that a single link parameter is used to characterize a link in one of its directions, called the “cost” of the directed link. For example, link 32 c may have a cost of 5 in the direction b to c, but only a cost of 1 in the direction c to b. In other examples, nodes may be coupled by multiple links between them, each having the same or different costs. FIGS. 2b through 2 d show the selected topology according to AIR at the IRs indicated with filled circles. Solid lines represent the links that are part of the labeled routing tree of the respective IR. Arrowheads on links indicate the direction of the link stored in the IR's topology graph. IR a's labeled routing tree shown in FIG. 2b is formed by the labeled routing trees reported by its neighbors b and c, and the links for which IR a is the head node (namely links (a, b) and (a, c)). Similarly, FIG. 2c shows the LRT for IR b and FIG. 2d that for IR c. From the figures, the savings in storage requirements should be clear, even for this few-node network.
  • The information maintained by an IR to participate in AIR includes a topology graph, an LRT for each TOS defined in the network, a routing table, and an adjacent-link table. The record entry for the link from u to v in the topology graph consists of the tuple (u, v, t, {1}, {n}), where u and v are the network addresses of the head and tail of the link, respectively, t is the most recent time stamp received for link (u, v), {1} is a sequence of type-value pairs specifying link parameters, and {n} is a sequence of type-value pairs specifying node parameters. A link parameter used in the present scheme is the LLID of the link. [0099]
  • The routing table specifies, for each destination and for each TOS, the next IR in the path to the destination and the distance to that destination based on the distance metric used for the TOS. [0100]
  • The cost of a failed link is considered to be infinity for any TOS. There are various ways in which costs may be assigned to links for a given TOS known in the art. For example, the cost of a link could simply be the number of hops, or the addition of the latency over the link plus some constant bias. [0101]
  • IV. Validating Updates [0102]
  • Because of delays in the IRs and links of an internetwork, update messages sent by a IR may propagate at different speeds along different paths. Therefore, a given IR may receive an RSU from a neighbor with stale link-state information, and a distributed termination-detection mechanism is necessary for a IR to ascertain when a given RSU is valid and avoid the possibility of RSUs circulating forever. AIR uses time stamp to validate RSUs. An IR either maintains a clock that does not reset when the IR stops operating, or asks its neighbors for the oldest known time stamp after if initializes or reboots. [0103]
  • An IR receiving an RSU accepts the RSU as valid if the received RSU has a larger time stamp than the time stammp of the RSU stored from the same source, or if there is no entry for the link in the topology graph and the RSU is not reporting an infinite cost. Link-state information for failed links are the only RSUs erased from the topology graph due to aging (which may be on the order of an hour or so (or other time period) after having processed the RSU). RSUs for operational links are erased from the topology graph when the links are erased from the routing trees of all the neighbors. [0104]
  • It is noted that, because RSUs for operational links never age out, there is no need for the head node of a link to send periodic RSUs to update the time stamp of the link. This is important, because it means that AIR does not need periodic update messages to validate link-state information like OSPF, J. Moy, “OSPF Version 2,” RFC 1583, Network Working Group, March 1994, and all prior protocols based on sequence numbers or time stamps. [0105]
  • V. Exchanging Update Messages [0106]
  • An IR sends RSUs in two different ways: (a) Following an optimum routing approach; and (b) following a least overhead approach. The optimum routing approach is well suited for networks with fairly static topologies. The least overhead approach is tailored for networks with dynamic topologies due to IR mobility. Which approach should be executed in IRs can be defined by an IR configuration parameter. [0107]
  • As indicated in the pseudocode description, according to the optimum routing approach an IR sends RSUs about a link in the following cases: (a) when an RSU is received for the link causing the link to be added to the IR's routing tree, (b) when the link is already in the IR's routing tree and a more recent RSU is received for the link, (c) when an RSU reporting the failure of the link results in no path to the tail of the link, and (d) when a failed link is not in the IR's routing tree and there is no path to the tail of the link. [0108]
  • In contrast, according to the least overhead approach an IR sends RSUs according to the following rules: [0109]
  • (a) The IR finds a new destination, or any of its neighbors reports a new destination. [0110]
  • (b) The IR finds that the change in the cost of a path to at least one distination exceeds a threshold delta, or at least one destination becomes unreachable to the IR or any of its neighbors. [0111]
  • (c) A path implied in the LRT of the IR leads to a loop. [0112]
  • (d) The IR sends an RSU when: (i) The new successor chosen to a given destination has an address larger than the address of the IR; and (ii) the reported distance from the new chosen successor n to a destination j is longer than the reported distance from the previous successor to the same destination. However, if the link from the IR to j fails and n is a neighbor of j, no update message is needed regarding j or any destination whose path from the IR involves j. [0113]
  • Each time an IR processes an update message from a neighbor, it updates that neighbor's LRT and traverses that tree to determine for which destinations its neighbor uses the IR as a relay in its preferred paths. The IR then determines if it is using the same neighbor as a relay for any of the same destinations. A routing loop is detected if the IR and neighbor use each other as relay to any destination, in which case the loop must be broken and the IR must send an update message with the corresponding changes. [0114]
  • We observe that, in any routing loop among IRs with unique addresses, one of the IRs must have the smallest address in the loop; therefore, if an IR is forced to send an update message when it chooses a successor whose address is larger than its own, then it is not possible for all IRs in a routing loop to remain quiet after choosing one another, because at least one of them is forced to send an update message, which causes the loop to break when IRs update their LRTs. [0115]
  • To ensure that AIR works correctly with least overhead routing and incremental updates specifying only changes to an LRT, an IR must remember the LRT that was last notified to its neighbors. If any of the rules for update notification in least overhead routing are satisfied, the IR must do one of two things: (a) If the LRT includes new neighbors than those present in the LRT that was last updated, then the IR must send its entire LRT in its update, so that new neighbors learn about all the destinations the IR knows; (b) if the two LRTs imply the same neighbors, the IR sends only the updates needed to obtain the new LRT from the old one. [0116]
  • To ensure that AIR stops sending update messages, a simple rule can be used to determine which IR must stop using its neighbor as a relay, such a rule can be, for example, “the IR with the smaller address must change its path.”[0117]
  • The rules for update-message exchange according to least overhead routing stated above assume that an update message is sent reliably to all the neighbors of an IR. The following example illustrates a scenario in which the last rule is needed to prevent permanent loops. Consider the six-node wireless network [0118] 30 shown in FIG. 2a. In this example, IRs are given identifiers that are lexicographically ordered, i.e., “a” is the smallest identifier and “f” is the largest identifier in the graph. All links and nodes are assumed to have the same propagation delays, all the links but links (a, b) and (b, c) have unit cost, and delta=∞. FIGS. 2b through 2 d show the LRTs according to AIR at the IRs indicated with filled circles for the network topology depicted in FIG. 2a. Arrowheads on solid lines indicate the direction of the links stored in the IR's LRT.
  • FIGS. 3[0119] a-3 f now depict the sequence of events triggered by the execution of AIR in the example network after the failures of links (c, d) 32 g and (b, e) 32 d. The figures show the RSUs (in parentheses) generated by the node with filled circle, which RSUs are transmitted in an update message to the node's neighbors. The third element in an RSU corresponds to the cost of the link (a RESET has cost infinity). As shown in FIG. 3b, node c transmits an RSU after processing the failure of link (c, d) 32 g; the distance from the new successor b to d and f is longer than from the previous successor d. When link (b, e) 32 d fails (see FIG. 3d), node b realizes that the destinations d, e, and f are unreachable and generates an RSU reporting the failure of the link connecting to the head of the subtree of the LRT that becomes unreachable. The RSU from b triggers the RSUs that allow nodes a, b, and c to realize that there are no paths to d, e, and f (FIGS. 3e and 3 f). A similar sequence of events takes place at the other side of the network partition (not shown).
  • As another example of the operation of AIR, consider the seven-node wireless network [0120] 40 shown in FIG. 4a. All links and nodes are assumed to have the same propagation delays, all the links have unit cost, delta=∞. FIGS. 4b through 4 d show the LRTs produced according to AIR at the IRs indicated with filled circles for the network topology depicted in FIG. 4a. Arrowheads on solid lines indicate the direction of the links stored in the IR's LRT. When the link (f, g) fails (FIG. 4e), the neighbor protocol at node f triggers the execution of procedure NeighborDown, the link (d, g) is inserted into f's LRT but no update message is generated because f's new successor towards g has an address smaller than f and destination g is a neighbor of the new successor. FIG. 4f shows the new LRT of node d after the failure of link (d, g). Because d has an address smaller than the new successor towards g it is required to send an update message reporting the new link added to the LRT. Nodes c, e, and f do not generate any update message after processing d's message because there exist a path to all destinations in the network and no routing loop was formed. This example thus illustrates how link failures may not cause the generation of update messages by nodes that have the failed link in their LRTs as long as the nodes have a path to all destinations.
  • VI. Obtaining LRTs and Source Routes [0121]
  • Obtaining the LRTs and source routes in the present scheme is done with a very simple modification to Dijkstra's SPF algorithm that is run on the topology graph of an IR. The modifications to SPF consist of checking for the proper bit to be set in the TOS bit vector of a link so that only those links being used for the required TOS are considered in preferred paths, and accumulating the source route in terms of LLIDs as the topology graph is traversed. [0122]
  • Given the topology graph, the algorithm proceeds as follows: [0123]
  • 1. Initialize: [0124]
    1. Initialize:
     Value of TOS bit vector = T
     Set IR-set = {root}, where root is the IR running the algorithm.
     Dist-to-root = 0
     Route-to-root = root
     for all IRs other than root set
      Dist-to-IR = infinity
      Route-to-IR = root
     for all IRs neighbors of root
      If TOS bit vector = T then
       Dist-to-IR = cost of link to IR
       Route-to-IR = Route-to-IR U LLID of link to IR
    2. Find next IR in IR-set:
     Find an IR x not in set such that:
     Dist-to-IR = Minimum{Dist-to-IR not in IR-set
     considering only links with TOS bit vector = T}
     Augment IR-set = IR-set U x
     Stop if IR-set contains all IRs
    3. Change chosen distance and path:
     For each IR y not in IR-set do:
     Dist-to-y = Minimum{ Dist-to-y, Dist-to-z + cost of link(z,y)
      with z in IR-set and TOS bit vector of (z,y) = T}
     Route-to-y = Route-to-z U LLID of (z,y)
    4. Repeat Step 2.
  • Thus a scheme for enabling routing of data packets in a computer network has been described. Although the foregoing description and accompanying figures discuss and illustrate specific embodiments, it should be appreciated that the present invention is to be measured only in terms of the claims that follow the example of a pseudocode listing for the routing protocol set forth below: [0125]
    NodeUp( )
    description
    Node i initializes itself
    {
     TGi
    Figure US20040213167A1-20041028-P00801
    ;
     LRTi
    Figure US20040213167A1-20041028-P00801
    ;
     LRT′i
    Figure US20040213167A1-20041028-P00801
    ;
     Ni
    Figure US20040213167A1-20041028-P00801
    ;
     Mi
    Figure US20040213167A1-20041028-P00801
    FALSE;
     NSi
    Figure US20040213167A1-20041028-P00801
    FALSE;
    }
    NeighborUp(k, llid, l[T], {n})
    description
     Neighbor protocol reports connectivity to neighbor k
    {
     Ni
    Figure US20040213167A1-20041028-P00801
    Ni ∪ {k};
     TGi k
    Figure US20040213167A1-20041028-P00801
    ;
     LRTi k
    Figure US20040213167A1-20041028-P00801
    ;
     sendLRT
    Figure US20040213167A1-20041028-P00801
    TRUE;
     tos[x]
    Figure US20040213167A1-20041028-P00801
    0, ∀ x ∈ [0,T − 1];
     if ( LORA and k ∈ TGi and TGi(k).pred[0] ≠ null )
     {
      NSi
    Figure US20040213167A1-20041028-P00801
    TRUE;
      sendLRT
    Figure US20040213167A1-20041028-P00801
    FALSE;
     }
     Update(i, (i, k, llid, Ti, l[T], {n}, tos[T]));
     if ( sendLRT )
     {
      MSGi
    Figure US20040213167A1-20041028-P00801
    ;
      for each ( link (u, v) ∈ LRTi )
       MSGi
    Figure US20040213167A1-20041028-P00801
    MSGi ∪ {( u, v, TGi(u, v).llid,TGi(u, v).t,
                TGi(u, v).l[T], TGi(u, v).{n}, TGi(u, v).tos[T])};
     }
     Send( );
    }
    NeighborDown(k, llid)
    description
     Neighbor protocol reports link failure to neighbor k
    {
     Ni
    Figure US20040213167A1-20041028-P00801
    Ni − {k};
     TGi k
    Figure US20040213167A1-20041028-P00801
    ;
     LRTi k
    Figure US20040213167A1-20041028-P00801
    ;
     l[x]
    Figure US20040213167A1-20041028-P00801
    ∞, ∀ x ∈ [0, T − 1];
     tos[x]
    Figure US20040213167A1-20041028-P00801
    0, ∀ x ∈ [0, T − 1];
     Update(i, (i, k, llid, Ti, l[T], , tos[T]));
     Send( );
    }
    LinkChange(k, llid, l[T], {n})
    description
     Neighbor protocol reports link cost change to neighbor k
    {
     Update(i, (i, k, llid, Ti, l[T], {n}, TGi(i, k).tos[T]));
     Send( );
    }
    Update(k, msg)
    description
     Process update message msg sent by router k
    {
     newLRTi
    Figure US20040213167A1-20041028-P00801
    ;
     newLRTk
    Figure US20040213167A1-20041028-P00801
    ;
     UpdateTopologyGraph(k, msg);
     for each ( x ∈ [0, T − 1] )
      ComputeLabeled RoutingTreeTOSx(k, newLRTi, newLRTk);
     if ( k ≠ i )
     {
      UpdateNeighborTree(k, newLRTk);
      LRTi k
    Figure US20040213167A1-20041028-P00801
    newLRTk;
      newLRTk
    Figure US20040213167A1-20041028-P00801
    ;
     }
     UpdateNeighborTree(i, newLRTi);
     if ( LORA and Mi )
     {
      ReportChanges(LRT′i, newLRTi);
      LRT′i
    Figure US20040213167A1-20041028-P00801
    newLRTi;
      NSi
    Figure US20040213167A1-20041028-P00801
    FALSE;
     }
     else if ( ORA )
      ReportChanges(LRTi, newLRTi);
     if ( ORA or ( LORA and Mi ) )
      for each ( link (u, v) ∈ TGi | TGi(u, v).del = TRUE )
       TGi
    Figure US20040213167A1-20041028-P00801
    TGi − {(u,v)};
     Mi
    Figure US20040213167A1-20041028-P00801
    FALSE;
     LRTi
    Figure US20040213167A1-20041028-P00801
    newLRTi;
     newLRTi
    Figure US20040213167A1-20041028-P00801
    ;
     UpdateRoutingTable( );
     if ( k ≠ i )
      Send( );
    }
    UpdateTopologyGraph(k, msg)
    description
     Update TGi and TGk i from RSUs in msg
    {
     for each ( RSU (u, v, llid, t, l[T], {n}, tos[T]) ∈ msg )
     {
      if ( l[0] ≠ ∞ )
       ProcessAddUpdate(k, (u, v, llid, t, l[T], {n}, tos[T]));
      else
       ProcessVoidUpdate(k, (u, v, llid, t, l[T], {n}, tos[T]));
     }
    }
    Send( )
    {
     if ( MSGi ≠  )
      Broadcast message MSGi;
     MSGi
    Figure US20040213167A1-20041028-P00801
    ;
    }
    ProcessAddUpdate(k, (u, v, llid, t, l[T], {n}, tos[T]))
    description
     Update topology graphs TGi and TGk i from RSU (u, v, llid, t, l[T], {n}, tos[T])
    {
     if ( (u, v) ∉ TGi or t > TGi(u, v).t )
     {
      if ( (u, v) ∉ TGi )
       TGi
    Figure US20040213167A1-20041028-P00801
    TGi ∪ {(u, v, llid, t, l[T], {n}, tos[T])};
      else
      {
       if ( TGi(u, v).l[0] = ∞ )
        Link (u, v) is no longer scheduled to age-out;
       TGi(u, v).llid
    Figure US20040213167A1-20041028-P00801
    llid;
       TGi(u, v).t
    Figure US20040213167A1-20041028-P00801
    t;
       TGi(u, v).l[T]
    Figure US20040213167A1-20041028-P00801
    l[T];
       TGi(u, v).{n}
    Figure US20040213167A1-20041028-P00801
    {n};
      }
     }
     if ( k ≠ i )
     {
      for each ( link (r, s) ∈ TGk i | r ≠ u and s = v )
      {
       TGk i(r, s).tos[T]
    Figure US20040213167A1-20041028-P00801
    TGk i(r, s).tos[T]
    Figure US20040213167A1-20041028-P00804
    Figure US20040213167A1-20041028-P00802
    (TGk i(r, s).tos[T] {circumflex over ( )} tos[T]);
       if ( TGk i(r, s).tos[x] = 0, ∀ x ∈ [0, T − 1] )
        TGk i
    Figure US20040213167A1-20041028-P00801
    TGk i − {(r, s)};
      }
      if ( (u, v) ∉ TGk i )
       TGk i
    Figure US20040213167A1-20041028-P00801
    TGk i ∪{(u, v, llid, t, l[T], {n}, tos[T])};
      else
      {
       TGk i (u, v).llid
    Figure US20040213167A1-20041028-P00801
    llid;
       TGk i (u, v).t
    Figure US20040213167A1-20041028-P00801
    t;
       TGk i (u, v).l[T]
    Figure US20040213167A1-20041028-P00801
    l[T];
       TGk i (u, v).{n}
    Figure US20040213167A1-20041028-P00801
    {n};
       TGk i (u, v).tos[T]
    Figure US20040213167A1-20041028-P00801
    tos[T];
      }
     }
     TGi(u, v).del
    Figure US20040213167A1-20041028-P00801
    FALSE;
    }
    ProcessVoidUpdate(k, (u, v, llid, t, l[T], {n}, tos[T]))
    description
     Update topology graphs TGi and TGk i from RSU
     (u, v, llid, t, l[T], {n}, tos[T]) reporting link failure
    {
     if ( (u, v) ∈ TGi )
     {
      if ( t > TGi(u, v).t )
      {
       TGi(u, v).llid
    Figure US20040213167A1-20041028-P00801
    llid;
       TGi(u, v).t
    Figure US20040213167A1-20041028-P00801
    t;
       TGi(u, v).l[T]
    Figure US20040213167A1-20041028-P00801
    l[T];
       TGi(u, v).{n}
    Figure US20040213167A1-20041028-P00801
    {n};
       Schedule link (u, v) to age-out in AGEOUT INTERVAL seconds.
       The following operation is performed when the link (u, v)
       ages out: TGi
    Figure US20040213167A1-20041028-P00801
    TGi − {(u, v)};
      }
      if ( k ≠ i and (u, v) ∈ TGk i )
      {
       TGk i(u, v).llid
    Figure US20040213167A1-20041028-P00801
    llid;
       TGk i(u, v).t
    Figure US20040213167A1-20041028-P00801
    t;
       TGk i(u, v).l[T]
    Figure US20040213167A1-20041028-P00801
    l[T];
       TGk i(u, v).{n}
    Figure US20040213167A1-20041028-P00801
    {n};
       TGk i(u, v).tos[T]
    Figure US20040213167A1-20041028-P00801
    tos[T];
      }
      TGi(u, v).del
    Figure US20040213167A1-20041028-P00801
    FALSE;
     }
    }
    ComputeLabeled RoutingTreeTOS0 (k, newLRTi, newLRTk)
    {
     if ( k ≠ i )
      BuildShortestPathTree(k, newLRTk);
     BuildShortestPathTree(i, newLRTi);
    }
    BuildShortestPathTree(k, newLR
    description
     Construct LRTi k
    {
     InitializeSingleLabeled Routing(k);
     Q
    Figure US20040213167A1-20041028-P00801
    set of vertices in TGk i;
     u
    Figure US20040213167A1-20041028-P00801
    ExtractMin(Q);
     while ( u ≠ null and TGk i(u).d[0] < ∞ )
     {
      if ( TGk i(u).pred[0] ≠ null and NOT TGk i(u).pred[0].tos[0] )
      {
       (r, s)
    Figure US20040213167A1-20041028-P00801
    TGk i(u).pred[0];
       TGk i(r, s).tos[0]
    Figure US20040213167A1-20041028-P00801
    1;
       if ( (r, s) ∉ newLRT )
        newLRT
    Figure US20040213167A1-20041028-P00801
    newLRT ∪ (r, s);
       newLRT(r, s).tos[0]
    Figure US20040213167A1-20041028-P00801
    1;
       if ( LORA and k = i )
       {
        if ( i > TGi(u).suc[0] )
         if ( ∃ x ∈ Ni | TGi x(u).suc[0] = i and TGi(u).suc[0] = x )
          Mi
    Figure US20040213167A1-20041028-P00801
    TRUE;  // LORA-3 rule
        if ( TGi(u).suc[0] ≠ TGi(u).suc′[0] and TGi(u).suc[0] > i )
         Mi
    Figure US20040213167A1-20041028-P00801
    TRUE;  // LORA-3 rule
        if ( β (x, y) ∈ LRT′i | y = u and LRT′i(x, y).tos[0] )
         Mi
    Figure US20040213167A1-20041028-P00801
    TRUE;  // LORA-1 rule
        if ( | TGi(u).d[0] − TGi(u).d″[0] | > Δ )
        {
         Mi
    Figure US20040213167A1-20041028-P00801
    TRUE;  // LORA-2 rule
         TGi(u).d″[0]
    Figure US20040213167A1-20041028-P00801
    TGi(u).d[0];
        }
        w
    Figure US20040213167A1-20041028-P00801
    TGi(u).suc[0];
        if ( w ≠ i )
         path_w_u_cost
    Figure US20040213167A1-20041028-P00801
    TGi(u).d[0] − TGi(i, w).l[0];
        else
         path_w_u_cost
    Figure US20040213167A1-20041028-P00801
    0;
        if ( path_w_u_cost > TGi(u).d′[0] )
        {
         if ( r = w or TGi(r).nbr = i )
          TGi(s).nbr
    Figure US20040213167A1-20041028-P00801
    i;
         if ( TGi(s).nbr ≠ i )
          Mi
    Figure US20040213167A1-20041028-P00801
    TRUE;  // LORA-3 rule
        }
        TGi(u).d′[0]
    Figure US20040213167A1-20041028-P00801
    path_w_u_cost;
        TGi(u).suc′[0]
    Figure US20040213167A1-20041028-P00801
    TGi(u).suc[0];
       }
      }
      for each ( vertex v ∈ adjacency list of TGk i(u) )
      {
       TGk i(u, v).tos[0]
    Figure US20040213167A1-20041028-P00801
    0;
       if ( TGk i(u, v).l[0] ≠ ∞ and NOT TGi(u, v).del )
       {
        if ( k = i )
        {
         if ( u = i )
          suc
    Figure US20040213167A1-20041028-P00801
    i;
         else if ( TGi(u).suc[0] = i )
          suc
    Figure US20040213167A1-20041028-P00801
    {x | x ∈ Ni and x = u};
         else
          suc
    Figure US20040213167A1-20041028-P00801
    TGi(u).suc[0];
        }
        else
        {
         if ( u = k )
          if ( v = i ) suc
    Figure US20040213167A1-20041028-P00801
    i;
          else suc
    Figure US20040213167A1-20041028-P00801
    k;
         else
          suc
    Figure US20040213167A1-20041028-P00801
    TGi(u).suc[0];
        }
        RelaxEdge(k, u, v, Q, suc);
       }
      }
      if ( Q ≠  ) u
    Figure US20040213167A1-20041028-P00801
    ExtractMin(Q);
      else u
    Figure US20040213167A1-20041028-P00801
    null;
     }
    }
    InitializeSingleLabeled Routing(k)
    {
     for each ( vertex v ∈ TGk i )
     {
      TGk i(v).d[0]
    Figure US20040213167A1-20041028-P00801
    ∞;
      TGk i(v).pred[0]
    Figure US20040213167A1-20041028-P00801
    null;
      TGk i(v).suc′[0]
    Figure US20040213167A1-20041028-P00801
    TGk i(v).suc[0];
      TGk i(v).suc[0]
    Figure US20040213167A1-20041028-P00801
    null;
      TGk i(v).nbr[0]
    Figure US20040213167A1-20041028-P00801
    null;
     }
     TGk i(k).d[0]
    Figure US20040213167A1-20041028-P00801
    0;
    }
    RelaxEdge(k, u, v, Q, suc)
    {
     if ( TGk i(v).d[0] > TGk i(u).d[0] + TGk i(u, v).l[0] or
      ( k = i and TGk i(v).d[0] = TGk i(u).d[0] + TGk i(u, v).l[0] and
       (u, v) ∈ LRTi and LRTi (u, v).tos[0] ) )
     {
      TGk i(v).d[0]
    Figure US20040213167A1-20041028-P00801
    TGk i(u).d[0] + TGk i(u, v).l[0];
      TGk i(v).pred[0]
    Figure US20040213167A1-20041028-P00801
    TGk i(u, v);
      TGk i(v).suc[0]
    Figure US20040213167A1-20041028-P00801
    suc;
      if ( LORA and k = i and TGi(v).suc′[0] = null )
      {
       // v was an unknown destination
       TGi(v).suc′[0]
    Figure US20040213167A1-20041028-P00801
    suc;
       TGi(v).d″[0]
    Figure US20040213167A1-20041028-P00801
    TGi(v).d[0];
       if ( suc ≠ i )
        TGi(v).d′[0]
    Figure US20040213167A1-20041028-P00801
    TGi(v).d[0] − TGi(i, suc).l[0];
       else
        TGi(v).d′[0]
    Figure US20040213167A1-20041028-P00801
    0;
      }
      Insert(Q, v);
     }
    }
    ReportChanges(oldLRT, newLRT)
    description
     Generate RSUs for new links in the router∉s labeled routing tree
    {
     for each ( link (u, v) ∈ newLRT )
      if ( (u, v) ∉ oldLRT or newLRT(u, v).t ≠ oldLRT(u, v).t or oldLRT(u, v).tos[T] ≠ newLRT(u, v).tos[T] or NSi )
       MSGi
    Figure US20040213167A1-20041028-P00801
    MSGi ∪ {( u, v, TGi(u, v).llid, TGi(u, v).t, TGi(u, v).l[T], TGi(u, v).{n}, TGi(u, v).tos[T])};
    }
    UpdateNeighborTree(k, newLRT)
    description
     Delete links from TGk i and report failed links
    {
     for each ( link (u, v) ∈ LRTi k )
     {
      if ( (u, v) ∉ newLRT )
      {
       // k Has removed (u, v) from its labeled routing tree
       if ( LORA and ( TGk i(v).pred[x] = null, ∀ x ∈ [0, T − 1] ) )
       {
        // LORA-2 rule: k has no path to destination v
        Mi
    Figure US20040213167A1-20041028-P00801
    TRUE;
        if ( k = i )
         for each ( link (r, s) ∈ TGi | s = v )
          if ( TGi(r, s).l[0] = ∞ )
           MSGi
    Figure US20040213167A1-20041028-P00801
    MSGi ∪ {( r, s, TGi(r, s).llid, TGi(r, s).t, TGi(r, s).l[T], TGi(r, s).{n}, TGi(r, s).tos[T])};
       }
       if ( ORA and k = i and ( u = i or ( TGi(v).pred[x] = null, ∀ x ∈ [0, T − 1] ) ) )
       {
        // i has no path to destination v or i is the head node
        if ( TGi(v).pred[x] = null, ∀ x ∈ [0, T − 1] )
         for each ( link (r, s) ∈ TGi| s = v )
          if ( TGi(r, s).l[0] = ∞ )
           MSGi
    Figure US20040213167A1-20041028-P00801
    MSGi ∪ {( r, s, TGi(r, s).llid, TGi(r, s).t, TGi(r, s).l[T], TGi(r, s).{n}, TGi(r, s).tos[T])};
        else if ( TGi(u, v).l[0] = ∞ )
         // i Needs to report failed link
         MSGi
    Figure US20040213167A1-20041028-P00801
    MSGi ∪ {( u, v, TGi (u, v).llid, TGi(u, v).t, TGi(u, v).l[T], TGi(u, v).{n}, TGi(u, v).tos[T])};
       }
       if ( LORA and k = i and ( TGi(v).pred[x] = null, ∀ x ∈ [0, T − 1] ) )
       {
        TGi(v).d′[x]
    Figure US20040213167A1-20041028-P00801
    ∞, ∀ x ∈ [0, T − 1];
        TGi(v).suc′[x]
    Figure US20040213167A1-20041028-P00801
    null, ∀ x ∈ [0, T − 1];
        TGi(v).d″[x]
    Figure US20040213167A1-20041028-P00801
    ∞, ∀ x ∈ [0, T − 1];
       }
       if ( NOT ( k = i and u = i ) )
       {
        if ( (u, v) ∈ TGk i )
         TGk i
    Figure US20040213167A1-20041028-P00801
    TGk i − {(u, v)};
        if ( TGi(u, v).l[0] ≠ ∞ and β x ∈ Ni| (u, v) ∈ TGi x )
         TGi(u, v).del
    Figure US20040213167A1-20041028-P00801
    TRUE;
       }
      }
     }
    }

Claims (19)

  1. 1-27. (Canceled)
  2. 28. A method for routing information along preferred paths in a computer network in which a plurality of routers are interconnected by communication links, comprising:
    forming a partial topology graph for a router by combining link-state information of each adjacent link, router-state information of each adjacent router, and link-state information and node-state information of each link adjacent to each adjacent router; and
    computing a plurality of labeled routing trees (LRT) for the router using only the partial topology graph, each LRT corresponding to a type of service of the computer network, each LRT specifying a preferred path from the router to each of a plurality of destination routers in the network.
  3. 29. The method of claim 28 wherein the LRTs of the router are updated in response to receipt of routing state update messages.
  4. 30. The method of claim 29 wherein the routing state update messages include one or more local link identifiers, each local link identifier assigned by a head-of-link router to which the identifier pertains.
  5. 31. The method of claim 30 wherein the routing state update messages further include router parameters of a tail-of-link router to which a local link identifier pertains.
  6. 32. A source routing protocol, for a computer network in which a plurality of routers are interconnected by communication links, comprising distributing, among the plurality of routers of the computer network, a local link identifier corresponding to each router within routing state update messages, the routing state update messages including a link-state information and a node-state information,
    wherein each router maintains a plurality of labeled routing tree (LRT), each LRT corresponding to a type of service of the computer network.
  7. 33. The source routing protocol of claim 32 wherein the local link identifiers are each assigned by a head-of-link router to which the identifiers pertain.
  8. 34. The source routing protocol of claim 32 wherein the routing state update messages include state parameters for tail-of-link routers to which the identifiers pertain.
  9. 35. The source routing protocol of claim 32, further comprising distributing labeled routing trees of the routers of the computer network among the routers.
  10. 36. The source routing protocol of claim 35 wherein each router of the computer's network distributes its labeled routing trees to adjacent routers.
  11. 37. The source routing protocol of claim 36 wherein each router of the computer network maintains one labeled routing tree per type of service offered in the network.
  12. 38. The source routing protocol of claim 36 wherein each router generates its labeled routing trees according to a partial topology graph derived from the router's adjacent links and labeled routing trees of neighboring routers.
  13. 39. The source routing protocol of claim 38 wherein the labeled routing trees of a router are generated by applying a path selection algorithm to the partial topology graph, the partial topology graph including a) link-state information of adjacent links and b) link-state information and router-state information of adjacent routers.
  14. 40. The source routing protocol of claim 39 wherein each router maintains a plurality of labeled routing tree (LRT), each LRT corresponding to a type of service of the computer network.
  15. 41. The source routing protocol of claim 40 wherein the labeled routing trees of routers in the computer network are updated in response to receipt of one or more routing state update messages.
  16. 42. The source routing protocol of claim 41 wherein labeled routing trees are updated according to whether an optimum routing approach or a least overhead routing approach is used within the computer network.
  17. 43. The source routing protocol of claim 32 wherein the routing state update message includes performance characteristic information and addressing information for a link of the computer network and a tail-of-link router pertaining to the link.
  18. 44. The source routing protocol of claim 43 wherein the performance characteristics of the link are selected from the group consisting of link delay, link cost, available bandwidth, reliability, and combinations thereof.
  19. 45. The source routing protocol of claim 43 wherein the routing state update message further includes addressing information of the link comprising a local link identifier assigned to the link by a head-of-link router.
US10843616 1999-10-15 2004-05-12 System for communicating labeled routing trees to establish preferred paths and source routes with local identifiers in wireless computer networks Abandoned US20040213167A1 (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
US09418700 US6836463B2 (en) 1999-10-15 1999-10-15 System for communicating labeled routing trees to establish preferred paths and source routes with local identifiers in wireless computer networks
US10843616 US20040213167A1 (en) 1999-10-15 2004-05-12 System for communicating labeled routing trees to establish preferred paths and source routes with local identifiers in wireless computer networks

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US10843616 US20040213167A1 (en) 1999-10-15 2004-05-12 System for communicating labeled routing trees to establish preferred paths and source routes with local identifiers in wireless computer networks

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
US09418700 Continuation US6836463B2 (en) 1999-10-15 1999-10-15 System for communicating labeled routing trees to establish preferred paths and source routes with local identifiers in wireless computer networks

Publications (1)

Publication Number Publication Date
US20040213167A1 true true US20040213167A1 (en) 2004-10-28

Family

ID=23659225

Family Applications (2)

Application Number Title Priority Date Filing Date
US09418700 Active US6836463B2 (en) 1999-10-15 1999-10-15 System for communicating labeled routing trees to establish preferred paths and source routes with local identifiers in wireless computer networks
US10843616 Abandoned US20040213167A1 (en) 1999-10-15 2004-05-12 System for communicating labeled routing trees to establish preferred paths and source routes with local identifiers in wireless computer networks

Family Applications Before (1)

Application Number Title Priority Date Filing Date
US09418700 Active US6836463B2 (en) 1999-10-15 1999-10-15 System for communicating labeled routing trees to establish preferred paths and source routes with local identifiers in wireless computer networks

Country Status (5)

Country Link
US (2) US6836463B2 (en)
EP (1) EP1224776B1 (en)
CA (1) CA2387569C (en)
DE (2) DE60014138T2 (en)
WO (1) WO2001030035A9 (en)

Cited By (29)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020025817A1 (en) * 2000-08-25 2002-02-28 Shuichi Karino Route updating method for micromobility network
US20020042274A1 (en) * 2000-10-10 2002-04-11 Radiant Networks Plc Communications meshes
US20040174844A1 (en) * 2003-03-04 2004-09-09 Samsung Electronics Co., Ltd. System and method of reliably broadcasting data packet under ad-hoc network environment
WO2005027544A1 (en) * 2003-09-09 2005-03-24 Harris Corporation LOAD LEVELING IN MOBILE AD-HOC NETWORKS TO SUPPORT END-TO-END DELAY REDUCTION, QoS AND ENERGY LEVELING
US20050114551A1 (en) * 2003-08-29 2005-05-26 Prithwish Basu Systems and methods for automatically placing nodes in an ad hoc network
US20050163091A1 (en) * 2003-03-25 2005-07-28 Yukiyoshi Nakasaku Communication terminal and communication method
US20050259595A1 (en) * 2004-05-18 2005-11-24 Alcatel Process for generating and updating a hierarchical tree in a MANET multicast routing protocol ad hoc network
US20060187916A1 (en) * 2005-02-23 2006-08-24 Jean-Philippe Vasseur Methods and apparatus based on message transmission times
US20060280172A1 (en) * 2003-09-25 2006-12-14 British Telecommunications Public Ltd., Co. Virtual networks
US20070121558A1 (en) * 2005-11-30 2007-05-31 Robert Beach System and method for data communication in a wireless network
US20070195768A1 (en) * 2004-02-19 2007-08-23 Takeshi Kanazawa Packet routing method and packet routing device
US20080101242A1 (en) * 2006-11-01 2008-05-01 Sadler Jonathan B Intelligent network planning and provisioning tool
US20080126565A1 (en) * 2006-06-30 2008-05-29 Ntt Docomo, Inc. Ad hoc network, node, routing control method and routing control program
US20080159291A1 (en) * 2006-12-28 2008-07-03 Futurewei Technologies, Inc. Method of Detecting Transport Leaks in Hybrid Switching Networks
US20080170583A1 (en) * 2007-01-16 2008-07-17 Futurewei Technologies, Inc. Method of Supporting an Open Provider Backbone Network
US20080244048A1 (en) * 2007-03-27 2008-10-02 Thales Method of assigning network addresses in an in-flight entertainment system
US20080304422A1 (en) * 2007-06-08 2008-12-11 Yigal Bejerano Methods and devices for providing robust nomadic wireless mesh networks using directional antennas
US20090141668A1 (en) * 2006-05-11 2009-06-04 Nortel Networks Limited Media access control protocol for multi-hop network systems and method therefore
US20090238076A1 (en) * 2008-03-21 2009-09-24 Cisco Technology, Inc. METHOD AND APPARATUS TO ENABLE AN IPe DOMAIN THROUGH EIGRP
US7606927B2 (en) 2003-08-27 2009-10-20 Bbn Technologies Corp Systems and methods for forwarding data units in a communications network
US7668083B1 (en) 2003-10-28 2010-02-23 Bbn Technologies Corp. Systems and methods for forwarding data in a communications network
US20100091823A1 (en) * 2008-10-13 2010-04-15 Cisco Technology, Inc. Two-hop Relay for Reducing Distance Vector Routing Information
US20100165885A1 (en) * 2008-12-29 2010-07-01 Industrial Technology Research Institute Wireless communication network and routing method
US7881229B2 (en) * 2003-08-08 2011-02-01 Raytheon Bbn Technologies Corp. Systems and methods for forming an adjacency graph for exchanging network routing data
CN102026332A (en) * 2010-11-26 2011-04-20 无锡源清高新技术研究所有限公司 Routing method for wireless sensor networks in building automation system (BAS)
US7983239B1 (en) 2003-01-07 2011-07-19 Raytheon Bbn Technologies Corp. Systems and methods for constructing a virtual model of a multi-hop, multi-access network
US8139504B2 (en) 2009-04-07 2012-03-20 Raytheon Bbn Technologies Corp. System, device, and method for unifying differently-routed networks using virtual topology representations
US20120096102A1 (en) * 2005-07-08 2012-04-19 Research In Motion Limited Updating availability of an instant messaging contact
US20170207967A1 (en) * 2016-01-20 2017-07-20 Cisco Technology, Inc. Hybrid routing table for reaching unstable destination device in a tree-based network

Families Citing this family (119)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6683865B1 (en) 1999-10-15 2004-01-27 Nokia Wireless Routers, Inc. System for routing and switching in computer networks
US6836463B2 (en) * 1999-10-15 2004-12-28 Nokia Corporation System for communicating labeled routing trees to establish preferred paths and source routes with local identifiers in wireless computer networks
US6980537B1 (en) * 1999-11-12 2005-12-27 Itt Manufacturing Enterprises, Inc. Method and apparatus for communication network cluster formation and transmission of node link status messages with reduced protocol overhead traffic
US7106747B2 (en) * 1999-11-30 2006-09-12 Level 3 Communications, Llc Systems and methods for implementing second-link routing in packet switched networks
WO2001058237A3 (en) * 2000-02-12 2002-06-27 Son Dao Scalable unidirectional routing for mobile ad-hoc networks
US7002949B2 (en) * 2000-06-16 2006-02-21 The Regents Of The University Of California Bandwidth efficient source tracing (BEST) routing protocol for wireless networks
US7058016B1 (en) * 2000-10-12 2006-06-06 Cisco Technology, Inc. Method and system for accelerating route calculation in link state routing protocols
US7720959B2 (en) * 2000-10-17 2010-05-18 Avaya Inc. Method and apparatus for characterizing the quality of a network path
US7349994B2 (en) 2000-10-17 2008-03-25 Avaya Technology Corp. Method and apparatus for coordinating routing parameters via a back-channel communication medium
US7756032B2 (en) 2000-10-17 2010-07-13 Avaya Inc. Method and apparatus for communicating data within measurement traffic
DE60141417D1 (en) 2000-10-17 2010-04-08 Avaya Technology Corp Method and apparatus for optimizing the performance and cost in an internetwork
US8023421B2 (en) 2002-07-25 2011-09-20 Avaya Inc. Method and apparatus for the assessment and optimization of network traffic
US7324647B1 (en) 2000-10-23 2008-01-29 Bbn Technologies Corp. Quantum cryptographic key distribution networks with untrusted switches
US7072650B2 (en) * 2000-11-13 2006-07-04 Meshnetworks, Inc. Ad hoc peer-to-peer mobile radio access system interfaced to the PSTN and cellular networks
US7234001B2 (en) * 2000-12-20 2007-06-19 Nortel Networks Limited Dormant backup link for OSPF network protection
US7116640B2 (en) * 2000-12-22 2006-10-03 Mitchell Paul Tasman Architecture and mechanism for forwarding layer interfacing for networks
US20030149757A1 (en) * 2000-12-27 2003-08-07 Reiko Ueno Identification code management system for home network
US6982960B2 (en) * 2001-03-09 2006-01-03 Motorola, Inc. Protocol for self-organizing network using a logical spanning tree backbone
US7555561B2 (en) * 2001-03-19 2009-06-30 The Aerospace Corporation Cooperative adaptive web caching routing and forwarding web content data broadcasting method
US7171476B2 (en) * 2001-04-20 2007-01-30 Motorola, Inc. Protocol and structure for self-organizing network
US7251222B2 (en) * 2001-05-15 2007-07-31 Motorola, Inc. Procedures for merging the mediation device protocol with a network layer protocol
JP2004531971A (en) * 2001-06-14 2004-10-14 メッシュネットワークス インコーポレーティッドMeshNetworks,Inc. Routing protocol embedded below the Internet Protocol routing layer of software architecture protocol stack in the mobile ad hoc network
FR2829336A1 (en) * 2001-09-04 2003-03-07 Thomson Licensing Sa HiperLAN 2 radio communication gateway unit association procedure
EP1289201A1 (en) * 2001-09-04 2003-03-05 Siemens Aktiengesellschaft Method for routing in a wireless ad-hoc network and netstation for use of the method
RU2221335C2 (en) 2001-11-01 2004-01-10 Общество с ограниченной ответственностью "Алгоритм" Method for data transmission in wireless local-area network
WO2003045019A1 (en) * 2001-11-22 2003-05-30 Telefonaktiebolaget Lm Ericsson A scalable router-based network node
US6836465B2 (en) * 2001-11-29 2004-12-28 Ipsum Networks, Inc. Method and system for path identification in packet networks
US8713185B2 (en) 2001-12-07 2014-04-29 Rockstar Bidco, LP Methods of establishing virtual circuits and of providing a virtual private network service through a shared network, and provider edge device for such network
US7921284B1 (en) 2001-12-12 2011-04-05 Gary Mark Kinghorn Method and system for protecting electronic data in enterprise environment
US7260555B2 (en) 2001-12-12 2007-08-21 Guardian Data Storage, Llc Method and architecture for providing pervasive security to digital assets
US7380120B1 (en) 2001-12-12 2008-05-27 Guardian Data Storage, Llc Secured data format for access control
US7921288B1 (en) 2001-12-12 2011-04-05 Hildebrand Hal S System and method for providing different levels of key security for controlling access to secured items
USRE43906E1 (en) 2001-12-12 2013-01-01 Guardian Data Storage Llc Method and apparatus for securing digital assets
US7565683B1 (en) 2001-12-12 2009-07-21 Weiqing Huang Method and system for implementing changes to security policies in a distributed security system
US7930756B1 (en) 2001-12-12 2011-04-19 Crocker Steven Toye Multi-level cryptographic transformations for securing digital assets
US7921450B1 (en) 2001-12-12 2011-04-05 Klimenty Vainstein Security system using indirect key generation from access rules and methods therefor
US8065713B1 (en) 2001-12-12 2011-11-22 Klimenty Vainstein System and method for providing multi-location access management to secured items
US8006280B1 (en) 2001-12-12 2011-08-23 Hildebrand Hal S Security system for generating keys from access rules in a decentralized manner and methods therefor
US7280545B1 (en) * 2001-12-20 2007-10-09 Nagle Darragh J Complex adaptive routing system and method for a nodal communication network
US7950066B1 (en) 2001-12-21 2011-05-24 Guardian Data Storage, Llc Method and system for restricting use of a clipboard application
US7184421B1 (en) 2001-12-21 2007-02-27 Itt Manufacturing Enterprises, Inc. Method and apparatus for on demand multicast and unicast using controlled flood multicast communications
US6954449B2 (en) * 2002-01-10 2005-10-11 Harris Corporation Method and device for establishing communication links and providing reliable confirm messages in a communication system
US20100238935A1 (en) * 2002-02-25 2010-09-23 Olsonet Communications Corporation Method for Routing Ad-Hoc Signals
US7174382B2 (en) * 2002-04-09 2007-02-06 Hewlett-Packard Development Company, L.P. Interest-based connections in peer-to-peer networks
US20030202494A1 (en) * 2002-04-26 2003-10-30 Drews Paul C. Establishing an ad hoc network
US7142524B2 (en) * 2002-05-01 2006-11-28 Meshnetworks, Inc. System and method for using an ad-hoc routing algorithm based on activity detection in an ad-hoc network
US7099341B2 (en) * 2002-05-03 2006-08-29 International Business Machines Corporation Traffic routing management system using the open shortest path first algorithm
US7492773B2 (en) * 2002-05-23 2009-02-17 Motorola, Inc. Media access control and distributed data processing using mediation devices in an asynchronous network
US7035207B2 (en) * 2002-06-05 2006-04-25 Eka Systems, Inc System and method for forming, maintaining and dynamic reconfigurable routing in an ad-hoc network
EP1510083A1 (en) * 2002-06-06 2005-03-02 MOTOROLA INC., A Corporation of the state of Delaware Protocol and structure for mobile nodes in a self-organizing communication network
US8310935B1 (en) * 2002-06-20 2012-11-13 Signafor, Inc. Communications failure recovery in data packet networks based on fast determination of alternate routes
EP1535184A2 (en) * 2002-06-21 2005-06-01 Nexthop Technologies, Inc. Fibonacci heap for use with internet routing protocols
US7457416B1 (en) 2002-07-17 2008-11-25 Bbn Technologies Corp. Key distribution center for quantum cryptographic key distribution networks
US6735417B2 (en) * 2002-08-15 2004-05-11 Motorola, Inc. Method and apparatus for relaying information in an AD-HOC network
US20040203797A1 (en) * 2002-09-05 2004-10-14 Jeremy Burr Method and apparatus for communications using distributed services in a mobile ad hoc network (MANET)
US7613796B2 (en) * 2002-09-11 2009-11-03 Microsoft Corporation System and method for creating improved overlay network with an efficient distributed data structure
US8176334B2 (en) 2002-09-30 2012-05-08 Guardian Data Storage, Llc Document security system that permits external users to gain access to secured files
US7627126B1 (en) 2002-10-15 2009-12-01 Bbn Technologies Corp. Systems and methods for implementing path length control for quantum cryptographic systems
US20060222180A1 (en) * 2002-10-15 2006-10-05 Elliott Brig B Chip-scale transmitter for quantum cryptography
JP4020753B2 (en) * 2002-10-25 2007-12-12 富士通株式会社 Ring switching method
JP4167226B2 (en) 2002-10-30 2008-10-15 テレフオンアクチーボラゲット エル エム エリクソン(パブル) Method for use in the ad-hoc mode wlan system
US7580394B2 (en) * 2002-11-27 2009-08-25 Nokia Corporation System and method for collision-free transmission scheduling in a network
US7236597B2 (en) * 2002-12-20 2007-06-26 Bbn Technologies Corp. Key transport in quantum cryptographic networks
US7460670B1 (en) 2002-12-20 2008-12-02 Bbn Technologies Corp. Systems and methods for managing quantum cryptographic networks
US8463940B2 (en) * 2003-01-31 2013-06-11 Hewlett-Packard Development Company, L.P. Method of indicating a path in a computer network
JP4027818B2 (en) 2003-02-21 2007-12-26 株式会社エヌ・ティ・ティ・ドコモ Multihop communication system, a radio control station, a radio station and a multi-hop communication method
US7430295B1 (en) 2003-03-21 2008-09-30 Bbn Technologies Corp. Simple untrusted network for quantum cryptography
US7706535B1 (en) 2003-03-21 2010-04-27 Bbn Technologies Corp. Systems and methods for implementing routing protocols and algorithms for quantum cryptographic key transport
US20040213198A1 (en) * 2003-04-23 2004-10-28 Hamid Mahmood Routing quality-of-service traffic in a wireless system
US7539739B2 (en) * 2003-05-21 2009-05-26 Panasonic Corporation Self-configuring network system and routers for use therein
US8707034B1 (en) 2003-05-30 2014-04-22 Intellectual Ventures I Llc Method and system for using remote headers to secure electronic files
JP2005086460A (en) 2003-09-09 2005-03-31 Nec Corp Device and method for designing path, and program
US8127366B2 (en) 2003-09-30 2012-02-28 Guardian Data Storage, Llc Method and apparatus for transitioning between states of security policies used to secure electronic documents
US7703140B2 (en) 2003-09-30 2010-04-20 Guardian Data Storage, Llc Method and system for securing digital assets using process-driven security policies
US7469143B2 (en) * 2003-10-07 2008-12-23 Microsoft Corporation Model and method for computing performance bounds in multi-hop wireless networks
US7702909B2 (en) * 2003-12-22 2010-04-20 Klimenty Vainstein Method and system for validating timestamps
US7765303B2 (en) * 2004-02-13 2010-07-27 Jean Geoffrion Method and apparatus for providing data over a dynamic wireless network
JP4425863B2 (en) * 2004-02-18 2010-03-03 株式会社エヌ・ティ・ティ・ドコモ Packet forwarding system and a radio base station
US7515716B1 (en) 2004-02-26 2009-04-07 Bbn Technologies Corp. Systems and methods for reserving cryptographic key material
US7697693B1 (en) 2004-03-09 2010-04-13 Bbn Technologies Corp. Quantum cryptography with multi-party randomness
JP4421978B2 (en) * 2004-09-03 2010-02-24 富士通株式会社 Delay guarantee path setting system
KR101111099B1 (en) 2004-09-09 2012-02-17 아바야 테크놀러지 코퍼레이션 Methods of and systems for network traffic security
US7822801B2 (en) * 2004-10-14 2010-10-26 International Business Machines Corporation Subscription propagation in a high performance highly available content-based publish/subscribe system
US7643483B2 (en) * 2004-11-24 2010-01-05 Microsoft Corporation System and method for using a hop limited cast for internet egress point selection
US7715395B2 (en) * 2004-11-24 2010-05-11 Microsoft Corporation System and method for expanding the range of a mesh network
US7649899B2 (en) * 2004-11-29 2010-01-19 Microsoft Corporation System and method for dynamic egress routing through a single default gateway in a mesh network
KR100703726B1 (en) * 2004-12-11 2007-04-05 삼성전자주식회사 Method for managing neighbor node and determining routing path in mobile ad hoc network, and network apparatus thereof
US20060140123A1 (en) * 2004-12-29 2006-06-29 Intel Corporation Methods and apparatus for distributing link-state information associated with a wireless mesh network
US8085672B2 (en) * 2005-01-28 2011-12-27 Honeywell International Inc. Wireless routing implementation
EP1938203A4 (en) * 2005-02-26 2008-12-17 Coco Communications Corp Naming system layer
US7995569B2 (en) * 2005-04-01 2011-08-09 Nortel Networks Limited Virtual routers for GMPLS networks
US8341289B2 (en) * 2005-05-17 2012-12-25 Rajant Corporation System and method for communication in a wireless mobile ad-hoc network
US8670307B2 (en) * 2005-10-24 2014-03-11 Qualcomm Incorporated Flow based fair scheduling in multi-hop wireless networks
KR100718097B1 (en) * 2005-10-25 2007-05-16 삼성전자주식회사 Address management and routing method for Wireless Personal Area Network
US20070130455A1 (en) * 2005-12-06 2007-06-07 Elliott Brig B Series encryption in a quantum cryptographic system
JP4940238B2 (en) * 2005-12-08 2012-05-30 パナソニック株式会社 Routing loop detection control unit
US20070133798A1 (en) * 2005-12-14 2007-06-14 Elliott Brig B Quantum cryptography on a multi-drop optical network
US8082443B2 (en) * 2006-01-09 2011-12-20 Bbnt Solutions Llc. Pedigrees for quantum cryptography
KR100755706B1 (en) * 2006-01-17 2007-09-05 삼성전자주식회사 Method and apparatus for providing distributed service composition model for ad hoc networks
US7756035B2 (en) * 2006-01-31 2010-07-13 Nortel Networks Limited Planning routes and allocating identifiers to routes in a managed frame-forwarding network
KR101255857B1 (en) * 2006-03-16 2013-04-17 리서치 파운데이션 오브 더 시티 유니버시티 오브 뉴욕 Tree-guided distributed link state routing method
US7570927B2 (en) 2006-06-16 2009-08-04 Motorola, Inc. Decentralized wireless communication network and method having a plurality of devices
US8094555B2 (en) * 2006-11-27 2012-01-10 Cisco Technology, Inc. Dynamic weighted-fair load-balancing
US8203971B2 (en) * 2007-01-12 2012-06-19 Samsung Electronics Co., Ltd. Group communication in a mobile ad-hoc network
US7962595B1 (en) * 2007-03-20 2011-06-14 Emc Corporation Method and apparatus for diagnosing host to storage data path loss due to FibreChannel switch fabric splits
US20080240116A1 (en) * 2007-03-26 2008-10-02 Motorola, Inc. Method and Apparatus for Determining the Locating of Nodes in a Wireless Network
US20090303888A1 (en) * 2007-05-03 2009-12-10 Honeywell International Inc. Method and system for optimizing wireless networks through feedback and adaptation
US8200270B2 (en) * 2007-08-20 2012-06-12 Honeywell International Inc. Method for adusting power at a node
US7899483B2 (en) * 2007-10-08 2011-03-01 Honeywell International Inc. Method and system for performing distributed outer loop power control in wireless communication networks
US8107387B2 (en) * 2008-03-25 2012-01-31 Honeywell International Inc. Method to operate a wireless network having a predictable and stable performance
US8443189B2 (en) 2008-10-24 2013-05-14 International Business Machines Corporation Trust event notification and actions based on thresholds and associated trust metadata scores
US20100106558A1 (en) * 2008-10-24 2010-04-29 International Business Machines Corporation Trust Index Framework for Providing Data and Associated Trust Metadata
US8290960B2 (en) * 2008-10-24 2012-10-16 International Business Machines Corporation Configurable trust context assignable to facts and associated trust metadata
US8325746B2 (en) * 2009-10-08 2012-12-04 University Of Maryland, College Park Topology selection and broadcast method for rule-based link state routing
US8276157B2 (en) 2009-10-23 2012-09-25 International Business Machines Corporation Monitoring information assets and information asset topologies
US20110216696A1 (en) * 2010-03-08 2011-09-08 Giorgio Lippolis Distributed fluid network system and method
DE102013204042A1 (en) * 2013-03-08 2014-09-11 Siemens Aktiengesellschaft A method of transmitting data packets in a data network from a plurality of network nodes
US9756549B2 (en) 2014-03-14 2017-09-05 goTenna Inc. System and method for digital communication between computing devices
US20160301574A1 (en) * 2015-04-10 2016-10-13 Xerox Corporation Method and system for determining reachability between one or more nodes in a graph

Citations (45)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4466060A (en) * 1982-02-11 1984-08-14 At&T Bell Telephone Laboratories, Incorporated Message routing in a computer network
US4987536A (en) * 1988-05-12 1991-01-22 Codex Corporation Communication system for sending an identical routing tree to all connected nodes to establish a shortest route and transmitting messages thereafter
US5115433A (en) * 1989-07-18 1992-05-19 Metricom, Inc. Method and system for routing packets in a packet communication network
US5231634A (en) * 1991-12-18 1993-07-27 Proxim, Inc. Medium access protocol for wireless lans
US5233604A (en) * 1992-04-28 1993-08-03 International Business Machines Corporation Methods and apparatus for optimum path selection in packet transmission networks
US5487064A (en) * 1993-06-03 1996-01-23 International Business Machines Corporation Network layer packet structure
US5509123A (en) * 1994-03-22 1996-04-16 Cabletron Systems, Inc. Distributed autonomous object architectures for network layer routing
US5515508A (en) * 1993-12-17 1996-05-07 Taligent, Inc. Client server system and method of operation including a dynamically configurable protocol stack
US5548578A (en) * 1993-11-05 1996-08-20 Fujitsu Limited LAN-to-LAN communication method, and LAN-to-LAN connecting unit
US5557748A (en) * 1995-02-03 1996-09-17 Intel Corporation Dynamic network configuration
US5572528A (en) * 1995-03-20 1996-11-05 Novell, Inc. Mobile networking method and apparatus
US5596719A (en) * 1993-06-28 1997-01-21 Lucent Technologies Inc. Method and apparatus for routing and link metric assignment in shortest path networks
US5600644A (en) * 1995-03-10 1997-02-04 At&T Method and apparatus for interconnecting LANs
US5608721A (en) * 1995-04-03 1997-03-04 Motorola, Inc. Communications network and method which implement diversified routing
US5633866A (en) * 1995-11-17 1997-05-27 Bay Networks, Inc. Method and apparatus for routing packets in networks having connection-oriented subnetworks
US5638371A (en) * 1995-06-27 1997-06-10 Nec Usa, Inc. Multiservices medium access control protocol for wireless ATM system
US5649108A (en) * 1993-11-30 1997-07-15 Nec Corporation Combined progressive and source routing control for connection-oriented communications networks
US5652751A (en) * 1996-03-26 1997-07-29 Hazeltine Corporation Architecture for mobile radio networks with dynamically changing topology using virtual subnets
US5682382A (en) * 1995-09-05 1997-10-28 Massachusetts Institute Of Technology Scalable, self-organizing packet radio network having decentralized channel management providing collision-free packet transfer
US5706291A (en) * 1994-02-25 1998-01-06 Nokia Telecommunications Oy Method and apparatus for connecting two messaging systems having differing synchronizations one of which is message-based
US5717687A (en) * 1994-09-07 1998-02-10 U.S. Philips Corporation Data communication system with adaptive routing, and switching node intended to be used in such a system
US5721725A (en) * 1995-10-30 1998-02-24 Xerox Corporation Protocol for channel access in wireless or network data communication
US5721819A (en) * 1995-05-05 1998-02-24 Silicon Graphics Corporation Programmable, distributed network routing
US5737318A (en) * 1995-12-27 1998-04-07 Philips Electronics North America Corporation Method for initializing a wireless, packet-hopping network
US5805593A (en) * 1995-09-26 1998-09-08 At&T Corp Routing method for setting up a service between an origination node and a destination node in a connection-communications network
US5845086A (en) * 1994-09-29 1998-12-01 Siemens Aktiengesellschaft System for addressing a destination station using only address of a network junction and station link identifier in a network with plurality of segments
US5854899A (en) * 1996-05-09 1998-12-29 Bay Networks, Inc. Method and apparatus for managing virtual circuits and routing packets in a network/subnetwork environment
US5872773A (en) * 1996-05-17 1999-02-16 Lucent Technologies Inc. Virtual trees routing protocol for an ATM-based mobile network
US5881246A (en) * 1996-06-12 1999-03-09 Bay Networks, Inc. System for generating explicit routing advertisements to specify a selected path through a connectionless network to a destination by a specific router
US5896379A (en) * 1996-08-26 1999-04-20 Motorola, Inc. Network node for packet switching with selective data processing and method therefor
US5918016A (en) * 1997-06-10 1999-06-29 Texas Instruments Incorporated System with program for automating protocol assignments when newly connected to varing computer network configurations
US5926463A (en) * 1997-10-06 1999-07-20 3Com Corporation Method and apparatus for viewing and managing a configuration of a computer network
US5933425A (en) * 1995-12-04 1999-08-03 Nec Corporation Source routing for connection-oriented network with repeated call attempts for satisfying user-specified QOS parameters
US5964841A (en) * 1997-03-03 1999-10-12 Cisco Technology, Inc. Technique for handling forwarding transients with link state routing protocol
US5999536A (en) * 1996-11-29 1999-12-07 Anritsu Corporation Router for high-speed packet communication between terminal apparatuses in different LANs
US6006272A (en) * 1998-02-23 1999-12-21 Lucent Technologies Inc. Method for network address translation
US6026303A (en) * 1996-11-07 2000-02-15 Nec Corporation Method for determining optimal parent terminal and ad hoc network system for the same
US6108314A (en) * 1998-08-31 2000-08-22 Motorola, Inc. Method, subscriber device, wireless router, and communication system efficiently utilizing the receive/transmit switching time
US6243585B1 (en) * 1998-05-22 2001-06-05 Lucent Technologies, Inc. Wireless telecommunications network whose facilities are mobile and whose topology is dynamic
US6246669B1 (en) * 1997-11-28 2001-06-12 Cisco Technology, Inc. Method and system for optimizing connection set-up operations in a high speed digital network
US6301244B1 (en) * 1998-12-11 2001-10-09 Nortel Networks Limited QoS-oriented one-to-all route selection method for communication networks
US6324162B1 (en) * 1998-06-03 2001-11-27 At&T Corp. Path-based restoration mesh networks
US6549513B1 (en) * 1999-10-12 2003-04-15 Alcatel Method and apparatus for fast distributed restoration of a communication network
US6621798B1 (en) * 1999-04-21 2003-09-16 Lucent Technologies Inc. Method to sequence changes for IP network configuration
US6836463B2 (en) * 1999-10-15 2004-12-28 Nokia Corporation System for communicating labeled routing trees to establish preferred paths and source routes with local identifiers in wireless computer networks

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5309437A (en) 1990-06-29 1994-05-03 Digital Equipment Corporation Bridge-like internet protocol router
US5210753A (en) 1991-10-31 1993-05-11 International Business Machines Corporation Robust scheduling mechanm for efficient band-width usage in muliticell wireless local networks
ES2165438T3 (en) 1994-12-19 2002-03-16 Salbu Res & Dev Pty Ltd Radio networks multiple packet jumps.
GB2313254C (en) 1996-05-17 2005-03-22 Motorola Ltd Method and apparatus for transmitting data
EP0841763B1 (en) 1996-10-25 2003-12-10 Nokia Corporation Method for radio resource control
CA2321918C (en) 1998-03-11 2008-07-08 Swisscom Ag Routing method for wireless and distributed systems
CA2356947A1 (en) 1998-12-23 2000-07-06 David A. Beyer A unified routing scheme for ad-hoc internetworking

Patent Citations (46)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4466060A (en) * 1982-02-11 1984-08-14 At&T Bell Telephone Laboratories, Incorporated Message routing in a computer network
US4987536A (en) * 1988-05-12 1991-01-22 Codex Corporation Communication system for sending an identical routing tree to all connected nodes to establish a shortest route and transmitting messages thereafter
US5115433A (en) * 1989-07-18 1992-05-19 Metricom, Inc. Method and system for routing packets in a packet communication network
US5231634B1 (en) * 1991-12-18 1996-04-02 Proxim Inc Medium access protocol for wireless lans
US5231634A (en) * 1991-12-18 1993-07-27 Proxim, Inc. Medium access protocol for wireless lans
US5233604A (en) * 1992-04-28 1993-08-03 International Business Machines Corporation Methods and apparatus for optimum path selection in packet transmission networks
US5487064A (en) * 1993-06-03 1996-01-23 International Business Machines Corporation Network layer packet structure
US5596719A (en) * 1993-06-28 1997-01-21 Lucent Technologies Inc. Method and apparatus for routing and link metric assignment in shortest path networks
US5548578A (en) * 1993-11-05 1996-08-20 Fujitsu Limited LAN-to-LAN communication method, and LAN-to-LAN connecting unit
US5649108A (en) * 1993-11-30 1997-07-15 Nec Corporation Combined progressive and source routing control for connection-oriented communications networks
US5515508A (en) * 1993-12-17 1996-05-07 Taligent, Inc. Client server system and method of operation including a dynamically configurable protocol stack
US5706291A (en) * 1994-02-25 1998-01-06 Nokia Telecommunications Oy Method and apparatus for connecting two messaging systems having differing synchronizations one of which is message-based
US5509123A (en) * 1994-03-22 1996-04-16 Cabletron Systems, Inc. Distributed autonomous object architectures for network layer routing
US5717687A (en) * 1994-09-07 1998-02-10 U.S. Philips Corporation Data communication system with adaptive routing, and switching node intended to be used in such a system
US5845086A (en) * 1994-09-29 1998-12-01 Siemens Aktiengesellschaft System for addressing a destination station using only address of a network junction and station link identifier in a network with plurality of segments
US5557748A (en) * 1995-02-03 1996-09-17 Intel Corporation Dynamic network configuration
US5600644A (en) * 1995-03-10 1997-02-04 At&T Method and apparatus for interconnecting LANs
US5572528A (en) * 1995-03-20 1996-11-05 Novell, Inc. Mobile networking method and apparatus
US5608721A (en) * 1995-04-03 1997-03-04 Motorola, Inc. Communications network and method which implement diversified routing
US5721819A (en) * 1995-05-05 1998-02-24 Silicon Graphics Corporation Programmable, distributed network routing
US5638371A (en) * 1995-06-27 1997-06-10 Nec Usa, Inc. Multiservices medium access control protocol for wireless ATM system
US5682382A (en) * 1995-09-05 1997-10-28 Massachusetts Institute Of Technology Scalable, self-organizing packet radio network having decentralized channel management providing collision-free packet transfer
US5805593A (en) * 1995-09-26 1998-09-08 At&T Corp Routing method for setting up a service between an origination node and a destination node in a connection-communications network
US5721725A (en) * 1995-10-30 1998-02-24 Xerox Corporation Protocol for channel access in wireless or network data communication
US5633866A (en) * 1995-11-17 1997-05-27 Bay Networks, Inc. Method and apparatus for routing packets in networks having connection-oriented subnetworks
US5933425A (en) * 1995-12-04 1999-08-03 Nec Corporation Source routing for connection-oriented network with repeated call attempts for satisfying user-specified QOS parameters
US5737318A (en) * 1995-12-27 1998-04-07 Philips Electronics North America Corporation Method for initializing a wireless, packet-hopping network
US5652751A (en) * 1996-03-26 1997-07-29 Hazeltine Corporation Architecture for mobile radio networks with dynamically changing topology using virtual subnets
US5854899A (en) * 1996-05-09 1998-12-29 Bay Networks, Inc. Method and apparatus for managing virtual circuits and routing packets in a network/subnetwork environment
US5872773A (en) * 1996-05-17 1999-02-16 Lucent Technologies Inc. Virtual trees routing protocol for an ATM-based mobile network
US5881246A (en) * 1996-06-12 1999-03-09 Bay Networks, Inc. System for generating explicit routing advertisements to specify a selected path through a connectionless network to a destination by a specific router
US5896379A (en) * 1996-08-26 1999-04-20 Motorola, Inc. Network node for packet switching with selective data processing and method therefor
US6026303A (en) * 1996-11-07 2000-02-15 Nec Corporation Method for determining optimal parent terminal and ad hoc network system for the same
US5999536A (en) * 1996-11-29 1999-12-07 Anritsu Corporation Router for high-speed packet communication between terminal apparatuses in different LANs
US5964841A (en) * 1997-03-03 1999-10-12 Cisco Technology, Inc. Technique for handling forwarding transients with link state routing protocol
US5918016A (en) * 1997-06-10 1999-06-29 Texas Instruments Incorporated System with program for automating protocol assignments when newly connected to varing computer network configurations
US5926463A (en) * 1997-10-06 1999-07-20 3Com Corporation Method and apparatus for viewing and managing a configuration of a computer network
US6246669B1 (en) * 1997-11-28 2001-06-12 Cisco Technology, Inc. Method and system for optimizing connection set-up operations in a high speed digital network
US6006272A (en) * 1998-02-23 1999-12-21 Lucent Technologies Inc. Method for network address translation
US6243585B1 (en) * 1998-05-22 2001-06-05 Lucent Technologies, Inc. Wireless telecommunications network whose facilities are mobile and whose topology is dynamic
US6324162B1 (en) * 1998-06-03 2001-11-27 At&T Corp. Path-based restoration mesh networks
US6108314A (en) * 1998-08-31 2000-08-22 Motorola, Inc. Method, subscriber device, wireless router, and communication system efficiently utilizing the receive/transmit switching time
US6301244B1 (en) * 1998-12-11 2001-10-09 Nortel Networks Limited QoS-oriented one-to-all route selection method for communication networks
US6621798B1 (en) * 1999-04-21 2003-09-16 Lucent Technologies Inc. Method to sequence changes for IP network configuration
US6549513B1 (en) * 1999-10-12 2003-04-15 Alcatel Method and apparatus for fast distributed restoration of a communication network
US6836463B2 (en) * 1999-10-15 2004-12-28 Nokia Corporation System for communicating labeled routing trees to establish preferred paths and source routes with local identifiers in wireless computer networks

Cited By (54)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020025817A1 (en) * 2000-08-25 2002-02-28 Shuichi Karino Route updating method for micromobility network
US7158791B2 (en) * 2000-08-25 2007-01-02 Nec Corporation Route updating method for micromobility network
US20020042274A1 (en) * 2000-10-10 2002-04-11 Radiant Networks Plc Communications meshes
US20070189191A1 (en) * 2000-10-10 2007-08-16 Stephen Ades Communications Meshes
US7733797B2 (en) 2000-10-10 2010-06-08 Intel Corporation Communications meshes
US7286489B2 (en) * 2000-10-10 2007-10-23 Intel Corporation Communications meshes
US7983239B1 (en) 2003-01-07 2011-07-19 Raytheon Bbn Technologies Corp. Systems and methods for constructing a virtual model of a multi-hop, multi-access network
US7894381B2 (en) * 2003-03-04 2011-02-22 Samsung Electronics Co., Ltd. System and method of reliably broadcasting data packet under ad-hoc network environment
US20040174844A1 (en) * 2003-03-04 2004-09-09 Samsung Electronics Co., Ltd. System and method of reliably broadcasting data packet under ad-hoc network environment
US7397771B2 (en) * 2003-03-25 2008-07-08 Fujitsu Limited Communication terminal and communication method
US20050163091A1 (en) * 2003-03-25 2005-07-28 Yukiyoshi Nakasaku Communication terminal and communication method
US7881229B2 (en) * 2003-08-08 2011-02-01 Raytheon Bbn Technologies Corp. Systems and methods for forming an adjacency graph for exchanging network routing data
US8103792B2 (en) 2003-08-27 2012-01-24 Raytheon Bbn Technologies Corp. Systems and methods for forwarding data units in a communications network
US7606927B2 (en) 2003-08-27 2009-10-20 Bbn Technologies Corp Systems and methods for forwarding data units in a communications network
US8166204B2 (en) 2003-08-29 2012-04-24 Raytheon Bbn Technologies Corp. Systems and methods for automatically placing nodes in an ad hoc network
US20050114551A1 (en) * 2003-08-29 2005-05-26 Prithwish Basu Systems and methods for automatically placing nodes in an ad hoc network
WO2005027544A1 (en) * 2003-09-09 2005-03-24 Harris Corporation LOAD LEVELING IN MOBILE AD-HOC NETWORKS TO SUPPORT END-TO-END DELAY REDUCTION, QoS AND ENERGY LEVELING
KR100777895B1 (en) * 2003-09-09 2007-11-21 해리스 코포레이션 Method for routing message data and mobile node in mobile ad-hoc networks
US20060280172A1 (en) * 2003-09-25 2006-12-14 British Telecommunications Public Ltd., Co. Virtual networks
US7787395B2 (en) * 2003-09-25 2010-08-31 British Telecommunications Plc Virtual networks
US7668083B1 (en) 2003-10-28 2010-02-23 Bbn Technologies Corp. Systems and methods for forwarding data in a communications network
US20070195768A1 (en) * 2004-02-19 2007-08-23 Takeshi Kanazawa Packet routing method and packet routing device
US20050259595A1 (en) * 2004-05-18 2005-11-24 Alcatel Process for generating and updating a hierarchical tree in a MANET multicast routing protocol ad hoc network
US7602738B2 (en) * 2004-05-18 2009-10-13 Alcatel Process for generating and updating a hierarchical tree in a MANET multicast routing protocol ad hoc network
US7471636B2 (en) * 2005-02-23 2008-12-30 Cisco Technology, Inc. Methods and apparatus based on message transmission times
US20060187916A1 (en) * 2005-02-23 2006-08-24 Jean-Philippe Vasseur Methods and apparatus based on message transmission times
US20120096102A1 (en) * 2005-07-08 2012-04-19 Research In Motion Limited Updating availability of an instant messaging contact
US20070121558A1 (en) * 2005-11-30 2007-05-31 Robert Beach System and method for data communication in a wireless network
US8204039B2 (en) * 2005-11-30 2012-06-19 Symbol Technologies, Inc. System and method for data communication in a wireless network
US20090141668A1 (en) * 2006-05-11 2009-06-04 Nortel Networks Limited Media access control protocol for multi-hop network systems and method therefore
US8576882B2 (en) * 2006-05-11 2013-11-05 Blackberry Limited Media access control protocol for multi-hop network systems and method therefore
US20080126565A1 (en) * 2006-06-30 2008-05-29 Ntt Docomo, Inc. Ad hoc network, node, routing control method and routing control program
US7970933B2 (en) * 2006-06-30 2011-06-28 Ntt Docomo, Inc. Ad hoc network, node, routing control method and routing control program
US20080101242A1 (en) * 2006-11-01 2008-05-01 Sadler Jonathan B Intelligent network planning and provisioning tool
US8488471B2 (en) * 2006-11-01 2013-07-16 Tellabs Operations, Inc. Intelligent network planning and provisioning tool
US20080159290A1 (en) * 2006-12-28 2008-07-03 Futurewei Technologies, Inc. Method of Preventing Transport Leaks in Hybrid Switching Networks
US20080159291A1 (en) * 2006-12-28 2008-07-03 Futurewei Technologies, Inc. Method of Detecting Transport Leaks in Hybrid Switching Networks
US8149837B2 (en) 2007-01-16 2012-04-03 Futurewei Technologies, Inc. Method of supporting an open provider backbone network
US8605735B2 (en) 2007-01-16 2013-12-10 Futurewei Technologies, Inc. Method of supporting an open provider backbone network
US20080170583A1 (en) * 2007-01-16 2008-07-17 Futurewei Technologies, Inc. Method of Supporting an Open Provider Backbone Network
US20080244048A1 (en) * 2007-03-27 2008-10-02 Thales Method of assigning network addresses in an in-flight entertainment system
US7921192B2 (en) * 2007-03-27 2011-04-05 Thales Method of assigning network addresses in an in-flight entertainment system
US8107399B2 (en) * 2007-06-08 2012-01-31 Alcatel-Lucent Usa Inc. Methods and devices for providing robust nomadic wireless mesh networks using directional antennas
US20080304422A1 (en) * 2007-06-08 2008-12-11 Yigal Bejerano Methods and devices for providing robust nomadic wireless mesh networks using directional antennas
US20090238076A1 (en) * 2008-03-21 2009-09-24 Cisco Technology, Inc. METHOD AND APPARATUS TO ENABLE AN IPe DOMAIN THROUGH EIGRP
US7940668B2 (en) 2008-03-21 2011-05-10 Cisco Technology, Inc. Method and apparatus to enable an IPe domain through EIGRP
US20100091823A1 (en) * 2008-10-13 2010-04-15 Cisco Technology, Inc. Two-hop Relay for Reducing Distance Vector Routing Information
US7978612B2 (en) * 2008-10-13 2011-07-12 Cisco Technology, Inc. Two-hop relay for reducing distance vector routing information
US20100165885A1 (en) * 2008-12-29 2010-07-01 Industrial Technology Research Institute Wireless communication network and routing method
US8537719B2 (en) * 2008-12-29 2013-09-17 Industrial Technology Research Institute Wireless communication network and routing method
US8139504B2 (en) 2009-04-07 2012-03-20 Raytheon Bbn Technologies Corp. System, device, and method for unifying differently-routed networks using virtual topology representations
CN102026332A (en) * 2010-11-26 2011-04-20 无锡源清高新技术研究所有限公司 Routing method for wireless sensor networks in building automation system (BAS)
US10009256B2 (en) * 2016-01-20 2018-06-26 Cisco Technology, Inc. Hybrid routing table for reaching unstable destination device in a tree-based network
US20170207967A1 (en) * 2016-01-20 2017-07-20 Cisco Technology, Inc. Hybrid routing table for reaching unstable destination device in a tree-based network

Also Published As

Publication number Publication date Type
DE60014138T2 (en) 2005-10-13 grant
DE60014138D1 (en) 2004-10-28 grant
WO2001030035A3 (en) 2001-12-06 application
US20030165117A1 (en) 2003-09-04 application
WO2001030035A9 (en) 2002-08-01 application
EP1224776B1 (en) 2004-09-22 grant
WO2001030035A2 (en) 2001-04-26 application
CA2387569C (en) 2007-09-11 grant
US6836463B2 (en) 2004-12-28 grant
CA2387569A1 (en) 2001-04-26 application
EP1224776A2 (en) 2002-07-24 application

Similar Documents

Publication Publication Date Title
Marina et al. Ad hoc on‐demand multipath distance vector routing
Xu et al. A heterogeneous routing protocol based on a new stable clustering scheme
Haas et al. Wireless ad hoc networks
Marina et al. Routing performance in the presence of unidirectional links in multihop wireless networks
Wu et al. Performance study of a multipath routing method for wireless mobile ad hoc networks
Jacquet Optimized link state routing protocol (olsr)
Clausen et al. Optimized link state routing protocol (OLSR)
Campista et al. Routing metrics and protocols for wireless mesh networks
Raju et al. A comparison of on-demand and table driven routing for ad-hoc wireless networks
Yang et al. Designing routing metrics for mesh networks
US7428221B2 (en) Arrangement for providing network prefix information from attached mobile routers to a clusterhead in a tree-based ad hoc mobile network
US6667957B1 (en) Adaptive routing method for a dynamic network
US7007102B2 (en) Admission control in a mobile ad hoc network
Das et al. Simulation‐based performance evaluation of routing protocols for mobile ad hoc networks
Misra Routing protocols for ad hoc mobile wireless networks
US5987011A (en) Routing method for Ad-Hoc mobile networks
US7002949B2 (en) Bandwidth efficient source tracing (BEST) routing protocol for wireless networks
Ducatelle et al. Using ant agents to combine reactive and proactive strategies for routing in mobile ad-hoc networks
Di Caro et al. AntHocNet: an ant-based hybrid routing algorithm for mobile ad hoc networks
Beijar Zone routing protocol (ZRP)
US5926101A (en) Method and apparatus for routing messages in a network of nodes with minimal resources
Clausen et al. RFC 3626: Optimized link state routing protocol (OLSR)
US6894985B2 (en) Monitoring link quality in a mobile ad hoc network
Lee et al. A simulation study of table-driven and on-demand routing protocols for mobile ad hoc networks
Clausen et al. A critical evaluation of the IPv6 routing protocol for low power and lossy networks (RPL)

Legal Events

Date Code Title Description
AS Assignment

Owner name: NOKIA CORPORATION, FINLAND

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:NOKIA INC;REEL/FRAME:020540/0061

Effective date: 20070326

AS Assignment

Owner name: NOKIA SIEMENS NETWORKS OY, FINLAND

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:NOKIA CORPORATION;REEL/FRAME:020550/0521

Effective date: 20070907