WO2002056551A1 - Acheminement de paquets de donnees au-dessous du niveau ip dans un reseau de communication a commutation de paquets - Google Patents

Acheminement de paquets de donnees au-dessous du niveau ip dans un reseau de communication a commutation de paquets Download PDF

Info

Publication number
WO2002056551A1
WO2002056551A1 PCT/SE2002/000071 SE0200071W WO02056551A1 WO 2002056551 A1 WO2002056551 A1 WO 2002056551A1 SE 0200071 W SE0200071 W SE 0200071W WO 02056551 A1 WO02056551 A1 WO 02056551A1
Authority
WO
WIPO (PCT)
Prior art keywords
router
packet
path
connection
routing
Prior art date
Application number
PCT/SE2002/000071
Other languages
English (en)
Inventor
Hugo WIKSTRÖM
Niklas Forslund
Original Assignee
Xanten Ab
Nixanalog Ab
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
Priority claimed from SE0100119A external-priority patent/SE0100119D0/xx
Application filed by Xanten Ab, Nixanalog Ab filed Critical Xanten Ab
Publication of WO2002056551A1 publication Critical patent/WO2002056551A1/fr

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
    • H04L45/36—Backward learning
    • 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
    • H04L45/24—Multipath
    • H04L45/243—Multipath using M+N parallel active paths
    • 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
    • H04L45/50—Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
    • H04L45/502—Frame based
    • 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
    • H04L45/56—Routing software
    • H04L45/566—Routing instructions carried by the data packet, e.g. active networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/60—Software-defined switches
    • H04L49/602—Multilayer or multiprotocol switching, e.g. IP switching
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/25—Routing or path finding in a switch fabric
    • 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/3009—Header conversion, routing tables or routing tags

