WO2000013376A1 - Communication de donnees a redondance des chemins - Google Patents

Communication de donnees a redondance des chemins Download PDF

Info

Publication number
WO2000013376A1
WO2000013376A1 PCT/US1999/019488 US9919488W WO0013376A1 WO 2000013376 A1 WO2000013376 A1 WO 2000013376A1 US 9919488 W US9919488 W US 9919488W WO 0013376 A1 WO0013376 A1 WO 0013376A1
Authority
WO
WIPO (PCT)
Prior art keywords
packet
node
path
packets
label
Prior art date
Application number
PCT/US1999/019488
Other languages
English (en)
Other versions
WO2000013376A9 (fr
Inventor
Gary A. Nelson
Original Assignee
Integral Access, Inc.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Integral Access, Inc. filed Critical Integral Access, Inc.
Priority to JP2000568223A priority Critical patent/JP2002524920A/ja
Priority to EP99949554A priority patent/EP1029407A1/fr
Publication of WO2000013376A1 publication Critical patent/WO2000013376A1/fr
Publication of WO2000013376A9 publication Critical patent/WO2000013376A9/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/22—Arrangements for detecting or preventing errors in the information received using redundant apparatus to increase reliability
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/42—Loop networks
    • 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
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/24—Multipath
    • 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]

