CA2187926A1 - Method and system for routing packets in a packet communication network using locally constructed routine tables - Google Patents
Method and system for routing packets in a packet communication network using locally constructed routine tablesInfo
- Publication number
- CA2187926A1 CA2187926A1 CA002187926A CA2187926A CA2187926A1 CA 2187926 A1 CA2187926 A1 CA 2187926A1 CA 002187926 A CA002187926 A CA 002187926A CA 2187926 A CA2187926 A CA 2187926A CA 2187926 A1 CA2187926 A1 CA 2187926A1
- Authority
- CA
- Canada
- Prior art keywords
- node
- packet
- ultimate destination
- routing
- destination node
- 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
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/30—Peripheral units, e.g. input or output ports
- H04L49/3081—ATM peripheral units, e.g. policing, insertion or extraction
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/04—Selecting arrangements for multiplex systems for time-division multiplexing
- H04Q11/0428—Integrated services digital network, i.e. systems for transmission of different types of digitised signals, e.g. speech, data, telecentral, television signals
- H04Q11/0478—Provisions for broadband connections
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5601—Transfer mode dependent, e.g. ATM
- H04L2012/5619—Network Node Interface, e.g. tandem connections, transit switching
Abstract
In a packet communication system, wherein nodes are assigned an absolute coordinate-based address and muting decisions are made at each node (S2, S7) without the use of directory-based routing, routing decisions made for a particular packet with an ultimate destination are stored at each node so that the next packet sent by that node to that same ultimate destination can be forwarded in accordance with the previous routing decision made for that destination. Routing decisions are stored locally at each node in a routing table (S6, S12). In one embodiment, nodes also store routing information about the source node for a packet so that when a return packet is received for the original source, the relay node will not have to make a routing decision.
Description
WO 95128780 P~,ll~Ju,v, '~'78 21 ~7926 METHOD AND SYSTEM FOR ROUTING PACKETS IN A PACKET
COMMUNICA~rION NETWORK USING 10CAT,TY CON~l~ucl~s ROUIrING TI~RT.T`.'::
BACKGROIJND OF THE INVENTION
The invention relates generally to a method f or routing data packets through a packet communication network 15 and more specifically to a method for routing data packets in a network where the best paths between nodes are stored in a routing table generated at each node.
Packet rommlln; rAtion is a form of data - i c~tion whereby segments or packets of data are routed with error 20 rh~ k;n~ and confirmation of receipt. Packets may be transmitted directly between a source node and a destination node or may be relayed via a number of relay nodes. Several methods of data packet routing are known.
One method is known as directory-based routing.
25 According to this method the address in the header of a packet is used as an index to a directory of packet routing lists stored in a source node. A packet routing list consists of an ordered list of packet node identifiers or call signs that represent a complete transmission path from the source node to 30 the destination node. Once the packet is sent from the source node, its path through the network is determined by the packet routing list that was stored in the source node. Packet routing lists must be prepared with knowledge about the connectivity of each node in the network, and in a typical 35 directory-based routing scheme, each node must maintain a complete routing list for every other node in the network to which it sends packets. Directory-based routing schemes require continued maintenance and communication of network interconnection inf ormation employed in the directory . Each 40 of these functions drains network resources and this can - =~
W095/28780 r._~u~ C~C~8 2 1 8 7~26 severely reduce performance in a large network. However, directory-based routing technigues have the advantage of permitting optimization of routing for a wide variety of network parameters, ;nrlu~lin~ data delay, tllL~uyllyuL~
S ral ;Ahil ;ty, priority and the like.
Another ba6ic family of routing techniques are the non-directory-based routing technigues. In non-directory-based routing, the complexities associated with di~ L.u~
based routing techniques are avoidcd. There is no need to 10 store r-~lnnpct;vity information for each transmitting node in the network, thus reducing the amount of overhead prorocs;ng that must be done by the network to ~s-:~ v~: network cnnnPrtiOnC. ~owever, non-directory-based routing te'-hn;'r generally do not permit network parameter optimization.
In United States Patent No. 4,939,726, issued to Baran, et al., and assigned to the assignee of the present invention, a non-directory-based routing method and system t_at permit network paL Pr optimization are ~licrlrcP~
According to the method described therein, each node in a network is uniguely identified by absolute y-:G~L~I hiCal coordinates or by a code indicating absolute location in an external coordinate-based reference system (node coordinates), and such absolute geographical coordinates or the eguivalent are employed as part of a packet identifier for each packet.
A means at each node through which a packet is routed u_es the packet destination coordinates and the node coordinates of its nPiqhhrring nodes to ~lptprm;np a desired forwarding route of a data packet. A routing ~iPcicio n is made for each packet that i6 received, even if that packet is directed to a destination for which the node has already received a packet. The routing may be prioritized according to preselected criteria, pref erably achieving opti~um f orward progress, that is, maximum forward p~OyLt:S::~ using the least amount of power and taking into account characteristics of the system.
Accordingly, the Baran ~acket routing method uses no routing directory or table to perf orm data routing . Each node of the network collects or is otherwise provided with information about the quality of communication between itself W095/28780 2 1 87926 r~.~ 01C78 and the neighboring nodes within the node ' s commlln i r~tion range. When a data packet has been received at a node, the data packet is routed further through the network hased on criteria derived from the history of communication between the local node and its neighbors. The criteria include distance, power re~uirement5, retry history (rQ~ hil ity), t.h~uuyl~ul.
history, speed of transfer (net data rate), network delay, and data priority. Typically, there is an initialization ~LuceduL ~ which i5 PYPCI~tQ~l to clPtp~m;np the latitude and longitude of nPi~rhhnrs within a destination sluadrant, and the criteria are weighted in accordance with preselected preferences to establish, at each subject node, a link sruality (LQ) factor for each possible destination local to the subject node. For each packet received and needing to be forwarded, a node in the Baran system creates a list of possible relay nodes, orders that list, and then polls the nPi rhh~lring node to see which node is available.
While the system disclosed in Baran has been shown to perf orm well and with advantages over directory-based routing schemes, there is a cost and delay in the Baran network due to each node in the network having to make a routing dQ~ n about each packet it receives. What is needed is a network and a routing method that preserves the advantages of the Baran coordinate-based addressing scheme but that does not require the overhead and processing of every packet that is retauired in the Baran system to make a routing decision about each packet.
S~ARY OF THE INVENTION
According to the invention, in a packet i cation system wherein nodes are ~csignp~ an absolute coordinate-based address, and wherein routing decisions are made at each node without the use of directory-based routing, routing decisions made for a particular packet with an ultimate destination are stored at each node so that the next packet sent by that node to that same ultimate destination can be forwarded in accordance with the first routing decision made for that destination. Routing decisions are stored at W09~28780 ~ g7~2~ r~ 01~78 each node in a local routing table. In one ~mhoS;1 L, nodes al60 store routing information about the source node for a packet so that when a return packet is received f or the original 60urce, the relay node has already calculated the 5 appropriate routing decision.
During the course of network operation, each node will :UllaLLU-_L and maintain a routing table useful for directing packets to a next node towards their ultimate destination. In accordance with the method according to the invention, a 10 routing ,i,~ cio~ must be made about a packet to an ultimate destination only the f irst time a packet either to that destination or from that destination is received. A relay node that receives a packet for a destination node de~rmi a next relay node for that packet based on the absolute 15 coordinate-based address of the destination node. Once a relay node has detn~minDcl a next relay node for an ultimate destination, that information is 6tored in a routing tahle and subsequent packets received at the relay node to that ultimate destination are immediately routed to the next relay node 20 listed in the routing table. In one ~mho~;- L of the invention, a relay node also stores a next relay node for the source node of packets it receives by A~ min~ that the relay node from which it just received a packet is the best next relay for packets going back to that source node. In this 25 way, when the relay node receives a return packet from the destination going back to the source, it will not have to make a routing decision for that packet but will instead forward it back along the path from which it came.
A network system built according to the invention is 30 different from directory based routing systems in that each routing deci ~ n for a packet is made locally at each node. A
source node does not specify a complete path to reach a destination node, but only sends the packet to a n~i~hh~-ring node in the direction of the ultimate node and that 35 neighboring node determines the next relay node in the path to the ultimate node. A network system built according to the invention is different from the Baran system in that the local decisions about routing are stored locally and are then Wog5/28780 ? ~ ~J~215 ~ ',0.~78 available for use in routing other packets. Unlike Baran, a node does not need to make a routing decision each time a packet is received and this greatly ~onhAnrPs the speed and efficiency of the network.
The invention will be better understood by reference to the following detailed description in connection with the a~. - ying drawings.
BRIEF DESCRIPTION OF THE n~wTNc.q FIG. 1 is a block diagram illustrating a general data network topology according to the invention.
FIG . 2 is a f low chart describing the operation of a relay node upon receiving a packet addressed to a destination node .
nr~Tr~n DESc~l~ll~N OF SPECIFIC FMRr~nTM~NTs Fig. 1 shows a data network according to the present invention. The network consists of nodes ~ Ah-'7 1 ~rl O through Z
interconnected by paths 12 representing allowable ;r~tion links between nodes. Routing table entries, s~llLed by the arrows 16, exist between certain nodes to speed up tr~nSm;cci~n of packets to a destination for which a routing decision has been made.
Data transmission between a source node and a destination node occurs as follows. If node W wishes to transmit a packet of information to node 0, node W will prepare the packet of data, along with a header that identifies node N as the source, node O as the destination, and gives the absolute coordinate-based address for itself and for node O. Node W will then check its routing table to see if there is an entry there f or node O . If there is not an entry for node O, node W will make a routing ~P~;s;nr, as in the Baran system, by ~YAm;n;n~ all of the nodes with which it can ~nmm~ln;cate (in this case Z and Y, also referred to as node W's neighboring nodes), ordering those nodes according to which is most advantageous to transmit in the direction of node 0, and sending a polling packet to the most advantageous node to determine if it is available to receive a data packet.
_ _ _ _ _ _ _ _ _ WO 9SIz8780 . ~ I, ~.. o .~78 ` ` 21 ~7926 ~
Once node w ha8 detorm; n-~cl that a ~Di~hhnring node i5 available for relaying a packet to node O, node N will then send the data packet to the selected node ( in this case node Y) along with a header identifying the source and destination 5 of the packet and identifying itself as the transmitter.
According to the invention, once node N detDrmi nD~ that node Y
is the relay node it will transmit to in order to get a packet to ultimate destination O, node N stores that information in a routing table. The next time node N wishes to transmit a 10 packet to node O, it checks its routing table, finds an entry for 0, and immediately transmits the packet to node Y without going through the process o~ making a routing ~lD~ 7 0n that is described above.
Nhen node Y receives the packet, it too checks its 15 own routing table to see if it has an entry f or the destination node O. If it does, the packet is immediately relayed to the node listed as the next node in the routing table. I~ it does not, node Y goes through the process of making a routing ~l~ni ~io~ described above and then stores the 20 next node (in this case V) in its routing table as an entry ~or node O and then f orwards the packet to the next node .
When node V receives the packet, it looks in its routing table for node O and if it rinds an entry sends the packet along to the node listed in that entry. If there is no 25 entry for O, node V makes a routing d~Ci qion as described above and then creates a routing table entry for O. At the same time, node V also checks its routing table and a r-i~hh-~ring node list to see if there is an entry for node W, the original source node for the packet. If there is not an 30 entry for node N, node V creates a routing table entry for node W and uses the node from which it received the packet from N (in this case node Y) as the next relay node for packets going back to N. In this way, if node V receives a response packet back from O to W, it will immediately forward 35 that packet to node Y without having to make a new routing rlDn;C;~rl for that packet. The table below is a representation of the cache routing table of node V after it has received and transmitted the packet from node N for node 0.
w0 95/28780 ; ) 1 ~ 7 ~2 ~ U~ S C ~-~8 ~outing Table Entry Destination Node Next Relay Node The nodes according to the present invention are designed BO that the routing table keeps track of when the last time each entry was used. When the routing table is full, the least recently used entry i9 discarded each time a node makes a new routing decision for a packet and a new entry lO is created.
Fig. 2 depicts a flow chart illustrating the operation of a relay node according to one Pmho,l i - l. of the present invention. While the steps of this process are shown in a particular order, it will be obvious to one of ordinary 15 skill in the art that the order of some of the suL~L u~ esses contained in this process could be changed and that some steps of this proces6 could be handled in parallel. The process begins when the relay node receives a packet for routing (Step Sl). As described above, the packet contains the absolute-20 address of the source node, the destination node, and theaddress of the nP; qhhnring node from which the packet was transmitted . The relay node f irst PYAm i nPc the source node identifier of the packet to determine if that source node is a llpi~hhnring node to which it can transmit directly (Step S2~.
25 If it is not, the relay node PYAmjnPc its routing table to see if there is an entry for that source node (Step S3). If there is not an entry, the source node checks to see if the routing table is full (Step S4) and deletes the least recently used entry if it is (Step SS). The relay node then creates a 30 routing table entry for the source node (Step S6).
Once processing of the source node identifier is complete, the relay node PYAm;nP~ the destination node identif ier of the packet . If the destination node is a n~;qhhnring node to which the rel~y node can communicate 35 directly (Step S7), it sends the packet (Step S8). If it is not, the relay node then PY~m;nPc its routing table to flPtPrm;nP if there is already an entry for the destination ... , _ . _ . .. . .... .. , . , , _, _ _ _ _ _ _ _ , W095/28780 ~ ~792~ r l~u. ~ 78 node tStep s9). If there is not a routing table entry for the destination node of the packet, the relay node checks to see if there i3 room f or a new entry in the routing table ( Step S10). If there is no room for a new entry in the routing table, the node deletes the least recently used entry to make room ~or a new entry (Step S11). The relay node then creates a new routing table entry for the destination (Step SlZ). The destination entry is created hy the process of making a routing ~Pci ~; m~ described above and described in the Baran patent. Once a routing table entry has been created for the destination node, the relay node uses that entry (Step S13) to forward the packet towards its destination (Step s8).
A number of modifications to this procedure will be obvious to one of ordinary skill in the art. For example, the steps that process the source node identif ier and create a source node entry could be performed after the packet is sent or while the packet is being sent. Another example is that the source node routing table entry may always be updated even when an old entry exists f or that source node .
The invention has now been explained with reference to ~poc-;f;r. ~-mhorli~ ~S. Other P~horl;r-nts will be apparent to those of ordinary skill in the art. It is therefore not intended that this invention be limited except as indicated by the IrpPn~l~p~ claims.
COMMUNICA~rION NETWORK USING 10CAT,TY CON~l~ucl~s ROUIrING TI~RT.T`.'::
BACKGROIJND OF THE INVENTION
The invention relates generally to a method f or routing data packets through a packet communication network 15 and more specifically to a method for routing data packets in a network where the best paths between nodes are stored in a routing table generated at each node.
Packet rommlln; rAtion is a form of data - i c~tion whereby segments or packets of data are routed with error 20 rh~ k;n~ and confirmation of receipt. Packets may be transmitted directly between a source node and a destination node or may be relayed via a number of relay nodes. Several methods of data packet routing are known.
One method is known as directory-based routing.
25 According to this method the address in the header of a packet is used as an index to a directory of packet routing lists stored in a source node. A packet routing list consists of an ordered list of packet node identifiers or call signs that represent a complete transmission path from the source node to 30 the destination node. Once the packet is sent from the source node, its path through the network is determined by the packet routing list that was stored in the source node. Packet routing lists must be prepared with knowledge about the connectivity of each node in the network, and in a typical 35 directory-based routing scheme, each node must maintain a complete routing list for every other node in the network to which it sends packets. Directory-based routing schemes require continued maintenance and communication of network interconnection inf ormation employed in the directory . Each 40 of these functions drains network resources and this can - =~
W095/28780 r._~u~ C~C~8 2 1 8 7~26 severely reduce performance in a large network. However, directory-based routing technigues have the advantage of permitting optimization of routing for a wide variety of network parameters, ;nrlu~lin~ data delay, tllL~uyllyuL~
S ral ;Ahil ;ty, priority and the like.
Another ba6ic family of routing techniques are the non-directory-based routing technigues. In non-directory-based routing, the complexities associated with di~ L.u~
based routing techniques are avoidcd. There is no need to 10 store r-~lnnpct;vity information for each transmitting node in the network, thus reducing the amount of overhead prorocs;ng that must be done by the network to ~s-:~ v~: network cnnnPrtiOnC. ~owever, non-directory-based routing te'-hn;'r generally do not permit network parameter optimization.
In United States Patent No. 4,939,726, issued to Baran, et al., and assigned to the assignee of the present invention, a non-directory-based routing method and system t_at permit network paL Pr optimization are ~licrlrcP~
According to the method described therein, each node in a network is uniguely identified by absolute y-:G~L~I hiCal coordinates or by a code indicating absolute location in an external coordinate-based reference system (node coordinates), and such absolute geographical coordinates or the eguivalent are employed as part of a packet identifier for each packet.
A means at each node through which a packet is routed u_es the packet destination coordinates and the node coordinates of its nPiqhhrring nodes to ~lptprm;np a desired forwarding route of a data packet. A routing ~iPcicio n is made for each packet that i6 received, even if that packet is directed to a destination for which the node has already received a packet. The routing may be prioritized according to preselected criteria, pref erably achieving opti~um f orward progress, that is, maximum forward p~OyLt:S::~ using the least amount of power and taking into account characteristics of the system.
Accordingly, the Baran ~acket routing method uses no routing directory or table to perf orm data routing . Each node of the network collects or is otherwise provided with information about the quality of communication between itself W095/28780 2 1 87926 r~.~ 01C78 and the neighboring nodes within the node ' s commlln i r~tion range. When a data packet has been received at a node, the data packet is routed further through the network hased on criteria derived from the history of communication between the local node and its neighbors. The criteria include distance, power re~uirement5, retry history (rQ~ hil ity), t.h~uuyl~ul.
history, speed of transfer (net data rate), network delay, and data priority. Typically, there is an initialization ~LuceduL ~ which i5 PYPCI~tQ~l to clPtp~m;np the latitude and longitude of nPi~rhhnrs within a destination sluadrant, and the criteria are weighted in accordance with preselected preferences to establish, at each subject node, a link sruality (LQ) factor for each possible destination local to the subject node. For each packet received and needing to be forwarded, a node in the Baran system creates a list of possible relay nodes, orders that list, and then polls the nPi rhh~lring node to see which node is available.
While the system disclosed in Baran has been shown to perf orm well and with advantages over directory-based routing schemes, there is a cost and delay in the Baran network due to each node in the network having to make a routing dQ~ n about each packet it receives. What is needed is a network and a routing method that preserves the advantages of the Baran coordinate-based addressing scheme but that does not require the overhead and processing of every packet that is retauired in the Baran system to make a routing decision about each packet.
S~ARY OF THE INVENTION
According to the invention, in a packet i cation system wherein nodes are ~csignp~ an absolute coordinate-based address, and wherein routing decisions are made at each node without the use of directory-based routing, routing decisions made for a particular packet with an ultimate destination are stored at each node so that the next packet sent by that node to that same ultimate destination can be forwarded in accordance with the first routing decision made for that destination. Routing decisions are stored at W09~28780 ~ g7~2~ r~ 01~78 each node in a local routing table. In one ~mhoS;1 L, nodes al60 store routing information about the source node for a packet so that when a return packet is received f or the original 60urce, the relay node has already calculated the 5 appropriate routing decision.
During the course of network operation, each node will :UllaLLU-_L and maintain a routing table useful for directing packets to a next node towards their ultimate destination. In accordance with the method according to the invention, a 10 routing ,i,~ cio~ must be made about a packet to an ultimate destination only the f irst time a packet either to that destination or from that destination is received. A relay node that receives a packet for a destination node de~rmi a next relay node for that packet based on the absolute 15 coordinate-based address of the destination node. Once a relay node has detn~minDcl a next relay node for an ultimate destination, that information is 6tored in a routing tahle and subsequent packets received at the relay node to that ultimate destination are immediately routed to the next relay node 20 listed in the routing table. In one ~mho~;- L of the invention, a relay node also stores a next relay node for the source node of packets it receives by A~ min~ that the relay node from which it just received a packet is the best next relay for packets going back to that source node. In this 25 way, when the relay node receives a return packet from the destination going back to the source, it will not have to make a routing decision for that packet but will instead forward it back along the path from which it came.
A network system built according to the invention is 30 different from directory based routing systems in that each routing deci ~ n for a packet is made locally at each node. A
source node does not specify a complete path to reach a destination node, but only sends the packet to a n~i~hh~-ring node in the direction of the ultimate node and that 35 neighboring node determines the next relay node in the path to the ultimate node. A network system built according to the invention is different from the Baran system in that the local decisions about routing are stored locally and are then Wog5/28780 ? ~ ~J~215 ~ ',0.~78 available for use in routing other packets. Unlike Baran, a node does not need to make a routing decision each time a packet is received and this greatly ~onhAnrPs the speed and efficiency of the network.
The invention will be better understood by reference to the following detailed description in connection with the a~. - ying drawings.
BRIEF DESCRIPTION OF THE n~wTNc.q FIG. 1 is a block diagram illustrating a general data network topology according to the invention.
FIG . 2 is a f low chart describing the operation of a relay node upon receiving a packet addressed to a destination node .
nr~Tr~n DESc~l~ll~N OF SPECIFIC FMRr~nTM~NTs Fig. 1 shows a data network according to the present invention. The network consists of nodes ~ Ah-'7 1 ~rl O through Z
interconnected by paths 12 representing allowable ;r~tion links between nodes. Routing table entries, s~llLed by the arrows 16, exist between certain nodes to speed up tr~nSm;cci~n of packets to a destination for which a routing decision has been made.
Data transmission between a source node and a destination node occurs as follows. If node W wishes to transmit a packet of information to node 0, node W will prepare the packet of data, along with a header that identifies node N as the source, node O as the destination, and gives the absolute coordinate-based address for itself and for node O. Node W will then check its routing table to see if there is an entry there f or node O . If there is not an entry for node O, node W will make a routing ~P~;s;nr, as in the Baran system, by ~YAm;n;n~ all of the nodes with which it can ~nmm~ln;cate (in this case Z and Y, also referred to as node W's neighboring nodes), ordering those nodes according to which is most advantageous to transmit in the direction of node 0, and sending a polling packet to the most advantageous node to determine if it is available to receive a data packet.
_ _ _ _ _ _ _ _ _ WO 9SIz8780 . ~ I, ~.. o .~78 ` ` 21 ~7926 ~
Once node w ha8 detorm; n-~cl that a ~Di~hhnring node i5 available for relaying a packet to node O, node N will then send the data packet to the selected node ( in this case node Y) along with a header identifying the source and destination 5 of the packet and identifying itself as the transmitter.
According to the invention, once node N detDrmi nD~ that node Y
is the relay node it will transmit to in order to get a packet to ultimate destination O, node N stores that information in a routing table. The next time node N wishes to transmit a 10 packet to node O, it checks its routing table, finds an entry for 0, and immediately transmits the packet to node Y without going through the process o~ making a routing ~lD~ 7 0n that is described above.
Nhen node Y receives the packet, it too checks its 15 own routing table to see if it has an entry f or the destination node O. If it does, the packet is immediately relayed to the node listed as the next node in the routing table. I~ it does not, node Y goes through the process of making a routing ~l~ni ~io~ described above and then stores the 20 next node (in this case V) in its routing table as an entry ~or node O and then f orwards the packet to the next node .
When node V receives the packet, it looks in its routing table for node O and if it rinds an entry sends the packet along to the node listed in that entry. If there is no 25 entry for O, node V makes a routing d~Ci qion as described above and then creates a routing table entry for O. At the same time, node V also checks its routing table and a r-i~hh-~ring node list to see if there is an entry for node W, the original source node for the packet. If there is not an 30 entry for node N, node V creates a routing table entry for node W and uses the node from which it received the packet from N (in this case node Y) as the next relay node for packets going back to N. In this way, if node V receives a response packet back from O to W, it will immediately forward 35 that packet to node Y without having to make a new routing rlDn;C;~rl for that packet. The table below is a representation of the cache routing table of node V after it has received and transmitted the packet from node N for node 0.
w0 95/28780 ; ) 1 ~ 7 ~2 ~ U~ S C ~-~8 ~outing Table Entry Destination Node Next Relay Node The nodes according to the present invention are designed BO that the routing table keeps track of when the last time each entry was used. When the routing table is full, the least recently used entry i9 discarded each time a node makes a new routing decision for a packet and a new entry lO is created.
Fig. 2 depicts a flow chart illustrating the operation of a relay node according to one Pmho,l i - l. of the present invention. While the steps of this process are shown in a particular order, it will be obvious to one of ordinary 15 skill in the art that the order of some of the suL~L u~ esses contained in this process could be changed and that some steps of this proces6 could be handled in parallel. The process begins when the relay node receives a packet for routing (Step Sl). As described above, the packet contains the absolute-20 address of the source node, the destination node, and theaddress of the nP; qhhnring node from which the packet was transmitted . The relay node f irst PYAm i nPc the source node identifier of the packet to determine if that source node is a llpi~hhnring node to which it can transmit directly (Step S2~.
25 If it is not, the relay node PYAmjnPc its routing table to see if there is an entry for that source node (Step S3). If there is not an entry, the source node checks to see if the routing table is full (Step S4) and deletes the least recently used entry if it is (Step SS). The relay node then creates a 30 routing table entry for the source node (Step S6).
Once processing of the source node identifier is complete, the relay node PYAm;nP~ the destination node identif ier of the packet . If the destination node is a n~;qhhnring node to which the rel~y node can communicate 35 directly (Step S7), it sends the packet (Step S8). If it is not, the relay node then PY~m;nPc its routing table to flPtPrm;nP if there is already an entry for the destination ... , _ . _ . .. . .... .. , . , , _, _ _ _ _ _ _ _ , W095/28780 ~ ~792~ r l~u. ~ 78 node tStep s9). If there is not a routing table entry for the destination node of the packet, the relay node checks to see if there i3 room f or a new entry in the routing table ( Step S10). If there is no room for a new entry in the routing table, the node deletes the least recently used entry to make room ~or a new entry (Step S11). The relay node then creates a new routing table entry for the destination (Step SlZ). The destination entry is created hy the process of making a routing ~Pci ~; m~ described above and described in the Baran patent. Once a routing table entry has been created for the destination node, the relay node uses that entry (Step S13) to forward the packet towards its destination (Step s8).
A number of modifications to this procedure will be obvious to one of ordinary skill in the art. For example, the steps that process the source node identif ier and create a source node entry could be performed after the packet is sent or while the packet is being sent. Another example is that the source node routing table entry may always be updated even when an old entry exists f or that source node .
The invention has now been explained with reference to ~poc-;f;r. ~-mhorli~ ~S. Other P~horl;r-nts will be apparent to those of ordinary skill in the art. It is therefore not intended that this invention be limited except as indicated by the IrpPn~l~p~ claims.
Claims (12)
1. A method for routing packets of data without a network directory comprising the steps of:
assigning to each node in a network an identifier indicative of coordinate location, said identifier including an absolute coordinate value;
addressing a packet to an ultimate destination node by designating in a packet header said ultimate destination node only by said coordinate value of said ultimate destination node and without designating a complete intermediate path to said ultimate destination node such that the network is free to route the packet via any intermediate path to said ultimate destination node;
at a relay local node, selecting one neighboring nodes by using said packet header and other information specific to said local node according to preselected criteria;
storing at said relay node an identifier of said selected neighboring node along with a label for said ultimate destination node in a routing table forwarding said packet to said selected neighboring node for eventual delivery to said ultimate destination node; and retrieving said identifier at said selected neighboring node from said routing table when a subsequent packet for said ultimate destination is received at said relay node and forwarding said subsequent packet to said node indicated by said identifier.
assigning to each node in a network an identifier indicative of coordinate location, said identifier including an absolute coordinate value;
addressing a packet to an ultimate destination node by designating in a packet header said ultimate destination node only by said coordinate value of said ultimate destination node and without designating a complete intermediate path to said ultimate destination node such that the network is free to route the packet via any intermediate path to said ultimate destination node;
at a relay local node, selecting one neighboring nodes by using said packet header and other information specific to said local node according to preselected criteria;
storing at said relay node an identifier of said selected neighboring node along with a label for said ultimate destination node in a routing table forwarding said packet to said selected neighboring node for eventual delivery to said ultimate destination node; and retrieving said identifier at said selected neighboring node from said routing table when a subsequent packet for said ultimate destination is received at said relay node and forwarding said subsequent packet to said node indicated by said identifier.
2. The method according to claim 1 wherein said selecting step includes using said packet header to determine distance of said neighboring nodes relative to said ultimate destination node.
3. The method according to claim 1 wherein said selecting step includes developing a local table for maintaining communication history between said local nodes and said neighboring nodes.
'
'
4. The method according to claims 1, 2, or 3 further comprising the step of:
storing at said relay node an identifier for a directly transmittable neighboring node along with a label for said source node in a routing table; and retrieving said identifier for said directly transmittable neighboring node from said routing table when a return packet directed to said source node is received at said relay node; and forwarding said return packet to said transmitted from neighboring node for eventual delivery to said source node.
storing at said relay node an identifier for a directly transmittable neighboring node along with a label for said source node in a routing table; and retrieving said identifier for said directly transmittable neighboring node from said routing table when a return packet directed to said source node is received at said relay node; and forwarding said return packet to said transmitted from neighboring node for eventual delivery to said source node.
5. The method according to claim 3 wherein a link quality factor we use "latency" expected/calculation is employed to define preferred communication paths.
6. A system for routing packets of data in a packet data communication network without a network directory comprising:
a plurality of nodes in a network, each node including an identifier indicative of coordinate location, said identifier including a coordinate value referenced to a terrestrial grid;
means for addressing a packet to an ultimate destination node by designating in a packet header said ultimate destination node only by said coordinate value of said ultimate destination node and without designating a complete intermediate path to said ultimate destination node such that the network is free to route the packet via any intermediate path to said ultimate destination node; and means at each of said plurality of nodes for storing a routing table entry for an ultimate destination of a packet, said routing table entry selectable by an identifier for said ultimate destination node and including information identifying a neighboring node as a forwarding node for said ultimate destination.
a plurality of nodes in a network, each node including an identifier indicative of coordinate location, said identifier including a coordinate value referenced to a terrestrial grid;
means for addressing a packet to an ultimate destination node by designating in a packet header said ultimate destination node only by said coordinate value of said ultimate destination node and without designating a complete intermediate path to said ultimate destination node such that the network is free to route the packet via any intermediate path to said ultimate destination node; and means at each of said plurality of nodes for storing a routing table entry for an ultimate destination of a packet, said routing table entry selectable by an identifier for said ultimate destination node and including information identifying a neighboring node as a forwarding node for said ultimate destination.
7. A system for routing packets of data without a network directory comprising:
a plurality of nodes in a network, each node including an identifier indicative of geographic location, said identifier including a coordinate value referenced to a terrestrial grid;
means for addressing a packet to an ultimate destination node by designating in a packet header said ultimate destination node only by said coordinate value of said ultimate destination node and without designating a complete intermediate path to said ultimate destination node such that the network is free to route the packet via any intermediate path to said ultimate destination node; and at a local node, means for selecting at least one of said neighboring nodes by using said packet header and other information specific to said local node according to preselected criteria;
means for forwarding said packet to said selected neighboring nodes for eventual delivery to said ultimate destination node; and means at each of said plurality of nodes for storing a routing table entry for an ultimate destination of a packet, said routing table entry selectable by an identifier for said ultimate destination node and including information identifying a neighboring node as a forwarding node for said ultimate destination.
a plurality of nodes in a network, each node including an identifier indicative of geographic location, said identifier including a coordinate value referenced to a terrestrial grid;
means for addressing a packet to an ultimate destination node by designating in a packet header said ultimate destination node only by said coordinate value of said ultimate destination node and without designating a complete intermediate path to said ultimate destination node such that the network is free to route the packet via any intermediate path to said ultimate destination node; and at a local node, means for selecting at least one of said neighboring nodes by using said packet header and other information specific to said local node according to preselected criteria;
means for forwarding said packet to said selected neighboring nodes for eventual delivery to said ultimate destination node; and means at each of said plurality of nodes for storing a routing table entry for an ultimate destination of a packet, said routing table entry selectable by an identifier for said ultimate destination node and including information identifying a neighboring node as a forwarding node for said ultimate destination.
8. The system according to claim 7 wherein said selecting means comprises means for selecting one neighboring node requiring the least amount of power for forwarding said packet.
9. The system according to claim 7 wherein said selecting means includes means for using said packet header to determine distance of neighboring nodes relative to said ultimate destination node.
10. The system according to claim 7 wherein said selecting means includes means for developing a link list for maintaining communication history between said local nodes and said neighboring nodes.
11. The system according to claim 10 wherein said link list maintains information about said neighboring nodes on at least one of the following criteria: distance, output power required to establish communication, retry history (reliability), throughput history, speed of transfer (net data rate), network delay, data priority, link utilization percentage, closeness to desired destination, closeness to desired bearing, randomness, and closeness to local bearing.
12. The system according to claim 10 wherein a link quality factor is employed to define preferred communication paths.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US08/227,774 US5488608A (en) | 1994-04-14 | 1994-04-14 | Method and system for routing packets in a packet communication network using locally constructed routing tables |
| US08/227,774 | 1994-04-14 |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CA2187926A1 true CA2187926A1 (en) | 1995-10-26 |
Family
ID=22854409
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002187926A Abandoned CA2187926A1 (en) | 1994-04-14 | 1995-04-11 | Method and system for routing packets in a packet communication network using locally constructed routine tables |
Country Status (6)
| Country | Link |
|---|---|
| US (1) | US5488608A (en) |
| EP (1) | EP0755596A4 (en) |
| JP (1) | JP3624222B2 (en) |
| CN (1) | CN1152383A (en) |
| CA (1) | CA2187926A1 (en) |
| WO (1) | WO1995028780A1 (en) |
Families Citing this family (164)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| DE19531609A1 (en) * | 1994-09-13 | 1996-03-28 | Siemens Ag | Communications network traffic management |
| US5712712A (en) * | 1995-06-01 | 1998-01-27 | Rapidata Systems, Inc. | Rapid delivery of facsimile or other data sets to a massive number of recipients |
| US5757783A (en) * | 1995-06-15 | 1998-05-26 | Lucent Technologies Inc. | Method and apparatus for routing ATM cells in an AD-ATM LAN |
| CA2228219C (en) * | 1995-07-28 | 2002-10-15 | British Telecommunications Public Limited Company | Packet routing |
| US6064671A (en) * | 1995-12-08 | 2000-05-16 | Killian; Michael G. | Multi-homed end system for increasing computers network bandwidth |
| DE59510586D1 (en) * | 1995-12-21 | 2003-04-17 | Siemens Ag | Method for forming routing information in an ATM communication network |
| US7035914B1 (en) | 1996-01-26 | 2006-04-25 | Simpleair Holdings, Inc. | System and method for transmission of data |
| JPH09219702A (en) * | 1996-02-14 | 1997-08-19 | Nec Corp | Method for retrieving free route of mesh configuration |
| US7054271B2 (en) | 1996-12-06 | 2006-05-30 | Ipco, Llc | Wireless network system and method for providing same |
| US8982856B2 (en) * | 1996-12-06 | 2015-03-17 | Ipco, Llc | Systems and methods for facilitating wireless network communication, satellite-based wireless network systems, and aircraft-based wireless network systems, and related methods |
| AR011440A1 (en) * | 1997-02-12 | 2000-08-16 | Abb Power T & D Co | ELECTRONIC MEASUREMENT PROVISION |
| EP0868104A3 (en) * | 1997-03-27 | 2003-09-17 | Siemens Aktiengesellschaft | Hierarchically structured communication network and method for communicating geographical coordinates of nodes |
| US6041049A (en) * | 1997-05-06 | 2000-03-21 | International Business Machines Corporation | Method and apparatus for determining a routing table for each node in a distributed nodal system |
| DE19719170C2 (en) * | 1997-05-06 | 1999-12-09 | Ericsson Telefon Ab L M | Method and tool for establishing a telecommunications network |
| US6052683A (en) * | 1998-02-24 | 2000-04-18 | Nortel Networks Corporation | Address lookup in packet data communication networks |
| US6130881A (en) * | 1998-04-20 | 2000-10-10 | Sarnoff Corporation | Traffic routing in small wireless data networks |
| US6891838B1 (en) * | 1998-06-22 | 2005-05-10 | Statsignal Ipc, Llc | System and method for monitoring and controlling residential devices |
| US6437692B1 (en) | 1998-06-22 | 2002-08-20 | Statsignal Systems, Inc. | System and method for monitoring and controlling remote devices |
| US6914893B2 (en) | 1998-06-22 | 2005-07-05 | Statsignal Ipc, Llc | System and method for monitoring and controlling remote devices |
| US8410931B2 (en) | 1998-06-22 | 2013-04-02 | Sipco, Llc | Mobile inventory unit monitoring systems and methods |
| US6141738A (en) * | 1998-07-08 | 2000-10-31 | Nortel Networks Corporation | Address translation method and system having a forwarding table data structure |
| US6785277B1 (en) | 1998-08-06 | 2004-08-31 | Telefonaktiebolget Lm Ericsson (Publ) | System and method for internodal information routing within a communications network |
| US6480497B1 (en) | 1998-11-23 | 2002-11-12 | Ricochet Networks, Inc. | Method and apparatus for maximizing data throughput in a packet radio mesh network |
| IT1305103B1 (en) | 1998-12-30 | 2001-04-10 | Cit Alcatel | METHOD OF SORTING INFORMATION PACKAGES ASSOCIATED WITH ADDRESSES REPRESENTED THROUGH NUMERICAL STRINGS AND RELATED APPARATUS |
| US6577613B1 (en) | 1999-03-02 | 2003-06-10 | Verizon Corporate Services Group Inc. | Method and apparatus for asynchronous reservation-oriented multiple access for wireless networks |
| US7650425B2 (en) | 1999-03-18 | 2010-01-19 | Sipco, Llc | System and method for controlling communication between a host computer and communication devices associated with remote devices in an automated monitoring system |
| US7685311B2 (en) | 1999-05-03 | 2010-03-23 | Digital Envoy, Inc. | Geo-intelligent traffic reporter |
| US6757740B1 (en) | 1999-05-03 | 2004-06-29 | Digital Envoy, Inc. | Systems and methods for determining collecting and using geographic locations of internet users |
| US7844729B1 (en) | 1999-05-03 | 2010-11-30 | Digital Envoy, Inc. | Geo-intelligent traffic manager |
| CA2277264A1 (en) | 1999-07-09 | 2001-01-09 | Telecommunications Research Laboratories | A self-configuring radio network |
| US6298053B1 (en) | 2000-01-14 | 2001-10-02 | Metricom, Inc. | Method and apparatus for connection handoff between connected radios |
| US8019836B2 (en) | 2002-01-02 | 2011-09-13 | Mesh Comm, Llc | Wireless communication enabled meter and network |
| AUPQ545600A0 (en) * | 2000-02-04 | 2000-03-02 | Geobytes Inc | Method and apparatus for identifying locale of internet users |
| US20010045914A1 (en) * | 2000-02-25 | 2001-11-29 | Bunker Philip Alan | Device and system for providing a wireless high-speed communications network |
| US6826186B1 (en) * | 2000-03-07 | 2004-11-30 | Cisco Technology, Inc. | Method and apparatus for distributing packets across multiple paths leading to a destination |
| US6684250B2 (en) | 2000-04-03 | 2004-01-27 | Quova, Inc. | Method and apparatus for estimating a geographic location of a networked entity |
| US6735178B1 (en) | 2000-05-10 | 2004-05-11 | Ricochet Networks, Inc. | Method for maximizing throughput for multiple links using directional elements |
| DE10023309A1 (en) * | 2000-05-15 | 2001-11-22 | Bosch Gmbh Robert | Data packet communication method in Internet, involves including allocation information in data packet, for allocating portion of location information to respective description information |
| US6816457B1 (en) * | 2000-06-02 | 2004-11-09 | Abdullah Ali Bahattab | Predictive routing table cache population |
| US7111163B1 (en) | 2000-07-10 | 2006-09-19 | Alterwan, Inc. | Wide area network using internet with quality of service |
| US7035227B2 (en) * | 2000-10-10 | 2006-04-25 | The Regents Of The University Of California | On-demand loop-free multipath routing (ROAM) |
| US20020089983A1 (en) * | 2000-12-18 | 2002-07-11 | Zarlink Semiconductor V.N. Inc. | Switching database cache management system |
| US7193968B1 (en) * | 2001-02-08 | 2007-03-20 | Cisco Technology, Inc. | Sample netflow for network traffic data collection |
| JP4567233B2 (en) * | 2001-04-26 | 2010-10-20 | 富士通株式会社 | COMMUNICATION DEVICE AND ITS CONTROL METHOD |
| DE10122422A1 (en) | 2001-05-09 | 2002-11-21 | Siemens Ag | Method for adjusting bandwidth in a connection between two communications terminals in a data network allocates a transmission channel to the connection for transmitting data. |
| GB0112017D0 (en) | 2001-05-17 | 2001-07-11 | Koninkl Philips Electronics Nv | Wireless master-slave distributed communications network |
| KR20020091791A (en) * | 2001-05-30 | 2002-12-06 | 미츠비시 마테리알 가부시키가이샤 | Communication system management server, wireless server, mobile management server and information management server |
| US6606322B2 (en) * | 2001-08-17 | 2003-08-12 | Mcdata Corporation | Route lookup caching for a fiber channel switch |
| US7035209B2 (en) * | 2001-08-23 | 2006-04-25 | Tropic Networks Inc. | Control communications in communications networks |
| EP1436957B1 (en) * | 2001-10-17 | 2017-07-05 | BRITISH TELECOMMUNICATIONS public limited company | Network location management system |
| US7480501B2 (en) | 2001-10-24 | 2009-01-20 | Statsignal Ipc, Llc | System and method for transmitting an emergency message over an integrated wireless network |
| US8489063B2 (en) | 2001-10-24 | 2013-07-16 | Sipco, Llc | Systems and methods for providing emergency messages to a mobile device |
| US7424527B2 (en) * | 2001-10-30 | 2008-09-09 | Sipco, Llc | System and method for transmitting pollution information over an integrated wireless network |
| ES2252319T3 (en) | 2001-12-03 | 2006-05-16 | Nokia Corporation | ADDRESS AND ROADING IN WIRELESS NETWORKS IN MALLA. |
| US7119713B2 (en) * | 2002-06-27 | 2006-10-10 | Elster Electricity, Llc | Dynamic self-configuring metering network |
| US20040113810A1 (en) * | 2002-06-28 | 2004-06-17 | Mason Robert T. | Data collector for an automated meter reading system |
| US7164667B2 (en) | 2002-06-28 | 2007-01-16 | Belair Networks Inc. | Integrated wireless distribution and mesh backhaul networks |
| US7610050B2 (en) * | 2002-08-14 | 2009-10-27 | Tadaaki Chigusa | System for mobile broadband networking using dynamic quality of service provisioning |
| US7042394B2 (en) * | 2002-08-14 | 2006-05-09 | Skipper Wireless Inc. | Method and system for determining direction of transmission using multi-facet antenna |
| US7015809B1 (en) | 2002-08-14 | 2006-03-21 | Skipper Wireless Inc. | Method and system for providing an active routing antenna |
| 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 |
| US7720006B1 (en) * | 2003-08-06 | 2010-05-18 | Cisco Technology, Inc. | System for determining reachablity of a neighboring node in a network |
| US20050138049A1 (en) * | 2003-12-22 | 2005-06-23 | Greg Linden | Method for personalized news |
| US7420954B2 (en) * | 2004-01-13 | 2008-09-02 | General Motors Corporation | Efficient lightweight information dissemination algorithm for mobile wireless ad hoc networks |
| US8031650B2 (en) | 2004-03-03 | 2011-10-04 | Sipco, Llc | System and method for monitoring remote devices with a dual-mode wireless communication protocol |
| US7756086B2 (en) | 2004-03-03 | 2010-07-13 | Sipco, Llc | Method for communicating in dual-modes |
| EP1769381A4 (en) * | 2004-03-04 | 2012-02-22 | Quova Inc | Geo-location and geo-compliance utilizing a client agent |
| US7961664B1 (en) | 2004-03-27 | 2011-06-14 | Dust Networks, Inc. | Digraph network subnetworks |
| US7420980B1 (en) * | 2004-03-27 | 2008-09-02 | Dust Networks, Inc. | Digraph network superframes |
| US7881239B2 (en) * | 2004-03-27 | 2011-02-01 | Dust Networks, Inc. | Low-powered autonomous radio node with temperature sensor and crystal oscillator |
| US8194655B2 (en) * | 2004-08-05 | 2012-06-05 | Dust Networks, Inc. | Digraph based mesh communication network |
| US8059629B1 (en) | 2004-03-27 | 2011-11-15 | Dust Networks, Inc. | Digraph network timing synchronization |
| US7529217B2 (en) * | 2004-03-27 | 2009-05-05 | Dust Networks, Inc. | Low-power autonomous node for mesh communication network |
| US7262709B2 (en) * | 2004-04-26 | 2007-08-28 | Elster Electricity, Llc | System and method for efficient configuration in a fixed network automated meter reading system |
| US7187906B2 (en) * | 2004-04-26 | 2007-03-06 | Elster Electricity, Llc | Method and system for configurable qualification and registration in a fixed network automated meter reading system |
| US7239250B2 (en) * | 2004-04-26 | 2007-07-03 | Elster Electricity, Llc | System and method for improved transmission of meter data |
| US20050251401A1 (en) * | 2004-05-10 | 2005-11-10 | Elster Electricity, Llc. | Mesh AMR network interconnecting to mesh Wi-Fi network |
| US20050251403A1 (en) * | 2004-05-10 | 2005-11-10 | Elster Electricity, Llc. | Mesh AMR network interconnecting to TCP/IP wireless mesh network |
| US7142106B2 (en) * | 2004-06-15 | 2006-11-28 | Elster Electricity, Llc | System and method of visualizing network layout and performance characteristics in a wireless network |
| US8185653B2 (en) * | 2004-08-09 | 2012-05-22 | Johnny Yau | Method and apparatus for ad hoc mesh routing |
| US7808925B2 (en) * | 2004-09-10 | 2010-10-05 | Digital Envoy, Inc. | Methods and systems for determining reverse DNS entries |
| US7543740B2 (en) * | 2004-09-17 | 2009-06-09 | Digital Envoy, Inc. | Fraud analyst smart cookie |
| US20060064374A1 (en) * | 2004-09-17 | 2006-03-23 | David Helsper | Fraud risk advisor |
| US7497374B2 (en) * | 2004-09-17 | 2009-03-03 | Digital Envoy, Inc. | Fraud risk advisor |
| US7742430B2 (en) * | 2004-09-24 | 2010-06-22 | Elster Electricity, Llc | System for automated management of spontaneous node migration in a distributed fixed wireless network |
| US7176807B2 (en) * | 2004-09-24 | 2007-02-13 | Elster Electricity, Llc | System for automatically enforcing a demand reset in a fixed network of electricity meters |
| US7170425B2 (en) * | 2004-09-24 | 2007-01-30 | Elster Electricity, Llc | System and method for creating multiple operating territories within a meter reading system |
| US8072945B2 (en) * | 2004-09-24 | 2011-12-06 | Aes Corporation | Link layered networks |
| US7702594B2 (en) * | 2004-09-24 | 2010-04-20 | Elster Electricity, Llc | System and method for automated configuration of meters |
| US20060168066A1 (en) * | 2004-11-10 | 2006-07-27 | David Helsper | Email anti-phishing inspector |
| US8032594B2 (en) | 2004-11-10 | 2011-10-04 | Digital Envoy, Inc. | Email anti-phishing inspector |
| US7327998B2 (en) * | 2004-12-22 | 2008-02-05 | Elster Electricity, Llc | System and method of providing a geographic view of nodes in a wireless network |
| WO2006081206A1 (en) | 2005-01-25 | 2006-08-03 | Sipco, Llc | Wireless network protocol systems and methods |
| US20060206433A1 (en) * | 2005-03-11 | 2006-09-14 | Elster Electricity, Llc. | Secure and authenticated delivery of data from an automated meter reading system |
| US20060224335A1 (en) * | 2005-03-29 | 2006-10-05 | Elster Electricity, Llc | Collecting interval data from a relative time battery powered automated meter reading devices |
| US7515544B2 (en) * | 2005-07-14 | 2009-04-07 | Tadaaki Chigusa | Method and system for providing location-based addressing |
| US7495578B2 (en) * | 2005-09-02 | 2009-02-24 | Elster Electricity, Llc | Multipurpose interface for an automated meter reading device |
| US7308369B2 (en) * | 2005-09-28 | 2007-12-11 | Elster Electricity Llc | Ensuring automatic season change demand resets in a mesh type network of telemetry devices |
| US7283700B2 (en) * | 2005-11-02 | 2007-10-16 | Corrado Pietro Dragone | Optical router using stationary imaging |
| US20070147268A1 (en) * | 2005-12-23 | 2007-06-28 | Elster Electricity, Llc | Distributing overall control of mesh AMR LAN networks to WAN interconnected collectors |
| US7427927B2 (en) * | 2006-02-16 | 2008-09-23 | Elster Electricity, Llc | In-home display communicates with a fixed network meter reading system |
| US7545285B2 (en) * | 2006-02-16 | 2009-06-09 | Elster Electricity, Llc | Load control unit in communication with a fixed network meter reading system |
| US7778149B1 (en) | 2006-07-27 | 2010-08-17 | Tadaaki Chigusa | Method and system to providing fast access channel |
| JP4751784B2 (en) * | 2006-07-31 | 2011-08-17 | 富士通株式会社 | Routing controller and table updating method |
| US8160096B1 (en) | 2006-12-06 | 2012-04-17 | Tadaaki Chigusa | Method and system for reserving bandwidth in time-division multiplexed networks |
| US8073384B2 (en) * | 2006-12-14 | 2011-12-06 | Elster Electricity, Llc | Optimization of redundancy and throughput in an automated meter data collection system using a wireless network |
| US8320302B2 (en) * | 2007-04-20 | 2012-11-27 | Elster Electricity, Llc | Over the air microcontroller flash memory updates |
| US7929474B2 (en) * | 2007-06-22 | 2011-04-19 | Vubiq Incorporated | System and method for wireless communication in a backplane fabric architecture |
| US7933273B2 (en) * | 2007-07-27 | 2011-04-26 | Sony Computer Entertainment Inc. | Cooperative NAT behavior discovery |
| US9250084B2 (en) * | 2007-08-10 | 2016-02-02 | Cisco Technology, Inc. | System and method for navigating using multiple modalities |
| EP2203911A4 (en) * | 2007-10-25 | 2011-12-28 | Trilliant Networks Inc | Gas meter having ultra-sensitive magnetic material retrofitted onto meter dial and method for performing meter retrofit |
| WO2009067257A1 (en) | 2007-11-25 | 2009-05-28 | Trilliant Networks, Inc. | Energy use control system and method |
| US8138934B2 (en) | 2007-11-25 | 2012-03-20 | Trilliant Networks, Inc. | System and method for false alert filtering of event messages within a network |
| EP2215554A4 (en) * | 2007-11-25 | 2011-04-27 | Trilliant Networks Inc | Proxy use within a mesh network |
| EP2215556B1 (en) | 2007-11-25 | 2019-08-28 | Trilliant Networks, Inc. | System and method for transmitting power status notifications in an advanced metering infrastructure network |
| US20090136042A1 (en) * | 2007-11-25 | 2009-05-28 | Michel Veillette | Application layer authorization token and method |
| WO2009067253A1 (en) * | 2007-11-25 | 2009-05-28 | Trilliant Networks, Inc. | Creating and managing association and balancing of a mesh device in a mesh network |
| NZ586190A (en) | 2007-12-26 | 2013-05-31 | Elster Electricity Llc | A utility meter network wherein meters can transmit electrical and other readings to a collector by using other meters as repeaters |
| CN102027761B (en) * | 2008-05-15 | 2015-05-20 | 哈里斯施特拉特克斯网络运行公司 | Systems and methods for distributed data routing in a wireless network |
| US9071498B2 (en) * | 2008-05-15 | 2015-06-30 | Telsima Corporation | Systems and methods for fractional routing redundancy |
| US9088929B2 (en) | 2008-05-15 | 2015-07-21 | Telsima Corporation | Systems and methods for distributed data routing in a wireless network |
| EP2281408A4 (en) | 2008-05-28 | 2013-03-06 | Harris Stratex Networks Operat | Systems and methods for data path control in a wireless network |
| US8525692B2 (en) * | 2008-06-13 | 2013-09-03 | Elster Solutions, Llc | Techniques for limiting demand from an electricity meter with an installed relay |
| US8699377B2 (en) | 2008-09-04 | 2014-04-15 | Trilliant Networks, Inc. | System and method for implementing mesh network communications using a mesh network protocol |
| US8289182B2 (en) | 2008-11-21 | 2012-10-16 | Trilliant Networks, Inc. | Methods and systems for virtual energy management display |
| US8203463B2 (en) | 2009-02-13 | 2012-06-19 | Elster Electricity Llc | Wakeup and interrogation of meter-reading devices using licensed narrowband and unlicensed wideband radio communication |
| CA2753074A1 (en) | 2009-03-11 | 2010-09-16 | Trilliant Networks, Inc. | Process, device and system for mapping transformers to meters and locating non-technical line losses |
| JP5335582B2 (en) * | 2009-07-06 | 2013-11-06 | アラクサラネットワークス株式会社 | Communication apparatus and route table generation method |
| US9893406B2 (en) | 2009-08-19 | 2018-02-13 | Vubiq Networks, Inc. | Method of forming a waveguide interface by providing a mold to form a support block of the interface |
| IN2012DN02174A (en) | 2009-08-19 | 2015-08-21 | Vubiq Inc | |
| US8443107B2 (en) | 2009-11-11 | 2013-05-14 | Digital Envoy, Inc. | Method, computer program product and electronic device for hyper-local geo-targeting |
| KR20110064153A (en) * | 2009-12-07 | 2011-06-15 | 삼성전자주식회사 | Metallic organic precursor, method for preparing the same, and method for forming conductive metal layer or pattern |
| US9084120B2 (en) | 2010-08-27 | 2015-07-14 | Trilliant Networks Inc. | System and method for interference free operation of co-located transceivers |
| CA2813534A1 (en) | 2010-09-13 | 2012-03-22 | Trilliant Networks, Inc. | Process for detecting energy theft |
| US9569398B2 (en) * | 2010-09-28 | 2017-02-14 | International Business Machines Corporation | Routing data communications packets in a parallel computer |
| US8909716B2 (en) | 2010-09-28 | 2014-12-09 | International Business Machines Corporation | Administering truncated receive functions in a parallel messaging interface |
| US9075759B2 (en) | 2010-11-05 | 2015-07-07 | International Business Machines Corporation | Fencing network direct memory access data transfers in a parallel active messaging interface of a parallel computer |
| US9069631B2 (en) | 2010-11-05 | 2015-06-30 | International Business Machines Corporation | Fencing data transfers in a parallel active messaging interface of a parallel computer |
| US8527672B2 (en) | 2010-11-05 | 2013-09-03 | International Business Machines Corporation | Fencing direct memory access data transfers in a parallel active messaging interface of a parallel computer |
| US9052974B2 (en) | 2010-11-05 | 2015-06-09 | International Business Machines Corporation | Fencing data transfers in a parallel active messaging interface of a parallel computer |
| US8832428B2 (en) | 2010-11-15 | 2014-09-09 | Trilliant Holdings Inc. | System and method for securely communicating across multiple networks using a single radio |
| US8949453B2 (en) | 2010-11-30 | 2015-02-03 | International Business Machines Corporation | Data communications in a parallel active messaging interface of a parallel computer |
| US8490112B2 (en) | 2010-12-03 | 2013-07-16 | International Business Machines Corporation | Data communications for a collective operation in a parallel active messaging interface of a parallel computer |
| US8484658B2 (en) | 2010-12-03 | 2013-07-09 | International Business Machines Corporation | Data communications in a parallel active messaging interface of a parallel computer |
| US8572629B2 (en) | 2010-12-09 | 2013-10-29 | International Business Machines Corporation | Data communications in a parallel active messaging interface of a parallel computer |
| US8650262B2 (en) | 2010-12-09 | 2014-02-11 | International Business Machines Corporation | Endpoint-based parallel data processing in a parallel active messaging interface of a parallel computer |
| US8775531B2 (en) | 2011-01-06 | 2014-07-08 | International Business Machines Corporation | Completion processing for data communications instructions |
| US8732229B2 (en) | 2011-01-06 | 2014-05-20 | International Business Machines Corporation | Completion processing for data communications instructions |
| WO2012097204A1 (en) | 2011-01-14 | 2012-07-19 | Trilliant Holdings, Inc. | Process, device and system for volt/var optimization |
| US8892850B2 (en) | 2011-01-17 | 2014-11-18 | International Business Machines Corporation | Endpoint-based parallel data processing with non-blocking collective instructions in a parallel active messaging interface of a parallel computer |
| WO2012103072A2 (en) | 2011-01-25 | 2012-08-02 | Trilliant Holdings, Inc. | Aggregated real-time power outages/restoration reporting (rtpor) in a secure mesh network |
| EP2673716B1 (en) | 2011-02-10 | 2017-09-13 | Trilliant Holdings, Inc. | Device and method for facilitating secure communications for utility-related data over a cellular network |
| US8825983B2 (en) | 2011-02-15 | 2014-09-02 | International Business Machines Corporation | Data communications in a parallel active messaging interface of a parallel computer |
| FR2972093B1 (en) * | 2011-02-28 | 2013-02-22 | Schneider Electric Ind Sas | METHOD AND SYSTEM OF COMMUNICATION BETWEEN A FIRST EQUIPMENT AND ONE OR MORE OTHER EQUIPMENTS |
| WO2012122310A1 (en) | 2011-03-08 | 2012-09-13 | Trilliant Networks, Inc. | System and method for managing load distribution across a power grid |
| US9001787B1 (en) | 2011-09-20 | 2015-04-07 | Trilliant Networks Inc. | System and method for implementing handover of a hybrid communications module |
| US8528004B2 (en) | 2011-11-07 | 2013-09-03 | International Business Machines Corporation | Internode data communications in a parallel computer |
| US8732725B2 (en) | 2011-11-09 | 2014-05-20 | International Business Machines Corporation | Managing internode data communications for an uninitialized process in a parallel computer |
| US8989017B2 (en) * | 2012-12-14 | 2015-03-24 | Intel Corporation | Network congestion management by packet circulation |
| US9479437B1 (en) * | 2013-12-20 | 2016-10-25 | Google Inc. | Efficient updates of weighted cost multipath (WCMP) groups |
| US11539611B2 (en) * | 2014-05-08 | 2022-12-27 | Microsoft Technology Licensing, Llc | Fine-grained network monitoring |
| US10320954B2 (en) * | 2017-02-03 | 2019-06-11 | Microsoft Technology Licensing, Llc | Diffusing packets to identify faulty network apparatuses in multipath inter-data center networks |
| US10818997B2 (en) | 2017-12-29 | 2020-10-27 | Vubiq Networks, Inc. | Waveguide interface and printed circuit board launch transducer assembly and methods of use thereof |
| CN117041150B (en) * | 2023-10-09 | 2024-01-23 | 苏州元脑智能科技有限公司 | Routing method, routing terminal and data transmission system |
Family Cites Families (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5031093A (en) * | 1986-12-22 | 1991-07-09 | Nec Corporation | System for establishing route by selecting minimum of time-independent link parameters of incremental values |
| US4905233A (en) * | 1987-11-23 | 1990-02-27 | Harris Corporation | Multiple path routing mechanism for packet communications network |
| US5088032A (en) * | 1988-01-29 | 1992-02-11 | Cisco Systems, Inc. | Method and apparatus for routing communications among computer networks |
| US5007052A (en) * | 1989-04-11 | 1991-04-09 | Metricom, Inc. | Method for routing packets by squelched flooding |
| GB8911395D0 (en) * | 1989-05-18 | 1989-07-05 | British Telecomm | Data communications network |
| US5115433A (en) * | 1989-07-18 | 1992-05-19 | Metricom, Inc. | Method and system for routing packets in a packet communication network |
| US4974224A (en) * | 1989-11-07 | 1990-11-27 | Harris Corporation | Distributed split flow routing mechanism for multi-node packet switching communication network |
| US5253161A (en) * | 1990-02-06 | 1993-10-12 | Paul Nemirovsky | Method for routing data in a near-optimal manner in a distributed data communications network |
| US5079768A (en) * | 1990-03-23 | 1992-01-07 | Metricom, Inc. | Method for frequency sharing in frequency hopping communications network |
| US5253248A (en) * | 1990-07-03 | 1993-10-12 | At&T Bell Laboratories | Congestion control for connectionless traffic in data networks via alternate routing |
| US5265092A (en) * | 1992-03-18 | 1993-11-23 | Digital Equipment Corporation | Synchronization mechanism for link state packet routing |
-
1994
- 1994-04-14 US US08/227,774 patent/US5488608A/en not_active Expired - Lifetime
-
1995
- 1995-04-11 WO PCT/US1995/004678 patent/WO1995028780A1/en not_active Application Discontinuation
- 1995-04-11 JP JP52713895A patent/JP3624222B2/en not_active Expired - Fee Related
- 1995-04-11 CN CN95192561.XA patent/CN1152383A/en active Pending
- 1995-04-11 CA CA002187926A patent/CA2187926A1/en not_active Abandoned
- 1995-04-11 EP EP95915683A patent/EP0755596A4/en not_active Ceased
Also Published As
| Publication number | Publication date |
|---|---|
| CN1152383A (en) | 1997-06-18 |
| EP0755596A1 (en) | 1997-01-29 |
| EP0755596A4 (en) | 1999-10-20 |
| JPH10501935A (en) | 1998-02-17 |
| US5488608A (en) | 1996-01-30 |
| JP3624222B2 (en) | 2005-03-02 |
| WO1995028780A1 (en) | 1995-10-26 |
| MX9604818A (en) | 1998-05-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA2187926A1 (en) | Method and system for routing packets in a packet communication network using locally constructed routine tables | |
| US5400338A (en) | Parasitic adoption of coordinate-based addressing by roaming node | |
| US5453977A (en) | Method for network configuration via third party query | |
| EP0455959B1 (en) | Method and system for routing packets in a packet communication network | |
| EP0599764B1 (en) | Distributed processing of route selection across networks and subnetworks | |
| US4939726A (en) | Method for routing packets in a packet communication network | |
| US8625496B2 (en) | Wireless network system and method for providing same | |
| CA2321918C (en) | Routing method for wireless and distributed systems | |
| US4811337A (en) | Distributed load sharing | |
| US7843920B2 (en) | Method and system for controlling communication network and router used in the network | |
| US6189044B1 (en) | Dynamic routing method for packet switched satellite communications | |
| EP2541976A1 (en) | Route Optimisation for Mobile Station Traffic Routing in Mesh Networks | |
| JPH0522345A (en) | Optimum management decision system for maximum transfer unit | |
| JP2002530014A (en) | Internet system and method for selecting the nearest server from a plurality of selection target servers | |
| KR100422992B1 (en) | How to Assign Subscriber Units to Visiting Gateways | |
| WO1999049686A2 (en) | Transmission of point-to-multipoint services to a destination area | |
| EP1185041A2 (en) | OSPF autonomous system with a backbone divided into two sub-areas | |
| US6674727B1 (en) | Distributed ring protocol and database | |
| EP1058427B1 (en) | Method and device for establishing a routing table in a communication network | |
| JP2001024700A (en) | Information delivery system, packet transmission medium in the information delivery system and method for delivering information | |
| JP2001522169A (en) | Telecommunications system | |
| MXPA96004818A (en) | Method and system for placing packages in a packet communication network using localme built-in building tables | |
| KR100311226B1 (en) | Method for selecting NNI Signaling Protocol in public ATM networks | |
| JPH1040193A (en) | Client/multiplexing server system | |
| JPH08139748A (en) | Broadcast communication processing method for store-and-forward switching device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request | ||
| FZDE | Discontinued |