Definitions

  • the present invention relates to the field of communication networks and more specifically to a router, a communications network comprising such a router, a method and a computer program product according to the preamble of claim 1, 16, 17, 18 and 30 respectively.
  • a communications network is a group of computers that are connected by communications facilities for the purpose of providing computer users with an avenue of communicating and transferring information electronically.
  • a communications network can be a local-area network (LAN) consisting of only a few computers within a small area, or it can be a wide-area network (WAN) consisting of many computers distributed over a vast geographical area.
  • LAN local-area network
  • WAN wide-area network
  • a router is an intermediary device for expediting message delivery within a communications network.
  • a router receives messages and forwards them to their correct destinations via the most cfficiendy available route.
  • a router serves a somewhat different function by acting as a link among these several sets of LANs, enabling messages to be sent from one set of LANs to another.
  • Various computers within a network are coupled to a router through its ports (i.e., locations for passing data in and out of a data-processing device).
  • ports i.e., locations for passing data in and out of a data-processing device.
  • the router compares the destination address (address of the receiving computer) provided within the data packet to a stored address/port list. This address/port list indicates which port(s) within the router is associated with the receiving computer(s). The router then directs the data frame to the appropriate port(s) coupled to the receiving computer (s).
  • an address/port list may be provided to a router beforehand, or the router may develop the address/port list on a dynamic basis. Such address/port lists are stored within the router and are accessed upon the receipt of a data frame. The router then compares the destination address of the data frame to each item within the address/port list until a match is obtained. Generally, each new search through the address/port list begins at the top of the address/port list and proceeds sequentially through the destination addresses until a match is found. If there are a very large number of destination addresses in the address/port list, communications within the computer network may be slowed down considerably due to this bottleneck at the router. Furthermore, the routers will have to keep a huge list of addresses constantly updated. The time is now closing in to a point where the actual connection speed between the routers is faster than the routers can handle.
  • EP-A-0426911 discloses an example routing management system in which each node includes a dynamic routing table containing a plurality of machine identifiers and, for each, the next place in the network to which a message for that machine should be directed.
  • the system of EP-A-0426911 requires a database of machine listings, including update and routing information for each machine.
  • the update information identifies the parts of the system which need to be updated to maintain consistency if some part of the machine's database entry is changed, including information as to which nodes require their dynamic routing tables to be updated in response to a change to that entry. All relevant nodes are sent updated routing information. The amount of information that must be held by each node and the overhead in updating that information arc both considerable.
  • OSI Open Systems Interconnection
  • SNA Systems Network Architecture
  • the lower three layers of the OSI and SNA communication architectures include transmission subnetworks such as X.25 packet switching networks, LANs, ISDN, WANs, and other network and link layer protocols. Subnetworks will generally be divisible from the whole network into separate administrative units known as "cells", cell names generally being important for inter-cell communications.
  • the networks may be highly complex, with many intermediate nodes being involved in any data transmission between source and destination nodes.
  • Layer 1 of the architecture is the physical connections between adjacent nodes, wires or wireless along which electrical signals pass.
  • Layer 2 is the data link control layer, providing fixed path configurations (point-to- point connections, multipoint connections and LANs) and possibly link-layer flow control and link-layer error-recovery. Layer 2 may also provide multi-path routing between intermediate nodes
  • Layer 3 is the network layer and provides a subnetwork (e.g. LAN, ISDN) for multi-path routing between source and destination nodes and provides flow control within the subnetwork (e.g. multiplexing, segmenting). Layer 3 also provides internetworking links between the subnetworks.
  • the transport control layer 4 oversees communication across multiple underlying transport facilities. Source-to-destination transport reliability (e.g. by enciphering of data or sequence numbering) and flow control are provided by layer 4.
  • OSI layer 4 (and the top of layer 3) corresponds to the position in the layered structure of common communications protocols such as TCP/IP (Transmission Control Protocol/Internet Protocol suite of protocols).
  • Layer 5 is a data exchange layer providing a set of common signals used by applications for synchronization and regulation of the data exchange.
  • Layer 6 the presentation services layer, interprets API verbs and converts data where communicating end users require different syntax and formats.
  • Layer 7 is the layer providing immediate service support for applications (called the application services layer in OSI and transaction services layer in SNA). Layer 7 provides file transfer, directory services, store-and-forward messaging, and system management.
  • connection indicators are used as a path when routing a data packet, on a level below the IP level, from a source router to a destination router, a faster routing and a reduced amount of processing power in the network routers provided.
  • Figure 1 shows a schematic communications network comprising routers.
  • Figure 2 shows a router comprising a number of connections.
  • Figure 3 shows a complete path, which is described by a number of directions and a terminator.
  • Figure 4 illustrates a reverse path.
  • Figure 5 shows a packet comprising a path, payload data and a reverse path.
  • Figure 6 shows the packet to be sent from router A to router I when it has arrived to router A
  • Figure 7 shows the packet to be sent from router A to router I when it is sent from router A to router B.
  • Figure 8 shows the packet to be sent from router A to router I when sent from router B to router E.
  • Figure 9 shows the packet to be sent from router A to router I when it has been processed by router I and is handed over to the IP level.
  • Figure 10 shows the source IP address and the path to be stored in a list in a router.
  • Figure 11 shows an instruction path.
  • the present invention relates to a transmission protocol, which protocol applies to layer 2 and especially to layer 3 according to the above-mentioned layered architecture structure of networks. Instead of routing packets based on their destination address, packets are switched through the network based on the path between A and B.
  • the protocol is accordingly intended to work beneath the Internet Protocol (IP), which resides at layer 4.
  • IP Internet Protocol
  • Figure 1 shows a schematic communications network, using IP comprising the routers A-I.
  • Each router names it's connections, i.e. ports, with different binary numbers.
  • the number of bits used to name the connections at a router varies between the routers.
  • a router comprising many connections requires more bits than a router with only a few connections.
  • the router A has three connections, indicated by 111, 011, and 010 and router C has two connections indicated by 01 and 10.
  • all connection indicators of one router has the same number of bits.
  • a path is described by these direction indicators, for example the path between router A and D is 011,010, i.e. out from router A at connection number 011 leads to router B and out from router B at connection number 010 leads to router D.
  • the path is included in the packet header such that the first bits of the packet to be sent indicate the path to the destination.
  • the router When a packet arrives at a specific router, the router only has to look at the first bits of the packet to see through which connection the packet shall be forwarded, and remove these bits from the packet. As mentioned above, the number of bits depends on the number of connections at the specific router.
  • the router also adds the return path at the end of the packet, i.e. indicates the number of the connection through which the packet arrived to the router.
  • the path Since the router A originally sending the packet doesn't know the path to the destination router I, the path has to be found. This is performed by routing the first packet on the IP level in the same way as in traditional IP routers.
  • the low level protocol according to the invention adds the reverse path as the packet is routed through the network.
  • the destination router I associates the source IP address, i.e. A's IP address to the reverse path and adds them to a list in router I.
  • the destination IP address i.e. As IP address is checked against the list and the path back is found. The packet is then switched through the network based on that path.
  • the response packet When the response packet reaches the destination router A, it associates the source IP address, i.e. I's IP address to the obtained reverse path and adds them to router A's list. From this point all further packets between A and I will be switched through the network without the need for high level IP routing.
  • the source IP address i.e. I's IP address
  • Each direction is a binary number, a so-called direction indicator, telling the particular router in which direction to send the packet.
  • Direction indicators consisting of all zeros (000...0) and all ones (111...1) are reserved.
  • a direction with all zeros indicates that the packet is an instruction to the router (see error handling below).
  • a direction with all ones tells the router to use IP routing to determine where to send the packet. This is used on two different occasions, when the path is unknown and when the packet has reached it's final destination and shall be handed over to the protocol above.
  • a complete path is described by a number of directions and a terminator. This is illustrated in Figure 3.
  • the terminator can be used by the router to determine the length of the path descriptor, i.e. where in the message the path terminates.
  • the terminator is a number of ones and one zero at the end and the length of the terminator contains at least twice as many bits the maximum number of bits in a single connection indicator, which makes the terminator unique.
  • Figure 3 describes the path from router A to router I, via the routers B, E and G referred to in Figure 1. It is to be noted that, the last bits (two bits, in this example) in the path tell the destination router to hand the packet up to the IP level.
  • Figure 4 illustrates the reverse path, i.e. from router I to router A, via the routers G, E and B in Figure 1.
  • the reverse path is created in the same way, except that all bits are reversed, including the terminator.
  • the bits are reversed because the lengths of the individual destinations can vary and if added in normal bit order it would be impossible for the destination router to reverse the path back to normal.
  • the reverse terminator is unique in the same way as the non-reversed, if read backwards.
  • the router removes the direction indicator of the connection to the next router from the header of the packet.
  • the router also and adds the direction indicator, of the connection from which connection the packet arrived to the router, to the tail of the packet, before sending the packet to it's next destination.
  • a packet arriving to router G from router E and is to be routed to router I removes the direction indicator Oi l (connection out from router G) from the packet header and adds the direction indicator 001 (incoming connection number to router G.
  • the packet always stays the same length if all the connection indicators of a router contains the same number of bits.
  • the switching delay can be reduced to one modulation time (i.e. one bit), this is possible when the destination connection is not busy.
  • Figure 5 shows a packet comprising a path, payload data and a reverse path. To optimize switching speed the packets can have a fixed length.
  • Router A checks the destination IP address, at the IP level, i.e. the 4rd layer, which IP address is indicated in the packet header and finds that the packet shall be forwarded to router B. Router A adds the direction indicator of the connection through which it arrived to the router A, i.e. the path back, to the tail of the packet, i.e. Ill and sends the packet to B.
  • the packet now comprises an empty path, the terminator (T), the payload the reverse terminator (RT) and the reverse path 111.
  • the path back is in this case 111, i.e. all ones, since this is the final destination for a packet going in the opposite direction.
  • Router B receives the packet and finds an empty path. This triggers router B to ask the IP level for the destination. Router B finds that the packet shall be sent to router E. Router B leaves the path empty but adds the direction indicator of the path back, to the tail of the packet. I.e. 001 which is the connection number through which the packet arrived to router B. Router B sends the packet to router E with an empty path, T, the payload, RT and, the reverse path in reverse bit order. The path back is now RT111100.
  • Router E receives the packet and finds an empty path. This triggers router E to ask the IP level for the destination. Router E finds that the packet shall be sent to router G. Router E leaves the path empty but adds the direction indicator, of the path back, to the tail of the packet. I.e. 001 which is the connection number through which the packet arrived to router E. Router E sends the packet to router G with an empty path, T, the payload, RT and, the reverse path in reverse bit order. The path back is now RT111100100. Router G receives the packet and finds an empty path. This triggers router G to ask the IP level for the destination. Router E finds that the packet shall be sent to router I.
  • Router G leaves the path empty but adds the direction indicator, of the path back, to the tail of the packet. I.e. 001 which is the connection number through which the packet arrived to router G. Router G sends the packet to router I with an empty path, T, the payload, RT and, the reverse path in reverse bit order. The path back is now RT111100100100.
  • Router I receives the packet and finds an empty path. This triggers router I to ask the IP level for the destination. Router I finds that the packet has reached its destination. Router I now adds the path back, to the tail of the packet. I.e. 10 which is the connection number through which the packet arrived to router I. Router I creates a new entry in a list with the source IP address of the packet and the reverse path. In normal bit order the path back to A is lOOOlOOlOOllllT.
  • the packet can be routed on a level below the IP.
  • the path is picked up and added to the header of the packet.
  • Figure 6 shows such a packet inside router A.
  • Figure 7 shows the packet to be sent from router A to router I when it is sent from router A to router B. Before sending the packet out through the connection
  • router A removes the destination indicator 011 that points to B, referred to as 601 in Figure 6, and adds the reverse path, i.e. Ill, to the tail of the packet, referred to as 702 in Figure 7.
  • the reverse destination indication is 111 since this is the final destination of a packet in the opposite direction. (It is added in reverse bit order.)
  • Figure 8 shows the packet to be sent from router A to router I when sent from B to E.
  • router A Before sending the packet out through the connection Oil of router B to router E as indicated by the path, router A removes the destination indicator Oil that points to B, referred to as 701 in Figure 7, and adds the reverse path, i.e. 001, to the tail of the packet.
  • the reverse destination indicator is 100 when added in reverse order and is referred to as 802 in Figure 8.
  • FIG. 9 shows the packet to be sent from router A to router I when it has been processed by router I and is handed over to the IP level.
  • the reverse path now describes the path back to the source IP address of the packet.
  • the reverse path is extracted by looking for the reverse terminator from the tail of the packet and forward. When the terminator is found, the length of the reverse path can be determined. All bits in the reverse path are reversed to get a normal forward path. The result is stored in a list together with the source IP address of the packet.
  • Figure 10 shows the source IP address and path to be stored in a list in router I.
  • router I looks up the destination IP address in the list and finds the path to router A. The path is added to the header of the packet and the packet is switched through the network.
  • the network may comprise a way to remove old and invalid paths.
  • the first step to ensure that the paths in the list are valid is to introduce a timeout that removes paths that have not been used for a certain time. This forces the network to route the next packet to that IP address on the IP level.
  • a second mechanism uses the reverse path to send a message back to the first router that the path is invalid.
  • the connection 100 from router E to G in Figure 1 is down or overloaded.
  • a packet switched through the network from router A to I, with the path shown in Figure 6, would reach router E but since connection 100 is not available the packet can't be transmitted to router G.
  • router E sends a remove instruction back to router A, by using the reverse path in the packet from router A to router I, as shown in Figure 11. Note that the path ends with the reserved direction 000, informing router A to treat the packet as an instruction.
  • the method is implemented by means of a computer program product comprising the software code means for performing the steps of the method.
  • the computer program product is run on a computer stored in the routers within the communications network.
  • the computer program is loaded direcdy or from a computer usable medium, such as a floppy disc, a CD the Internet etc.

Abstract

L'invention se rapporte au domaine des réseaux de communication, et plus particulièrement à l'acheminement de données dans un réseau de communication. A cet effet, il faut mettre en oeuvre un procédé d'acheminement amélioré et faire appel à un réseau de communication qui assure un acheminement plus rapide et nécessite une quantité réduite de puissance de traitement au rapport aux routeurs de réseau. Les routeurs sont alors chargés de nommer ces connexions avec différents numéros binaires appelés indicateurs de connexion, qui tiennent lieu de trajet lorsqu'un paquet de données est acheminé à partir d'un routeur source vers un routeur de destination. Le paquet peut alors être acheminé en-dessous du niveau IP.
PCT/SE2002/000071 2001-01-16 2002-01-16 Acheminement de paquets de donnees au-dessous du niveau ip dans un reseau de communication a commutation de paquets WO2002056551A1 (fr)

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
US26116001P 2001-01-16 2001-01-16
SE0100119A SE0100119D0 (sv) 2001-01-16 2001-01-16 Method and arrangement in a communications network
SE0100119-7 2001-01-16
US60/261,160 2001-01-16

Publications (1)

Publication Number Publication Date
WO2002056551A1 true WO2002056551A1 (fr) 2002-07-18

Family

ID=26655373

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/SE2002/000071 WO2002056551A1 (fr) 2001-01-16 2002-01-16 Acheminement de paquets de donnees au-dessous du niveau ip dans un reseau de communication a commutation de paquets

Country Status (1)

Country Link
WO (1) WO2002056551A1 (fr)

Cited By (18)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2007035795A2 (fr) * 2005-09-19 2007-03-29 Qualcomm Incorporated Synchronisation d'etat de routeurs d'acces
WO2007035793A1 (fr) * 2005-09-19 2007-03-29 Qualcomm Incorporated Synchronisation d'état de routeurs d'accès
US7529239B2 (en) 2004-02-24 2009-05-05 Intellectual Ventures Holding 9 Llc Distributed dynamic routing
US7962142B2 (en) 2003-01-31 2011-06-14 Qualcomm Incorporated Methods and apparatus for the utilization of core based nodes for state transfer
US8509799B2 (en) 2005-09-19 2013-08-13 Qualcomm Incorporated Provision of QoS treatment based upon multiple requests
US8588777B2 (en) 1998-09-22 2013-11-19 Qualcomm Incorporated Method and apparatus for robust handoff in wireless communication systems
US8615241B2 (en) 2010-04-09 2013-12-24 Qualcomm Incorporated Methods and apparatus for facilitating robust forward handover in long term evolution (LTE) communication systems
US8830818B2 (en) 2007-06-07 2014-09-09 Qualcomm Incorporated Forward handover under radio link failure
US8886180B2 (en) 2003-01-31 2014-11-11 Qualcomm Incorporated Enhanced techniques for using core based nodes for state transfer
US8982778B2 (en) 2005-09-19 2015-03-17 Qualcomm Incorporated Packet routing in a wireless communications environment
US8983468B2 (en) 2005-12-22 2015-03-17 Qualcomm Incorporated Communications methods and apparatus using physical attachment point identifiers
US8982835B2 (en) 2005-09-19 2015-03-17 Qualcomm Incorporated Provision of a move indication to a resource requester
US9066344B2 (en) 2005-09-19 2015-06-23 Qualcomm Incorporated State synchronization of access routers
US9078084B2 (en) 2005-12-22 2015-07-07 Qualcomm Incorporated Method and apparatus for end node assisted neighbor discovery
US9083355B2 (en) 2006-02-24 2015-07-14 Qualcomm Incorporated Method and apparatus for end node assisted neighbor discovery
US9094173B2 (en) 2007-06-25 2015-07-28 Qualcomm Incorporated Recovery from handoff error due to false detection of handoff completion signal at access terminal
US9155008B2 (en) 2007-03-26 2015-10-06 Qualcomm Incorporated Apparatus and method of performing a handoff in a communication network
US9736752B2 (en) 2005-12-22 2017-08-15 Qualcomm Incorporated Communications methods and apparatus using physical attachment point identifiers which support dual communications links

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0329082A2 (fr) * 1988-02-17 1989-08-23 Nippon Telegraph And Telephone Corporation Commutateur à autoroutage et sa méthode de routage
US5613069A (en) * 1994-12-16 1997-03-18 Tony Walker Non-blocking packet switching network with dynamic routing codes having incoming packets diverted and temporarily stored in processor inputs when network ouput is not available
US5896379A (en) * 1996-08-26 1999-04-20 Motorola, Inc. Network node for packet switching with selective data processing and method therefor
US5928332A (en) * 1996-12-06 1999-07-27 Intel Corporation Communication network with reversible source routing that includes reduced header information being calculated in accordance with an equation
FR2779019A1 (fr) * 1998-05-19 1999-11-26 Canon Kk Procede et dispositif d'emission de donnees, procede et dispositif de reception de donnees

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0329082A2 (fr) * 1988-02-17 1989-08-23 Nippon Telegraph And Telephone Corporation Commutateur à autoroutage et sa méthode de routage
US5613069A (en) * 1994-12-16 1997-03-18 Tony Walker Non-blocking packet switching network with dynamic routing codes having incoming packets diverted and temporarily stored in processor inputs when network ouput is not available
US5896379A (en) * 1996-08-26 1999-04-20 Motorola, Inc. Network node for packet switching with selective data processing and method therefor
US5928332A (en) * 1996-12-06 1999-07-27 Intel Corporation Communication network with reversible source routing that includes reduced header information being calculated in accordance with an equation
FR2779019A1 (fr) * 1998-05-19 1999-11-26 Canon Kk Procede et dispositif d'emission de donnees, procede et dispositif de reception de donnees

Cited By (22)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8588777B2 (en) 1998-09-22 2013-11-19 Qualcomm Incorporated Method and apparatus for robust handoff in wireless communication systems
US8886180B2 (en) 2003-01-31 2014-11-11 Qualcomm Incorporated Enhanced techniques for using core based nodes for state transfer
US7962142B2 (en) 2003-01-31 2011-06-14 Qualcomm Incorporated Methods and apparatus for the utilization of core based nodes for state transfer
US7529239B2 (en) 2004-02-24 2009-05-05 Intellectual Ventures Holding 9 Llc Distributed dynamic routing
US11129062B2 (en) 2004-08-04 2021-09-21 Qualcomm Incorporated Enhanced techniques for using core based nodes for state transfer
US8982778B2 (en) 2005-09-19 2015-03-17 Qualcomm Incorporated Packet routing in a wireless communications environment
US9066344B2 (en) 2005-09-19 2015-06-23 Qualcomm Incorporated State synchronization of access routers
WO2007035793A1 (fr) * 2005-09-19 2007-03-29 Qualcomm Incorporated Synchronisation d'état de routeurs d'accès
US9313784B2 (en) 2005-09-19 2016-04-12 Qualcomm Incorporated State synchronization of access routers
WO2007035795A3 (fr) * 2005-09-19 2007-06-21 Qualcomm Inc Synchronisation d'etat de routeurs d'acces
WO2007035795A2 (fr) * 2005-09-19 2007-03-29 Qualcomm Incorporated Synchronisation d'etat de routeurs d'acces
US8509799B2 (en) 2005-09-19 2013-08-13 Qualcomm Incorporated Provision of QoS treatment based upon multiple requests
US8982835B2 (en) 2005-09-19 2015-03-17 Qualcomm Incorporated Provision of a move indication to a resource requester
US9078084B2 (en) 2005-12-22 2015-07-07 Qualcomm Incorporated Method and apparatus for end node assisted neighbor discovery
US8983468B2 (en) 2005-12-22 2015-03-17 Qualcomm Incorporated Communications methods and apparatus using physical attachment point identifiers
US9736752B2 (en) 2005-12-22 2017-08-15 Qualcomm Incorporated Communications methods and apparatus using physical attachment point identifiers which support dual communications links
US9083355B2 (en) 2006-02-24 2015-07-14 Qualcomm Incorporated Method and apparatus for end node assisted neighbor discovery
US9155008B2 (en) 2007-03-26 2015-10-06 Qualcomm Incorporated Apparatus and method of performing a handoff in a communication network
US8830818B2 (en) 2007-06-07 2014-09-09 Qualcomm Incorporated Forward handover under radio link failure
US9094173B2 (en) 2007-06-25 2015-07-28 Qualcomm Incorporated Recovery from handoff error due to false detection of handoff completion signal at access terminal
US9131410B2 (en) 2010-04-09 2015-09-08 Qualcomm Incorporated Methods and apparatus for facilitating robust forward handover in long term evolution (LTE) communication systems
US8615241B2 (en) 2010-04-09 2013-12-24 Qualcomm Incorporated Methods and apparatus for facilitating robust forward handover in long term evolution (LTE) communication systems

Similar Documents

Publication Publication Date Title
WO2002056551A1 (fr) Acheminement de paquets de donnees au-dessous du niveau ip dans un reseau de communication a commutation de paquets
US5996021A (en) Internet protocol relay network for directly routing datagram from ingress router to egress router
JP4744723B2 (ja) マルチプロトコル冗長ルータプロトコルサポート方法及び装置
EP0871309B1 (fr) Dispositif de routage et procédé de transfert de trâmes utilisant commutation de trâmes dans la couche de liaison de données
US7336682B2 (en) Network architecture and methods for transparent on-line cross-sessional encoding and transport of network communications data
CN102714629B (zh) 通信系统、转发节点、路径管理服务器以及通信方法
US5309433A (en) Methods and apparatus for routing packets in packet transmission networks
AU716133B2 (en) Hash-based translation method and apparatus with multiple level collision resolution
EP0836781B1 (fr) Procede et dispositif de synchronisation de transmissions de donnees sur des liaisons a la demande dans un reseau
EP0937353B1 (fr) Acheminement dans un element de reseau reparti multicouches
US6683885B1 (en) Network relaying apparatus and network relaying method
EP1713214B1 (fr) Procédé d'acheminement multiprotocole
US20020012352A1 (en) Internet protocol handler for telecommunications platform with processor cluster
EP1158729A2 (fr) Moteur de recherche empilable
US20040223502A1 (en) Apparatus and method for combining forwarding tables in a distributed architecture router
US6212185B1 (en) Multiple network address resolution
US6611874B1 (en) Method for improving routing distribution within an internet and system for implementing said method
US7096281B2 (en) Efficient connectivity between multiple topology subnets via common connection network
US6658003B1 (en) Network relaying apparatus and network relaying method capable of high-speed flow detection
JP3449541B2 (ja) データパケット転送網とデータパケット転送方法
US6438133B1 (en) Load balancing mechanism for a translational bridge environment
US6373845B1 (en) Multilayer ATM communication equipment
US6654369B1 (en) Method for directing the route of a cell transmitting a network
US6785273B1 (en) Traffic engineering for an application employing a connectionless protocol on a network
Esaki et al. High speed datagram delivery over Internet using ATM technology

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ OM PH PL PT RO RU SD SE SG SI SK SL TJ TM TN TR TT TZ UA UG US UZ VN YU ZA ZM ZW

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 69(1) EPC OF 291003

122 Ep: pct application non-entry in european phase
NENP Non-entry into the national phase

Ref country code: JP

WWW Wipo information: withdrawn in national office

Country of ref document: JP