Definitions

  • This invention relates generally to the field of telecommunications and, more particularly, to the providing of increased reliability in telecommunications networks.
  • telecommunications service providers typically provide a single dedicated circuit between two endpoints. Some of these dedicated circuits are used to carry voice traffic and some dedicated circuits are used to carry data traffic.
  • Telecommunications service providers have also offered what is referred to as 1+1 redundant service, which is the provision of two or more circuits between the same endpoints.
  • One of the circuits is used for communication, and if that circuit fails, another circuit is used to communicate.
  • Such allocation of circuits is useful because it provides an alternative path for the telecommunications traffic, and insures that a dedicated circuit will be available to carry the traffic.
  • Such allocation is inefficient and expensive, however, since one of the circuits is always inactive.
  • the redundant circuits are allocated along different physical wire paths that are strung or laid along different physical routes. In this way a physical failure on one wire, for example due to an accidental wire cut, only affects one dedicated circuit, and does not affect the remaining redundant circuits.
  • a telecommunications service provider traditionally offers such redundant service which both the active circuit and the redundant circuits have equal bandwidth.
  • a service provider might offer 1+1 service for a T-l customer by providing two or more T-l service circuits. This is inefficient and expensive if the customer does not use the full capacity of the service circuit or if the customer requires 1+1 redundant capability for only for a portion of the customer's traffic that is significantly less than the capability of the service circuit.
  • the present invention addresses the need for redundancy in telecommunications circuits while reducing the inefficiencies associated with the use of such circuits.
  • Summary of the Invention A method and system for providing redundant communications uses a packet-switched network to provide redundant service.
  • the method and system can provide redundant service only for the traffic that requires redundant service, without the bandwidth waste associated with an unused dedicated circuit.
  • the method and system provides the additional capability of automatic use of a functioning circuit when one of the communications paths fails, so that the traffic is unaffected by the failure.
  • the invention features a method for redundant packet data communication.
  • the method includes transmitting a first packet and a second packet.
  • the first packet has a first packet identifier, first packet data, and a first label indicating a receiver and a first path.
  • the second packet has a second packet identifier and payload identical to the first packet identifier and payload.
  • the second packet also has a second label indicating the receiver and a second path.
  • the first packet is received via the first path and the second packet is received via the second path.
  • the method includes determining from the first packet identifier and the second packet identifier that the packet payloads are identical, and discarding one of the packets.
  • the invention features a system for redundant packet data communication.
  • the system includes a transmitter for transmitting a first packet and a second packet.
  • the first packet has a first packet identifier and payload, first packet data, and a first label indicating a receiver and a first path.
  • the second packet has a second packet identifier and payload identical to the first packet identifier and payload.
  • the second packet also has a second label indicating the receiver and a second path.
  • the system also includes a receiver for receiving the first packet via said first path and the second packet via said second path. The receiver determines from the first packet identifier and the second packet identifier that the first packet payload and second packet payload are identical, and discards one of the packets having identical identifier and payload.
  • the invention features a method for communicating over a network.
  • the method includes adding an identifier to a data packet, communicating a copy of the packet to a destination via a first network route, communicating a copy of the packet to said destination via a second network route, and using, at the destination, the copy of the of the packet that arrives first at the destination.
  • the invention features a ring of network nodes for redundantly communicating label-switched data packets that have a label and data.
  • the ring includes at least three nodes, with each node in communication with two other nodes such that the communication path formed by the at least three nodes is a ring.
  • Each node is connected to each adjacent node by a communications link for transmitting label-switched data packets from the node to the adjacent node.
  • Each node is also in communication with each adjecent node with a communications link for receiving label-switched data packets from the adjacent node.
  • a first one of the nodes sends two label-switched data packets with identical data to a second one of the nodes substantially simultaneously in two different directions around the ring in response to the labels in the label-switched data packets.
  • Embodiments of this aspect of the invention include the following features.
  • the second node uses the first of each packet with identical data received and discards the second.
  • the second node preferentially uses packets received from one direction around the ring.
  • the label-switched data packets comprise a plurality of micropackets.
  • FIG. 1 is a block diagram of an embodiment of a packet-switched network capable of providing redundant service constructed according to the invention
  • FIG. 2 is a block diagram of an embodiment of a unidirectional packet-switched ring capable of providing redundant service constructed according to the invention
  • FIG. 3 is a block diagram of the MLPPP extensions to the PPP protocol utilized in an embodiment of the invention.
  • FIG. 4 is a block diagram of the encapsulation of a data packet in an embodiment of the invention.
  • FIG. 5 is a flowchart of procedure followed by a transmitting node in an embodiment of the invention;
  • FIG. 6 is a flowchart of procedure followed by a receiving node in an embodiment of the invention;
  • FIG. 7 is a flowchart of the procedure followed by a primary flow receiver in an embodiment of the invention.
  • FIG. 8 is a flowchart of the procedure followed by a protection flow receiver in an embodiment of the invention.
  • the invention relates to redundant service that is provided by use of a packet switched communications network. Both voice and data are sent redundantly by different paths in the packet switched network.
  • the use of a packet switched network allows the redundant packets to share the network bandwidth with other, non-redundant packets. If, as in one embodiment, the packet switched network is a label switched network, paths through the network are specified by the association of a label with each path.
  • a packet-switched network 2 includes network nodes A-J.
  • each node A-J is a label switch node, and the network is a label switched network.
  • network nodes make forwarding decisions based on a label associated with each packet.
  • the label associated with each packet indicates that the packet is a member of a particular forwarding equivalence class ("FEC"), which is the set (or "class") of packets that are treated the same way by a network node, regardless of the packets' ultimate network destination.
  • FEC forwarding equivalence class
  • a packet with one label is forwarded to the destination associated with a particular FEC, and a packet with another label is forwarded to the destination associated with another FEC, which may be the same or a different destination.
  • the labels may be "swapped" by a label switch node, meaning that the label of an incoming packet may be changed before the packet is forwarded.
  • technologies that use label switching include, but are not limited to, such technologies as Multiprotocol Label Switching ("MPLS") as described in the Internet Engineering Task Force's Network Working Group Internet Drafts, Cell Switching Router (“CSR”) technology as developed by Toshiba, IP Switching as developed by Ipsilon, Tag Switching as developed by Cisco Systems, and Aggregate Route-based IP Switching (“ARIS”) as developed by International Business Machines Corporation.
  • MPLS Multiprotocol Label Switching
  • CSR Cell Switching Router
  • IP Switching as developed by Ipsilon
  • Tag Switching as developed by Cisco Systems
  • ARIS Aggregate Route-based IP Switching
  • connections between the nodes are not a limitation on the scope of the invention.
  • the connections between the nodes include, but are not limited to such communications technologies as voice-band modems, RS- 232 serial, xDSL, ISDN, Ethernet, Firewire, ATM, DS-l/E-1, GR-303, and SONET/SDH connections.
  • nodes within the same network are connected with different types of physical connections.
  • redundant service is described using the network of FIG. 1. Redundant service is provided by sending duplicate packets from node A to node D substantially simultaneously.
  • one of the duplicate packets is transmitted from node A to node D via the path of nodes A-B-C- D.
  • Another of the duplicate packets is transmitted from node A to node D via the path of nodes A-G-F-E-D. If both paths are functional, node D will receive two copies of the same packet, one via path A-B-C-D, and the other via path A-G-F-E-D.
  • the duplicate packets contain an identifier so that node D can use one of the duplicate packets and ignore or discard the other duplicate packet. Because the line is not dedicated, the packet-switched connections between the nodes can carry other traffic besides the redundant traffic sent between nodes A and D.
  • node A requires redundant service for some data, and does not require redundant transmission for other data, only the data that requires redundant service will be sent in duplicate.
  • the other data can be sent via path A-B-C-D, path A-G-F-E-D, or even some other path.
  • node D receives duplicate packets.
  • the first (in time) duplicate packet that is received is used, and other duplicate packets are discarded.
  • some data packets may be used that are communicated via one path, while other packets may be communicated via another, redundant route.
  • the packets that arrive first are used. If there is a failure along one of the paths, the traffic will continue to be communicated uninterrupted, because the packets from the other path will continue to arrive. Those packets from the other, operational path will be considered the first to arrive, and so they will be used.
  • node D waits until both duplicates are received before using one of the packets.
  • Node D compares the packets to verify that they are identical before using one of the packets. In this way, node D verifies the integrity of the packets. If one of the packets is not received by a certain deadline or timeout, then just the first packet received is used.
  • node D will use the first of each of the duplicate packets that is received, and will also monitor whether all duplicates have been received, to determine if there is a network problem along any of the paths. If a network problem is detected, various actions may be taken.
  • a network problem is detected when a number of duplicate packets are not received, and a system manger is alerted to the problem.
  • node D upon detecting a network problem, node D will attempt to correct the problem by requesting that the failed redundant communication be continued via another path. Depending on the configuration of the network, this may be accomplished by sending an alert or a request to the source, which is Node A in this example, or by sending an alert or request to another node.
  • the number of redundant paths is not a limitation of the scope of the invention.
  • the description above can be extended to include additional duplicate packets transmitted over additional duplicate paths. For example, in one embodiment a third duplicate is sent over a third path, and in one such embodiment, the first duplicate received of the three is used. As another example, in another embodiment, ten duplicates of each packet are sent over ten paths.
  • a ring of nodes W, X, Y, Z are each connected to their neighbors in the ring by two unidirectional links.
  • node W has a unidirectional connection WX to node X by which node W can transmit data to node X
  • node W has a unidirectional connection XW from node X by which node W can receive data from node X.
  • the connections from each node in the ring to its two neighbors are by a different wire route, so that a cable cut will not cut off communication with both neighbors at the same time.
  • the cable(s) carrying connection WX and XW are strung or laid in a different physical place or route than the cable(s) carrying connections ZW and WZ.
  • each unidirectional connection is a Synchronous Optical Network (“SONET") connection.
  • SONET Synchronous Optical Network
  • each connection is the connection protocol PPP running over a SONET OC-3 connection on fiberoptic cable.
  • the connection is a PPP connection running over a Synchronous Digital Hierarchy (“SDH”) connection over fiberoptic cable at rate STM-1 (155Mb/s). While these embodiments are specific examples, other connection protocols, connections and physical links are within the spirit and scope of the invention.
  • the nodes are label switches capable of receiving labeled packets and passing the labeled packets on to the next switch in the ring.
  • the nodes are also capable of directing the packets out of the ring at each node.
  • node W is capable of passing packets out of the ring to node w'.
  • Each node W-Z can transmit packets to each other node in either direction.
  • packets from packets from network w' to network y' can be transmitted from node W to node Y by the path W-WX-X-XY-Y.
  • Node W can also transmit packets to node Y by the path W-WZ-Z-ZY-Y.
  • data to be transmitted with redundant service from one node to another is divided up into packets, an identifier is associated with each packet, and duplicate copies of each packet are sent at approximately the same time in both directions around the ring, so that a copy of each packet is sent via each of the two paths around the ring from the source node to the destination node.
  • packets from node W to node Y are sent both by the path W-WX-X-XY-Y and the path W-WZ-Z-ZY-Y.
  • packets sent from node Z to node Y are sent by path Z-ZY-Y and by path Z-ZW-W- WX-X-XY-Y.
  • the receiving node will receive two copies of each packet.
  • the identifier associated with each packet indicates to the receiver which of the packets received are duplicates of each other.
  • the receiving node uses the first packet received, and discards or ignores the second copy of the packet when it is received.
  • the duplicate packet is used.
  • an identifier is included in each data packet.
  • the identifier allows the receiver to track whether duplicate copies are received for each packet.
  • the identifier enables the receiver to use a packet and to ignore or discard the duplicate.
  • the identifier is included in the link layer protocol. In other embodiments, other identifiers are associated with packets.
  • Point to Point Protocol is used as the link protocol between nodes, and the PPP Multilink Protocol (“MP”) extensions are used to include identifiers in the PPP packets.
  • PPP is a link layer protocol that includes a header 106 including address information 110, control information 112, and a packet type indicator 1 14.
  • the Multilink PPP (“MLPPP”) extensions include a four byte header 102, 104 which includes a twenty-four bit sequence number. This sequence number is used to identify the packets. As described in the Internet Engineering Task Force Request for Comments (“RFC”) No. 1990, which specifies Multilink PPP, the sequence numbers are intended to be used to order packet fragments that are transmitted over multiple channels. In the context of redundant transmission, the MLPPP headers are used as individual packet identifiers, so that duplicate packets can be matched.
  • RRC Internet Engineering Task Force Request for Comments
  • redundant communications are implemented on a label switched network, such as a network that supports multiprotocol label switching ("MPLS").
  • MPLS multiprotocol label switching
  • Multiprotocol Label Switching networks labels are associated with data heading to the same destination.
  • Forwarding which is the passing of packets from node to node, is simplified by use of short fixed length labels to identify the forwarding equivalence class. Forwarding may require simple functions such as looking up a label in a table, swapping labels, and possibly decrementing and checking a time to live counter, but is much less complicated than routing of the sort that occurs in Internet Protocol routers. This is because the path is set up once with the assignment of labels.
  • MPLS also provides for efficient explicit switching. With such explicit switching, the source node sets up a path through the network.
  • a label distribution protocol in which the nodes communicate their positions in the network, and adjacent nodes agree to forward packets with a particular label. Once the connection has been set up, the act of transmitting a packet with the appropriate label sends the packet to its destination along that specified path.
  • the paths can be set up in a number of ways, depending on the label-switching implementation. Each path is created by the creation of a forwarding equivalence class ("FEC") for that path. Insofar as a forwarding decision is concerned, all packets that get mapped into the same FEC are indistinguishable.
  • FEC forwarding equivalence class
  • a label distribution protocol is used to map labels to paths.
  • a label-switched node uses the label distribution protocol to inform other nodes of the bindings of each label to a particular FEC.
  • MPLS architecture thus allows a node to request from its next hop a label binding for a particular forwarding equivalence class.
  • the transmitter initiates the creation of at least two paths to a destination, a first path and a second path, through the network.
  • Each path has an associated label. Transmission of a packet with one label will send a packet to the destination via one path, and transmission of a packet with another label will send a packet to the destination via another path.
  • the paths travel along completely different physical wire routes, so that a wire cut or other network error between nodes will not affect both paths. In another embodiment, there is some overlap in the physical wire routes of the paths.
  • the data that is to be transmitted redundantly can be any sort of data.
  • the data to be transmitted already will be encapsulated in higher level protocol packets.
  • the data can be encapsulated in high-level protocols, such as TCP/IP or other ISO Layer 3 and above protocols, but that is not a requirement.
  • the data in the data packet 100 is not relevant to the scope of the invention, any data can be transmitted redundantly.
  • the data is divided into PPP packets 110 by an MLPPP protocol stack such that each packet has a PPP header 106, MLPPP information 104, a PPP Checksum 108, and an associated sequence number 102.
  • MLPPP protocol stack such that each packet has a PPP header 106, MLPPP information 104, a PPP Checksum 108, and an associated sequence number 102.
  • two copies 120, 121 of each MLPPP packet are transmitted, one with a first label 125 specifying the first path, and one with a second label 126 specifying the second path.
  • the packets 120, 121 are transmitted from label-switched node to label-switched node until they reach their destination.
  • the receiver can identify which packets came from which path, since the packets have different labels.
  • the receiver can also determine which packets are duplicates, since the duplicates have the same MLPPP sequence number. Referring to FIG.
  • a network node receives data to be transmitted redundantly from a source (STEP 150).
  • the source is a module within the node.
  • the source is another computer or node in communication with the network node.
  • the data is in the form of packets.
  • the data is in various other forms, and requires division into packets. The data is divided up into packets, if necessary, and an identifier is attached to each packet (STEP 151). The identifier allows the receiving node to determine which packets are duplicates. For example, in one embodiment, the identifier is a packet number. The packets, with identifier, are then inserted as duplicate packets into packets having different path information (STEP 152).
  • each packet is encapsulated in a label-switched packet having a different label.
  • Each different label directs the packet along a different path.
  • the packets are transmitted (STEP 153).
  • the label-switched packets with different labels will be transmitted along different paths.
  • a receiver receives data in the form of a packet from a redundant source (STEP 160), for example from the source of FIG. 5.
  • the receiver extracts the identifier from the packet (STEP 161).
  • the receiver determines whether the packet is a duplicate of a packet already received (STEP 162). In one embodiment, the receiver makes this determination by comparing the identifier to a list of identifiers already received.
  • f the packet is a duplicate the receiver records the arrival of the duplicate packet (STEP 163). This step is useful only to the extent that the receiving node tracks the communications performance of the various paths. For example, in one embodiment the receiver records only the arrival of the duplicate packet.
  • the receiver records information indicating that the duplicate packet arrived, and how long the duplicate packet arrived after the first packet.
  • other information about the duplicate packet is recorded.
  • recording can included, but is not limited to storing the information in a list or database and/or transmitting the information to another node for reporting to a system operator, compilation of statistics, or storage in a list or database on another system. .
  • the duplicate packet is discarded (STEP 164). Alternatively, in one embodiment, the duplicate packet is stored.
  • the step of recording information about the duplicate packet is useful for tracking the status and performance of the redundant communications paths.
  • the recording step, STEP 163, is not performed.
  • the packet will be used (STEP 165).
  • the packet is sent to a different module.
  • the packet is stored until all the packets in a set are received, and then the data is recombined. Also, in one embodiment, information and statistics about the receipt of the packet may be recorded, for comparison to the duplicate packets and to determine when all the packets in a set have been received.
  • one path is determined to be the primary path, and another path is determined to be a protection path.
  • a receiver will preferentially use data from one path, and will use data from another path only to "fill in" packets that are missing. If the error rate associated with data transmission on the primary path reaches a predetermined threshold, the receiver will use the protection path as the primary path, and report the error to a system operator. Still referring to FIG. 7, the receiver receives packets from the primary path (STEP 170) and extracts the identifiers (STEP 171). The receiver determines if a packet is missing from the data transmitted over the primary path (STEP 172).
  • the receiver uses the packet from the protection flow (STEP 174). The error is reported or logged (STEP 175). An error rate counter is incremented (STEP 176), and if the error rate is greater than a predetermined threshold (STEP 177), then the receiver will switch to using a protection path as the primary path (STEP 178). The path switch can also cause a notification or logging of the event. Referring to FIG. 8, the receiver receives the data transmitted over the protection path
  • StepP 190 and extracts the identifiers from the packets (STEP 191).
  • the receiver will determine if packets are missing from the data transmitted over the protection path (STEP 192), and if all packets have been received, discard the duplicates (STEP 193). If packets are missing, the receiver will report or log the error condition (STEP 194), and may also track the frequency of the errors for reporting or logging.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

L'invention concerne un système à redondance de communication de données en paquets, comprenant un émetteur assurant l'émission d'un premier et d'un second paquets. Le premier paquet comporte une première étiquette désignant un récepteur et un premier chemin. Le premier paquet possède également un premier identificateur de paquet et une charge utile. Le second paquet comporte une seconde étiquette désignant un récepteur et un second chemin. Le second paquet possède également un second identificateur de paquet et une charge utile sensiblement similaires à l'identificateur et à la charge utile du premier paquet. Le système comprend également un récepteur destiné à recevoir le premier paquet via le premier chemin. Le récepteur reçoit le second paquet via le second chemin. Le récepteur est capable de déterminer, à partir des identificateurs du premier et du second paquets, si les charges utiles des paquets sont sensiblement similaires, et le cas échéant, de supprimer l'un des paquets.
PCT/US1999/019488 1998-08-28 1999-08-26 Communication de donnees a redondance des chemins WO2000013376A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
JP2000568223A JP2002524920A (ja) 1998-08-28 1999-08-26 冗長経路データ通信
EP99949554A EP1029407A1 (fr) 1998-08-28 1999-08-26 Communication de donnees a redondance des chemins

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US14346498A 1998-08-28 1998-08-28
US09/143,464 1998-08-28

Publications (2)

Publication Number Publication Date
WO2000013376A1 true WO2000013376A1 (fr) 2000-03-09
WO2000013376A9 WO2000013376A9 (fr) 2001-04-12

Family

ID=22504201

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US1999/019488 WO2000013376A1 (fr) 1998-08-28 1999-08-26 Communication de donnees a redondance des chemins

Country Status (3)

Country Link
EP (1) EP1029407A1 (fr)
JP (1) JP2002524920A (fr)
WO (1) WO2000013376A1 (fr)

Cited By (27)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1213879A2 (fr) * 2000-12-08 2002-06-12 Alcatel Canada Inc. Mise en oeuvre d'une commutation par etiquette multiprotocole (MPLS) sur une plate-forme ATM
WO2003028336A2 (fr) * 2001-09-26 2003-04-03 Siemens Aktiengesellschaft Reception de telegrammes de donnees dans des systemes de communication a voies de reseau redondantes
EP1282095A3 (fr) * 2001-08-03 2003-10-15 Siemens Gebäudesicherheit GmbH & Co. OHG Procédé de communication radio dans un système d'alarme
US6751746B1 (en) * 2000-07-31 2004-06-15 Cisco Technology, Inc. Method and apparatus for uninterrupted packet transfer using replication over disjoint paths
EP1526690A2 (fr) * 2003-10-16 2005-04-27 Alcatel Système et procédé pour fournir des communications dans un réseau en utilisant une architecture redondante de commutation
EP1560380A1 (fr) * 2004-01-28 2005-08-03 Lucent Technologies Inc. Propagation de multiples copies d'un paquet IP
WO2007040417A1 (fr) * 2005-10-03 2007-04-12 Motorola, Inc. Procede et appareil pour la communication d'un message dans un reseau maille
EP1938562A2 (fr) * 2005-08-22 2008-07-02 Telcordia Technologies, Inc. Mobilite transparente pour un dispositif a interface multiple dans un environnement sans fil colocalise
US7463588B1 (en) * 2004-02-18 2008-12-09 Woven Systems, Inc. Mechanism for enabling load balancing to be achieved in a loop-free switching path, reverse path learning network
EP2148473A1 (fr) * 2008-07-22 2010-01-27 ABB Research Ltd Noeuds de commutation pour réseaux à forte disponibilité
US7693115B2 (en) 2001-03-26 2010-04-06 Lg Electronic, Inc. Method of transmitting or receiving a data packet in packet data communication system using a hybrid automatic repeat request
EP2197142A1 (fr) * 2008-12-15 2010-06-16 Alcatel Lucent Système et procédé de commutation de protection de paquets
US7774461B2 (en) 2004-02-18 2010-08-10 Fortinet, Inc. Mechanism for determining a congestion metric for a path in a network
US7869428B2 (en) 2004-07-14 2011-01-11 Nippon Telegraph And Telephone Corporation Packet transmission method and packet transmission device
US7900115B2 (en) * 2001-09-26 2011-03-01 Siemens Aktiengesellschaft Replacement messages for identifying and preventing errors during the transmission of realtime-critical data
US8023494B2 (en) 2006-11-06 2011-09-20 Nec Corporation Communication service continuation system, communication service continuation method, and program thereof
US8130644B2 (en) 2004-02-18 2012-03-06 Fortinet, Inc. Mechanism for enabling load balancing to be achieved in a loop-free switching path, reverse path learning network
KR101120322B1 (ko) 2004-06-18 2012-03-06 에이저 시스템즈 인크 데이터 보호 방법, 네트워크 프로세서, 멀티서비스 액세스노드 및 라우터
US8223634B2 (en) 2004-02-18 2012-07-17 Fortinet, Inc. Mechanism for implementing load balancing in a network
JP2012169791A (ja) * 2011-02-10 2012-09-06 Fujitsu Ltd 経路生成方法、中継装置、および経路生成プログラム
EP2523401A1 (fr) * 2011-05-10 2012-11-14 Cassidian Finland OY Réseaux virtuels dans un réseau physique
EP2523400A1 (fr) * 2011-05-10 2012-11-14 Cassidian Finland OY Noeud de réseau intermédiaire dans un système de télécommunication
WO2014035497A1 (fr) * 2012-08-28 2014-03-06 Aoptix Technologies, Inc. Évaluation et correction de données transmises
CN104040932A (zh) * 2012-01-17 2014-09-10 网络洞察力知识产权公司 一种网络通信冗余方法
US20140369182A1 (en) * 2011-09-19 2014-12-18 Giuseppe De Blasio System and method for selective protection switching
EP3021527A1 (fr) * 2012-02-17 2016-05-18 Myongji University Industry and Academia Cooperation Foundation Procédé de réduction de trafic de réseau
CN109714272A (zh) * 2018-12-29 2019-05-03 苏州睿安芯微电子有限公司 一种增强网络稳定性及实时性的方法

Families Citing this family (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6356544B1 (en) * 1999-05-03 2002-03-12 Fujitsu Network Communications, Inc. SONET add/drop multiplexer with packet over SONET capability
JP3880482B2 (ja) 2002-08-14 2007-02-14 エヌイーシーコンピュータテクノ株式会社 二重化ネットワーク計算機システム及び計算機システムのネットワーク二重化方法
JP2008301517A (ja) * 2003-02-19 2008-12-11 Intec Netcore Inc ルータ装置及びパケット転送制御方法
JP4074268B2 (ja) * 2003-08-22 2008-04-09 日本電信電話株式会社 パケット転送方法及び転送装置
JP4074304B2 (ja) * 2004-11-18 2008-04-09 日本電信電話株式会社 パケット転送方法及びパケット転送装置
JP2007013511A (ja) * 2005-06-30 2007-01-18 Oki Telecommunication Systems Co Ltd パケット通信システムおよびパケット中継装置
JP5366841B2 (ja) * 2010-01-20 2013-12-11 日本電信電話株式会社 パケット伝送方法およびパケット伝送装置
JP6043593B2 (ja) * 2012-11-02 2016-12-14 エヌ・ティ・ティ・コミュニケーションズ株式会社 パケット転送装置、監視方法、及びプログラム
JP6474094B2 (ja) * 2014-10-16 2019-02-27 日本電気株式会社 ネットワークシステム、ネットワーク処理方法、情報処理装置、情報処理方法および情報処理プログラム
JP2023031246A (ja) * 2021-08-23 2023-03-08 メラノックス テクノロジーズ、リミテッド 冗長データ・パケットを生成及び排除する通信装置

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0468813A1 (fr) * 1990-07-27 1992-01-29 Nec Corporation Système ATM de communication à anneau double
US5187709A (en) * 1990-05-08 1993-02-16 Caterpillar Inc. Fault tolerant serial communications network
US5559959A (en) * 1993-09-16 1996-09-24 Siemens Aktiengesellschaft Method for transmitting message cells via redundant virtual path pairs of an atm communication network

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5187709A (en) * 1990-05-08 1993-02-16 Caterpillar Inc. Fault tolerant serial communications network
EP0468813A1 (fr) * 1990-07-27 1992-01-29 Nec Corporation Système ATM de communication à anneau double
US5559959A (en) * 1993-09-16 1996-09-24 Siemens Aktiengesellschaft Method for transmitting message cells via redundant virtual path pairs of an atm communication network

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
KAO B ET AL: "AGGRESSIVE TRANSMISSION OF SHORT MESSAGES OVER REDUNDANT PATHS", IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS,US,IEEE INC, NEW YORK, vol. 5, no. 1, 1 January 1994 (1994-01-01), pages 102 - 109, XP000433594, ISSN: 1045-9219 *
ORDA A ET AL: "ROUTING WITH PACKET DUPLICATION AND ELIMINATION IN COMPUTER NETWORKS", IEEE TRANSACTIONS ON COMMUNICATIONS,US,IEEE INC. NEW YORK, vol. 36, no. 7, 1 July 1988 (1988-07-01), pages 860 - 866, XP000570702, ISSN: 0090-6778 *
SY K -B K ET AL: "SOURCE ROUTING FOR LOCAL AREA NETWORKS", PROCEEDINGS OF THE GLOBAL TELECOMMUNICATIONS CONFERENCE AND EXHIBITION(GLOBECOM),US,NEW YORK, IEEE, vol. -, 1985, pages 3411 - 3415, XP000619287 *

Cited By (61)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6751746B1 (en) * 2000-07-31 2004-06-15 Cisco Technology, Inc. Method and apparatus for uninterrupted packet transfer using replication over disjoint paths
US7260083B2 (en) 2000-12-08 2007-08-21 Alcatel Canada Inc.; MPLS implementation on an ATM platform
EP1213879A3 (fr) * 2000-12-08 2003-06-25 Alcatel Canada Inc. Mise en oeuvre d'une commutation par etiquette multiprotocole (MPLS) sur une plate-forme ATM
US8018939B2 (en) 2000-12-08 2011-09-13 Alcatel Lucent MPLS implementation of an ATM platform
EP1213879A2 (fr) * 2000-12-08 2002-06-12 Alcatel Canada Inc. Mise en oeuvre d'une commutation par etiquette multiprotocole (MPLS) sur une plate-forme ATM
US7693115B2 (en) 2001-03-26 2010-04-06 Lg Electronic, Inc. Method of transmitting or receiving a data packet in packet data communication system using a hybrid automatic repeat request
US7706334B2 (en) 2001-03-26 2010-04-27 Lg Electronics Inc. Method of transmitting or receiving a data packet in packet data communication system using hybrid automatic repeat request
US7706333B2 (en) 2001-03-26 2010-04-27 Lg Electronics Inc. Method of transmitting or receiving a data packet in packet data communication system using hybrid automatic repeat request
EP1282095A3 (fr) * 2001-08-03 2003-10-15 Siemens Gebäudesicherheit GmbH & Co. OHG Procédé de communication radio dans un système d'alarme
US7900115B2 (en) * 2001-09-26 2011-03-01 Siemens Aktiengesellschaft Replacement messages for identifying and preventing errors during the transmission of realtime-critical data
WO2003028336A3 (fr) * 2001-09-26 2003-07-03 Siemens Ag Reception de telegrammes de donnees dans des systemes de communication a voies de reseau redondantes
WO2003028336A2 (fr) * 2001-09-26 2003-04-03 Siemens Aktiengesellschaft Reception de telegrammes de donnees dans des systemes de communication a voies de reseau redondantes
US7428250B2 (en) 2001-09-26 2008-09-23 Siemens Aktiengesellschaft System and associated method for receiving data telegrams in communication systems having redundant network paths
US7376133B2 (en) 2003-10-16 2008-05-20 Alcatel-Lucent System and method for providing communications in a network using a redundant switching architecture
EP1526690A3 (fr) * 2003-10-16 2007-05-23 Alcatel Lucent Système et procédé pour fournir des communications dans un réseau en utilisant une architecture redondante de commutation
EP1526690A2 (fr) * 2003-10-16 2005-04-27 Alcatel Système et procédé pour fournir des communications dans un réseau en utilisant une architecture redondante de commutation
US7321551B2 (en) 2004-01-28 2008-01-22 Lucent Technologies Inc. Propagation of a plurality of copies of an internet protocol packet
KR101123498B1 (ko) * 2004-01-28 2012-03-26 알카텔-루센트 유에스에이 인코포레이티드 인터넷 프로토콜 패킷의 다수의 사본 전달 방법 및 장치
EP1560380A1 (fr) * 2004-01-28 2005-08-03 Lucent Technologies Inc. Propagation de multiples copies d'un paquet IP
US8130644B2 (en) 2004-02-18 2012-03-06 Fortinet, Inc. Mechanism for enabling load balancing to be achieved in a loop-free switching path, reverse path learning network
US8223634B2 (en) 2004-02-18 2012-07-17 Fortinet, Inc. Mechanism for implementing load balancing in a network
US9825866B2 (en) 2004-02-18 2017-11-21 Fortinet, Inc. Selecting among multiple concurrently active paths through a network
US9276861B2 (en) 2004-02-18 2016-03-01 Fortinet, Inc. Selecting among multiple concurrently active paths through a network
US7774461B2 (en) 2004-02-18 2010-08-10 Fortinet, Inc. Mechanism for determining a congestion metric for a path in a network
US8917604B2 (en) 2004-02-18 2014-12-23 Fortinet, Inc. Performing rate limiting within a network
US8873424B2 (en) 2004-02-18 2014-10-28 Fortinet, Inc. Adaptive load balancing
US7463588B1 (en) * 2004-02-18 2008-12-09 Woven Systems, Inc. Mechanism for enabling load balancing to be achieved in a loop-free switching path, reverse path learning network
US8660007B2 (en) 2004-02-18 2014-02-25 Fortinet, Inc. Performing rate limiting within a network
US8565115B2 (en) 2004-02-18 2013-10-22 Fortinet, Inc. Adaptive load balancing
US8374089B2 (en) 2004-02-18 2013-02-12 Fortinet, Inc. Performing rate limiting within a network
US8339987B2 (en) 2004-02-18 2012-12-25 Fortinet, Inc. Determining a congestion metric for a path in a network
US8331227B2 (en) 2004-02-18 2012-12-11 Fortinet, Inc. Determining link failure within a network
KR101120322B1 (ko) 2004-06-18 2012-03-06 에이저 시스템즈 인크 데이터 보호 방법, 네트워크 프로세서, 멀티서비스 액세스노드 및 라우터
US7869428B2 (en) 2004-07-14 2011-01-11 Nippon Telegraph And Telephone Corporation Packet transmission method and packet transmission device
US8625588B2 (en) 2004-07-14 2014-01-07 Nippon Telegraph And Telephone Corporation Packet transmission method and packet transmission device
EP1938562A2 (fr) * 2005-08-22 2008-07-02 Telcordia Technologies, Inc. Mobilite transparente pour un dispositif a interface multiple dans un environnement sans fil colocalise
EP1938562A4 (fr) * 2005-08-22 2013-03-06 Telcordia Tech Inc Mobilite transparente pour un dispositif a interface multiple dans un environnement sans fil colocalise
WO2007040417A1 (fr) * 2005-10-03 2007-04-12 Motorola, Inc. Procede et appareil pour la communication d'un message dans un reseau maille
EP1919136B1 (fr) * 2006-11-06 2015-02-25 NEC Corporation Système et procédé de maintien de service de communication
US8023494B2 (en) 2006-11-06 2011-09-20 Nec Corporation Communication service continuation system, communication service continuation method, and program thereof
US8582424B2 (en) 2008-07-22 2013-11-12 Abb Research Ltd Ring coupling nodes for high availability networks
EP2148473A1 (fr) * 2008-07-22 2010-01-27 ABB Research Ltd Noeuds de commutation pour réseaux à forte disponibilité
WO2010010120A1 (fr) * 2008-07-22 2010-01-28 Abb Research Ltd Nœuds de couplage d’anneau pour réseaux à haute disponibilité
WO2010069829A1 (fr) * 2008-12-15 2010-06-24 Alcatel Lucent Système et procédé de commutation de protection de paquet
CN102292930A (zh) * 2008-12-15 2011-12-21 阿尔卡特朗讯 用于分组保护交换的系统和方法
EP2197142A1 (fr) * 2008-12-15 2010-06-16 Alcatel Lucent Système et procédé de commutation de protection de paquets
JP2012169791A (ja) * 2011-02-10 2012-09-06 Fujitsu Ltd 経路生成方法、中継装置、および経路生成プログラム
WO2012152787A1 (fr) * 2011-05-10 2012-11-15 Cassidian Finland Oy Réseaux virtuels dans un réseau physique
CN103650434B (zh) * 2011-05-10 2018-05-15 空中客车防卫及太空有限公司 用于支持物理网络内的虚拟网络的方法、系统和设备
CN103650434A (zh) * 2011-05-10 2014-03-19 卡斯蒂安芬兰有限公司 物理网络内的虚拟网络
WO2012152788A1 (fr) * 2011-05-10 2012-11-15 Cassidian Finland Oy Noeud de réseau intermédiaire dans un système de télécommunication
EP2523400A1 (fr) * 2011-05-10 2012-11-14 Cassidian Finland OY Noeud de réseau intermédiaire dans un système de télécommunication
EP2523401A1 (fr) * 2011-05-10 2012-11-14 Cassidian Finland OY Réseaux virtuels dans un réseau physique
US9668150B2 (en) * 2011-09-19 2017-05-30 Alcatel Lucent System and method for selective protection switching
US20140369182A1 (en) * 2011-09-19 2014-12-18 Giuseppe De Blasio System and method for selective protection switching
CN104040932A (zh) * 2012-01-17 2014-09-10 网络洞察力知识产权公司 一种网络通信冗余方法
EP3136653A1 (fr) * 2012-02-17 2017-03-01 Myongji University Industry and Academia Cooperation Foundation Procédé de réduction de trafic de réseau
EP3021527A1 (fr) * 2012-02-17 2016-05-18 Myongji University Industry and Academia Cooperation Foundation Procédé de réduction de trafic de réseau
US9094163B2 (en) 2012-08-28 2015-07-28 Aoptix Technologies, Inc. Assessment and correction of transmitted data
WO2014035497A1 (fr) * 2012-08-28 2014-03-06 Aoptix Technologies, Inc. Évaluation et correction de données transmises
CN109714272A (zh) * 2018-12-29 2019-05-03 苏州睿安芯微电子有限公司 一种增强网络稳定性及实时性的方法

Also Published As

Publication number Publication date
EP1029407A1 (fr) 2000-08-23
JP2002524920A (ja) 2002-08-06
WO2000013376A9 (fr) 2001-04-12

Similar Documents

Publication Publication Date Title
EP1029407A1 (fr) Communication de donnees a redondance des chemins
US20020112072A1 (en) System and method for fast-rerouting of data in a data communication network
US6680912B1 (en) Selecting a routing direction in a communications network using a cost metric
US7796511B2 (en) Self-routed layer 4 packet network system and method
US7075932B2 (en) Communication device for selecting route of packet
US7957324B2 (en) Utilizing bandwidth in ring network using path cost and protection techniques
US6865149B1 (en) Dynamically allocated ring protection and restoration technique
EP1111860B1 (fr) Commutation automatique de protection utilisant une redondance au niveau du lien supportant la commutation d'étiquettes multiprotocole
US6925054B1 (en) Network path protection
CN100397088C (zh) 在利用标签交换的环形网中提供故障保护的方法和系统
US8139478B1 (en) Recovery method for an optical network
US20060013210A1 (en) Method and apparatus for per-service fault protection and restoration in a packet network
US20030031126A1 (en) Bandwidth reservation reuse in dynamically allocated ring protection and restoration technique
US20080304407A1 (en) Efficient Protection Mechanisms For Protecting Multicast Traffic in a Ring Topology Network Utilizing Label Switching Protocols
US20080279103A1 (en) Network Availability Enhancement Technique for Packet Transport Networks
KR100840136B1 (ko) 예비 접속들을 위한 다이내믹하게 변경된 메트릭들을 이용한 트래픽 네트워크 흐름 제어
WO2001067685A2 (fr) Commutateur de routage destine au reacheminement du trafic du a la detection d'une liaison defaillante
KR20060048725A (ko) 패킷 스위치 통신 네트워크에서 빠른 앤드-투-앤드 복구를제공하기 위한 방법 및 장치
US20010019536A1 (en) Line restoring method and packet transmission equipment
US20030065815A1 (en) Equivalent switching method for transmission devices in mpls networks
CN100428738C (zh) 无连接的分组交换通信系统
Lohne et al. Mechanisms for OAM on MPLS in large IP backbone networks

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): JP

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE

ENP Entry into the national phase

Ref country code: JP

Ref document number: 2000 568223

Kind code of ref document: A

Format of ref document f/p: F

WWE Wipo information: entry into national phase

Ref document number: 1999949554

Country of ref document: EP

121 Ep: the epo has been informed by wipo that ep was designated in this application
WWP Wipo information: published in national office

Ref document number: 1999949554

Country of ref document: EP

AK Designated states

Kind code of ref document: C2

Designated state(s): JP

AL Designated countries for regional patents

Kind code of ref document: C2

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE

COP Corrected version of pamphlet

Free format text: PAGES 1-11, DESCRIPTION, REPLACED BY NEW PAGES 1-11; DUE TO LATE TRANSMITTAL BY THE RECEIVING OFFICE

WWW Wipo information: withdrawn in national office

Ref document number: 1999949554

Country of ref document: EP