WO2001067662A2 - Method and system for operation of a resilient closed communication network without a dedicated protection network segment - Google Patents
Method and system for operation of a resilient closed communication network without a dedicated protection network segment Download PDFInfo
- Publication number
- WO2001067662A2 WO2001067662A2 PCT/IB2001/001251 IB0101251W WO0167662A2 WO 2001067662 A2 WO2001067662 A2 WO 2001067662A2 IB 0101251 W IB0101251 W IB 0101251W WO 0167662 A2 WO0167662 A2 WO 0167662A2
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- data packet
- traffic volume
- routes
- distributing station
- available traffic
- Prior art date
Links
Classifications
-
- 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
- H04L12/437—Ring fault isolation or reconfiguration
Definitions
- the present invention relates to a method and system for operation of a resilient closed communication network without a dedicated protection network segment.
- the invention uses a plurality of devices and software to provide a resilient closed communication network.
- WDM Widelength Division Multiplexing
- Fiber optic network systems have been used widely in the area of communications. Their applications include: (1) a long-haul telecommunication systems on land and at see, such as ocean-spanning submarine cables and national backbone networks, to carry digitized signals simultaneously over a long distance; (2) interoffice trunks that carry many telephone conversations simultaneously between local and regional telephone switching facilities; (3) connections to Internet service providers; and (4) local-area networks.
- Fiber optic network systems are vulnerable to a failure due to a breaking of an optical fiber. For example, fibers can be accidentally cut by operators not aware of their presence. Aerial cables are broken by falling branches and errant cranes. Submarine cables are cut by fishermen engaged in deep-sea fishing activities or by anchors.
- a failure can have severe consequences in that a very high number of network users can be deprived of an information flow.
- some systems rerouted the traffic to alternative communication systems, such as satellite communication systems, in case of a failure.
- satellite communication systems cannot handle a large amount of traffic handled by high-capacity fiber optic network systems.
- some fiber optic communication systems rely on a dedicated protection ring or network segment, to which the traffic is switched from a failed working communication ring or network segment.
- Protection rings or network segments provisioned for a dynamic restoration of service need provide a similar magnitude of capacity as working rings or network segments to serve as an effective backup or spare links for ensuring network survivability. This means that as much as a half of an available network capacity need be set aside as a protection against a network failure.
- the present invention is directed to a method and system for operation of a resilient closed communication network without a dedicated protection network segment that substantially obviates one or more of the problems due to limitations and disadvantages of the related art.
- the method for operating a resilient closed communication network with at least one communication ring includes the step of receiving a data packet from a first external network at a first distributing station connected to the resilient closed communication network.
- the method also includes the step of identifying a second distributing station connected to the resilient closed communication network from which the data packet is to be forwarded to a second external network and the step of determining functioning routes from the first distributing station to the second distributing station. It further includes the step of selecting an optimal route among the functioning routes and the step of sending the data packet from the first distributing station to the second distributing station using the optimal route.
- the invention includes a method of operating a resilient closed communication network, which includes at least one communication ring and a first and a second distributing stations. Both the first and the second distributing stations are interconnected by the at least one communication ring and include a router and a packet distributor.
- the method includes the steps of receiving a data packet from a first external network at a first router in the first distributing station, forwarding the data packet from the first router to a first packet distributor in the first distributing station, and identifying a network address of a second router in the second distributing station from which the data packet is to be forwarded to a second external network.
- the method includes the steps of determining an identification number of a second packet distributor in the second distributing station, appending the identification number of the second packet distributor to the data packet, and determining functioning routes from the first distributing station to the second distributing station.
- the method also includes the steps of selecting an optimal route among the functioning routes and sending the data packet from the first distributing station to the second distributing station using the optimal route.
- the invention in another aspect, includes a resilient closed communication network, which includes a first communication ring and at least two distributing stations interconnected by the first communication ring.
- Each distributing station includes means for receiving a data packet from an external network or from another distributing station, means for identifying a destination distributing station for the data packet, means for appending the identification number of the destination distributing station to the data packet, and means for determining functioning routes to the destination distributing station.
- the distributing station further includes means for selecting an optimal route among the functioning routes and means for forwarding the data packet to an external network after removing the identification number from the data packet or to a next distributing station.
- the invention includes a resilient closed communication network, which includes a first communication ring and at least two distributing stations interconnected by the first communication ring.
- Each distributing station includes means for receiving a data packet from an external network or from another distributing station, means for identifying a destination distributing station for the data packet, means for appending the identification number of the destination distributing station to the data packet, and means for determining functioning routes to the destination distributing station.
- the distributing station further includes means for selecting an optimal route among the functioning routes, means for appending a route segment data for the optimal route to the data packet, and means for forwarding the data packet to an external network after removing the identification number and the route segment data from the data packet or to a next distributing station based on the route segment data.
- the invention includes a resilient closed communication network, which includes a first communication ring and at least two distributing stations interconnected by the first communication ring.
- Each distributing station includes a router capable of receiving a data packet from an external network and forwarding a data packet to the external network. It also includes a packet distributor with means for receiving a data packet from the router or another distributing station, means for identifying a destination distributing station of the data packet, means for appending the identification number of the destination distributing station to the data packet, and means for determining functioning routes to the destination distributing station.
- the packet distributor further includes means for selecting an optimal route among the functioning routes and means for forwarding the data packet to the router or to another distributing station.
- the invention includes a resilient closed communication network with a first communication ring and at least two distributing stations interconnected by the first communication ring.
- Each distributing station includes a router capable of receiving a data packet from an external network and forwarding a data packet to the external network. It also includes a packet distributor with means for receiving a data packet from the router or another distributing station, means for identifying a destination distributing station of the data packet, means for appending the identification number of the destination distributing station to the data packet, and means for determining functioning routes to the destination distributing station.
- the packet distributor further includes means for selecting an optimal route among the functioning routes, means for appending a route segment data for the optimal route to the data packet, and means for forwarding the data packet to the router or to another distributing station.
- FIG. 1 is a diagram of a prefened embodiment of a resilient closed communication network of the present invention
- FIG. 2 is a diagram depicting one embodiment of the distributing stations of the resilient closed communication network of FIG. 1;
- FIG. 3 is a diagram depicting another embodiment of the distributing stations of the resilient closed communication network of FIG. 1;
- FIG. 4 is a flow chart depicting one embodiment of one aspect of an operation performed by a distributing station of the present invention
- FIG. 5 is a flow chart depicting one embodiment of another aspect of an operation performed by a distributing station of the present invention
- FIG. 6 depicts one embodiment of a data structure used by a distributing station to sort data packets as anticipated by the present invention
- FIG. 7 depicts one embodiment of a data packet with an identification number as anticipated by the present invention
- FIG. 8 depicts another embodiment of a data packet with an identification number and a route segment data as anticipated by the present invention
- FIG. 9 is a flow chart depicting one embodiment of an operation performed by a distributing station of the present invention.
- FIG. 10 is a diagram depicting another embodiment of a resilient closed communication network of the present invention.
- FIG. 11 is a flow chart depicting one embodiment of a process used to select optimal route candidates as anticipated by the present invention.
- FIG. 12 is a flow chart depicting one embodiment of a process used to choose an optimal route as anticipated by the present invention.
- FIG. 13 is a diagram depicting one embodiment of a distributing station with a quality of control (QOS) system.
- QOS quality of control
- FIG. 14 is flow chart depicting one embodiment of an operation performed by a QOS system as anticipated by the present invention.
- one embodiment of a resilient closed communication network 100 includes a communication ring 101 and four distributing stations 106, 107, 108, and 109.
- the four distributing stations are interconnected by the communication ring 101.
- Each distributing station is also connected to an external network and has a unique identification number.
- the distributing station 106 has an identification number A and is connected to an external network 102.
- the distributing stations 107, 108, and 109 have identification numbers B, C, and D, respectively, and are connected to external networks 103, 104, and 105, respectively.
- FIG. 2 depicts one embodiment of a distributing station 200 used in a resilient closed communication network of the present invention.
- the distributing station 200 is connected to a communication ring 201. It is also connected to an external network 202. It includes a router 203 and a packet distributor 204.
- the router 203 is capable of receiving a data packet from the external network 202. It also forwards a data packet received from the packet distributor 204 to the external network 202.
- the packet distributor 204 receives a data packet from the router 203 or from another distributing station in the resilient closed communication network. It also forwards a data packet to the router 203 or to another distributing station in the resilient closed communication network.
- Connections between routers and packet distributors belonging to the same distributing stations need belong to the same network segment.
- their IP addresses have the same network and sub-network IP addresses.
- connections between a router and a corresponding packet distributor in the distributing stations 106, 107, 108 and 109 of FIG. 1 share the same network and sub-network IP addresses.
- connections among packet distributors within the resilient closed communication network do not have to belong to the same network segment.
- FIG. 3 shows another embodiment of a distributing station 300 used in a resilient closed communication network of the present invention.
- the distributing station 300 is particularly suitable for a use in ocean-spanning submarine fiber optic communication networks.
- the distributing station 300 may be used at landing points of ocean-spanning submarine fiber optic communication networks.
- ocean-spanning submarine fiber optic communication networks set aside a dedicated protection network segment to deal with a network failure.
- the distributing station 300 enables a network to effectively handle a network failure without relying on a dedicated protection network segment. In other words, the distributing station 300 eliminates a need to set aside a dedicated protection network segment within large-scale ocean-spanning submarine fiber optic communication networks, thus resulting in more efficient utilization of the networks.
- the distributing station 300 is connected to a communication ring 301, which is a fiber optic ring.
- the distributing station 300 is also connected to an external network 302. It includes a router 303, a packet distributor 304, and a submarine cable adopter 305.
- the router 304 is capable of receiving a data packet from the external network 302 or from the packet distributor 304.
- the packet distributor 304 receives a data packet from the router 303 or from another distributing station via the submarine cable adapter 305. It sends a data packet to the router 303 or to another distributing station via the submarine cable adapter 305.
- FIG. 3 features the submarine cable adopter 305 inside the distributing station 300, the submarine cable adopter 305 may reside outside the distributing station 300 as a separate component.
- FIGS. 2 and 3 While the distributing stations depicted in FIGS. 2 and 3 feature a router and a packet distributor, it is not necessary to have both a router and a packet distributor. Those skilled in the art would know that one could implement operations performed by a router and a packet distributor in one device. For example, existing routers, such as those currently used in a closed communication network, may be programmed to implement the resilient closed communication network of the present invention.
- FIG. 4 depicts one embodiment of one aspect of an operation performed by a distributing station that receives a data packet from its external network.
- the operation depicted in FIG. 4 may be implemented using computer programs that run on devices within the distributing station, such as a router and a packet distributor.
- the distributing station receives a data packet from an external network at step 401.
- a router is used at step 401.
- a network address of a destination distributing station is extracted from the data packet.
- a destination distributing station is a station from which the data packet is to be forwarded out of the resilient closed communication network to an external network.
- a network address of the destination distributing station may be an IP address of a router inside the destination distributing station.
- an identification number for the data packet is determined based on the network address of the destination distributing station. While the network address of the destination distributing station may be used as an identification number, it is preferable to assign a short unique identification number to each distributing station within the resilient closed communication network.
- Each distributing station usually maintains a table containing an identification number and a network address of each distributing station within the resilient closed communication network.
- a packet distributor typically performs steps 402 and 403.
- the data packet is sorted based on the identification number determined in step 403. While such sorting is not necessary, it is recommended to increase a performance of a distributing station.
- a packet distributor is used during the sorting step.
- each packet distributor may maintain a list of distributing cases.
- FIG. 6 shows a list of distributing cases 600, 601, and 602 for the packet distributor in the distributing station 108 in FIG. 1.
- the three distributing cases 600, 601, and 602 conesponds to the three possible destination distributing stations for a data packet entering into the distributing station 108 from the external network 104, namely the distributing stations 106, 107, and 109 or A, B, and D.
- a data packet that has A as its identification number for example, is put in the distributing case A 600.
- the distributing case B 601 is used for data packets with an identification number B
- the distributing case D 602 is used for data packets with an identification number D.
- an optimal route is determined. Optimization factors considered in determining an optimal route includes an available traffic volume, an actual distance value, and a preference value.
- An available traffic volume indicates a utilization level of a route.
- An actual distance value represents a length of a route.
- a preference value represents a preference or policy of a network operator. The three factors are discussed below in depth using one embodiment of the step 405 as illustrated in FIGS. 11 and 12. Although all three factors are used to determine an optimal route in the embodiment illustrated in FIGS. 11 and 12, it is not required to do so.
- the identification number is appended to the data packet.
- the identification number may be appended as a header 700 to the data packet 701.
- the size of a header depends on the number of distributing stations in a resilient closed communication network. For the network in FIG. 1, the header need be at least two-bit long. Alternatively, the identification number may be appended as a tailer to a data packet or using an IP tunneling method.
- the data packet is sent to the destination distributing station using the optimal route determined in step 405. When using the distributing stations shown in FIGS. 2 and 3, a packet distributor performs steps 405 through 407.
- the data packet is forwarded to an external network connected to the destination distributing station.
- a packet distributor in the destination distributing station receives the data packet and forwards it to a router in the destination distributing station. Then the router forwards the data packet to the external network.
- FIG. 5 depicts an operation performed by a distributing station that receives a data packet from another distributing station in a resilient closed communication network of the present invention.
- the distributing station receives a data packet from another distributing station.
- it compares the identification number appended to the data packet with its own identification number. If they are the same, the distributing station is the destination distributing station for the data packet and thus forwards the data packet to the external network at step 506.
- steps 502 through 505 are performed by a packet distributor in the distributing station.
- a packet distributor forwards the data packet to a router in the same distributing station and then the router forwards it to the external network.
- the data packet is forwarded to a next distributing station at step 504.
- the next distributing station must be different from the distributing station from which the data packet was received.
- a packet distributor performs step 504.
- FIG. 8 shows a data packet 801 with an identification number 800 and a route segment data 803.
- a route segment data is a list of a plurality of route segment numbers 803a, 803b, etc.
- the identification number 800 is appended to the data packet 801 as a header, and the route segment data 803 as a trailer. It is not necessary to identify a route segment data 803 for a resilient closed communication network with one communication ring, such as one shown in FIG. 1.
- a route segment data 803, however, is needed for a resilient closed communication network with at least one distributing station connected to more than one communication lines, such as one shown in FIG. 10.
- a resilient closed communication network 1000 includes a communication ring 1001 and two communication lines 1002 and 1011. It also includes four distributing stations 1007, 1008, 1009, and 1010. The distributing stations 1007, 1008, 1009, and 1010 are connected to external networks, 1003, 1004, 1005, and 1006, respectively.
- the four distributing stations divide the communication ring 1001 into four route segments 1001a, 1001b, 1001c, and lOOld.
- the communication lines 1002 and 1011 have one route segment 1002 and 1011. Each route segment is given a route segment number and each distributing station maintains information on route segment numbers for all the route segments within the resilient closed communication network.
- the route segment data 803 consisting of route segment numbers is appended to the data packet 801 as a tailer.
- the route segment data 803 is appended before the data packet leaves a distributing station in which its optimal route is determined. It may be added along with the identification number 800.
- a route segment data may be added as a header, a tailer, or using an IP tunneling method.
- FIG. 9 illustrates how a data packet with both an identification number and a route segment data is processed by a distributing station.
- a route segment data is a list containing route segment numbers of the optimal route in a reverse order and is appended to the data packet as a tailer as shown in FIG. 8.
- a distributing station receives a data packet with an identification number and a route segment data from another distributing station.
- the distributing station checks whether its identification number is the same as the identification number appended to the data packet. If so, it removes the identification number from the data packet and forwards the data packet to an external network.
- steps 902 through 907 are typically performed by a packet distributor and step 908 is performed using both a packet distributor and a router.
- the process illustrated in FIG. 9 is further explained using an example.
- the example uses a resilient closed communication network shown in FIG. 10 and a distributing station shown in FIG. 2.
- a data packet enters the resilient closed communication network via the external network 1003.
- the data packet is, thus, received by a router in the distributing station A and is forwarded to a packet distributor for processing.
- the packet distributor first determines the destination packet distributor for the data packet, which, we assume, is the distributing station B. If the packet distributor in the distributing station A 1007 determines that an optimal route between the distributing station A 1007 and the distributing station B 1008 consists of route segments 100 Id, 1001c, and 1001b, a route segment data is a list containing 1001c and 1001b.
- the route segment data is appended to the data packet as a tailer.
- the identification number B is also appended to the data packet as a header.
- the data packet is then sent to the distributing station D 1010 using the route segment 100 Id.
- the packet distributor At the distributing station D 1010, the packet distributor first compares its identification number with the identification number contained in the header of the data packet. Since they are different, it extracts a route segment number 1001c from the route segment data appended to the data packet. After removing the extracted route segment number from the data packet, it sends the data packet to the distributing station C 1009 using the route segment 1001c.
- the packet distributor in the distributing station C 1009 receives the data packet and determines that its identification number is different from the identification number in the header of the data packet. It extracts the route segment number 1001b from the route segment data and then removes it. At this point, all the route segment numbers are removed. In other words, the data packet no longer has a tailer. Then, the packet distributor in the distributing station C 1009 forwards the data packet to the distributing station B 1008 using the route segment 1001b. The packet distributor in the distributing station B 1008, after determining that its identification number is the same as the identification number contained in the data packet, removes the identification number and forwards the data packet to the router in the distributing station B 1008. Finally, the router forwards the data packet to the external network 1004.
- FIG. 11 is a flow chart illustrating how optimal route candidates are selected.
- a packet distributor performs the operation illustrated in FIG. 11.
- a distributing station maintains a routing table including all available routes between it and the other distributing stations in a resilient closed communication network.
- a packet distributor typically maintains such a routing table.
- a distributing station may maintain a separate routing table for each distributing case. In other words, each distributing case has a routing table listing all available routes to the corresponding distributing station.
- a distributing station finds available routes to a destination distributing station by accessing a routing table at step 1102.
- the distributing station determines which of the available routes are functional by electrically checking a connection of route segments.
- Route segment connection information is communicated among the distributing stations in the resilient closed communication network.
- a private network address such as a private IP address
- each packet distributor maintains a inter-distributor communication route table, which contains a list of routes to be used to send route segment connection information to the other packet distributors within the resilient closed communication network.
- the inter-distributor communication route table may contain one or more routes to a destination packet distributor.
- the inter-distributor communication route table is typically maintained by a network administrator and its entries remain the same unless changed by the network administrator.
- each packet distributor is to send route segment connection information regarding route segments adjacent to it to the other packet distributors.
- An IP -based protocol may be used to send a data packet containing route segment connection information.
- a data packet used to send route segment connection information may include a route segment number, its connection status, and a private network address or an identification number of a destination packet distributor.
- the data packet may include a time stamp indicating when a route segment connection information was gathered.
- the destination packet distributor sends an acknowledgement data packet to the packet distributor that originally sent the data packet.
- the destination packet distributor also updates route segment connection information, if necessary.
- the packet distributor When updating, it checks a time stamp to make sure that the data packet contains more recent information.
- the packet distributor keeps resending a data packet until it receives an acknowledgment data packet. For example, if the packet distributor does not receive an acknowledgement data packet within a first predetermined amount of time, it resends a data packet using the same route. It may resend the data packet again if it does not receive an acknowledgement data packet within another first predetermined amount of time. If an acknowledgement data packet does not arrive within a second predetermined amount of time, it may resend a data packet using an alternative route specified in the inter-distributor communication route table.
- IP -protocol based method may be used instead of using the IP -protocol based method described above to communicate route segment connection information.
- other existing protocols such as Transport Control Protocol (TCP) as described in Christian Huitema, Routing in the Internet (2nd ed. 1999), may be used.
- TCP Transport Control Protocol
- the above method may be altered so that a data packet travels within the resilient closed optical communication network until all the packet distributors receive the data packet.
- Each distributing station maintains a table containing route segment connection information for each route segment within the closed resilient communication network.
- the distributing station uses this table to select functioning routes among available routes. Specifically, for each available route, it checks connection information for every route segment that comprises the available route. If every route segment is connected or functioning, then the available route is considered a functioning route.
- the distributing station determines whether there are at least two functioning routes. If so, it continues to step 1105. If there is only one functioning route, the distributing station designates it as an optimal route at step 1113.
- the distributing station calculates an available traffic volume for each functioning route.
- the distributing station maintains a table of available traffic volumes for every route segment in the resilient closed communication network.
- An available traffic volume is a difference between an effective traffic volume for a route segment and an actual traffic volume for that route segment. Initially, an available traffic volume of a route segment may equal an effective traffic volume of that route segment. Alternatively, a network operator may assign an arbitrary value.
- an available traffic volume is updated periodically to convey network congestion information in real time.
- An actual traffic volume is determined by measuring a size of data packets that are sent through a route segment. An actual traffic volume is measured in terms of bits per second.
- Each distributing station is responsible for measuring an actual traffic volume of route segments that are directly connected to it and for communicating the values to the other distributing stations in the resilient closed communication network.
- the distributing stations may update an actual traffic volume periodically, such as every 10 seconds.
- the distributing stations may be programmed measure actual traffic volumes at the same time.
- the closed resilient communication network may use an internal clock.
- the distributing stations communicate actual traffic volumes using an inter- distributor communication method similar to the one used to communicate route segment connection information.
- a data packet for communicating an actual traffic volume would contain an actual traffic volume, a conesponding route segment number, and a time stamp indicating when the actual traffic volume was measured. It may further include a network address or an identification number of a destination packet distributor.
- Each packet distributor may maintain a table containing actual traffic volumes for every route segment within the resilient closed communication network. Whenever a packet distributor receives a data packet containing an actual traffic volume, a conesponding entry in the table is updated, if necessary.
- the effective traffic volume is an amount of data that a route segment can handle, expressed in terms of bits per second. This volume is typically set by a network operator and is less than or equal to the maximum traffic volume that the route segment can handle.
- a distributing station To calculate an available traffic volume for a functioning route between two distributing stations, a distributing station first determines an available traffic volume for each route segment of the functioning route. The available traffic volume of the functioning route equals the smallest available traffic volume among the available traffic volumes of its route segments. At step 1106, the distributing station determines whether there is at least one functioning route with an available traffic volume that is greater than or equal to zero. If not, it chooses functioning routes with the largest available traffic volume as optimal route candidates at step 1112.
- an actual distance value is a distance between a distributing station that receives a data packet from an external network and a destination distributing station from which the data packet is forwarded to another external network.
- each distributing station maintains a distance table containing a length of each route segment, which is predetermined by a network operator. Instead of maintaining a distance table, a distributing station may record an actual distance value for each route in its routing table.
- the distributing station accesses the distance table to obtain a length of all the route segments for the functioning route.
- the actual distance value of the functioning route equals the sum of the lengths of it route segments.
- the distributing station chooses among the functioning routes with the available traffic volume of zero, those with the smallest actual distance value as optimal route candidates. If at least one functioning route has a positive available traffic volume, the distributing station calculates an actual distance value for each functioning route with a positive available traffic volume at step 1108. Among the functioning routes with a positive available traffic volume, it chooses those with the smallest actual distance value as optimal route candidates at 1109.
- FIG. 12 illustrates one embodiment of a process used to select an optimal route among optimal route candidates determined at step 1201. If there is only one optimal route candidate, then it is designated as an optimal route, as illustrated in steps 1202 and 1205. If there are at least two optimal route candidates, the distributing station calculates a preference value for each optimal route candidate at 1203.
- a packet distributor typically performs the steps in FIG. 12 and maintains a data, such as a preference value table, that is necessary to perform the steps.
- a preference value is used to designate certain routes as prefereed routes.
- a network operator typically sets preference values.
- a distributing station may maintain a preference value table.
- a preference value table for example, may contain a list of preferred routes.
- a distributing station then gives a preference value of one to those optimal route candidates listed in the preference table and zero to those that are not listed.
- a preference table may contain a preference value for each route segment and a preference value of an optimal route candidate may be defined as a sum of preference values of its route segments. Then at step 1203, a distributing station calculates preference values for each optimal route candidate by adding preference values of its route segments.
- the distributing station chooses an optimal route candidate with the largest preference value as an optimal route. If two or more optimal route candidates have the same preference value, then the distributing station may choose one arbitrarily. Instead of using a preference value, as illustrated in FIG. 12, one may randomly choose any one of optimal route candidates as an optimal route.
- FIG. 13 is a diagram showing a distributing station 1301 that is connected to an external network 1305 and a communication ring 1306.
- the distributing station 1301 has a router 1302, a packet distributor 1303, and a quality of service (QOS) system 1304.
- the QOS system 1304 is used to control a flow of data packets within the resilient closed communication network.
- FIG. 13 shows the QOS system 1304 inside the distributing station 1301, the QOS systeml304 may reside outside the distributing station 1301 as a separate component.
- a QOS system may be installed for each route segment.
- two QOS systems may be installed outside the distributing station 1301, assigning one QOS system to each route segment directly connected to the distributing station 1301.
- the functions performed by a router 1302, a packet distributor 1303, and a QOS system 1304 may be implemented in one device.
- FIG. 14 depicts one embodiment of an operation performed by a QOS system.
- the QOS system checks whether an optimal route has a negative available traffic volume. If the optimal route has a negative available traffic volume, then the QOS system is used. Otherwise, the data packet is sent to the next distributing station. In other words, the QOS system is not used when an optimal route has a non-negative available traffic volume. Only when an optimal route has a negative available traffic volume, that is when an actual traffic volume of at least one route segment of the optimal route exceeds an effective traffic volume of that segment, the QOS system is turned on. Once the resilient closed communication network becomes uncongested, that is once an available traffic volume for an optimal route becomes greater than or equal to zero, the QOS system is turned off and the data packet is immediately sent to the next distributing station at 1405.
- the QOS system assigns a QOS value to the data packet at step 1402.
- the QOS value represents a sending priority assigned to that data packet. For example, the system may decide to send data packets originating from an Internet service provider X before sending data packets from an Internet service provider Y, when the system is congested.
- the QOS system may maintain a QOS table assigning a QOS value based on information contained in a transport layer of a data packet using an Open Systems Interconnection (OSI) model.
- OSI Open Systems Interconnection
- the data packet is placed in a QOS queue based on its QOS value.
- the QOS queue is managed so that the data packet with the highest QOS value is sent first.
- the data packet is removed from the QOS queue and sent to the next distributing station at 1405. While FIG. 13 shows the QOS system 1304 as a separate system, it may be incorporated into the packet distributor 1303. If the QOS system is a separate system as shown in FIG. 13, it is necessary to allow a communication between the QOS system and the distributing station, so that the QOS system has an access to available traffic volumes. An electronic circuit may be used to connect the QOS system and the distributing station. Furthermore, it may be preferable to maintain a separate QOS system for each route segment.
Abstract
Description
Claims
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP01947724A EP1266491A2 (en) | 2000-03-10 | 2001-03-08 | Method and system for operation of a resilient closed communication network without a dedicated protection network segment |
AU2001269365A AU2001269365A1 (en) | 2000-03-10 | 2001-03-08 | Method and system for operation of a resilient closed communication network without a dedicated protection network segment |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US09/523,375 US6894978B1 (en) | 2000-03-10 | 2000-03-10 | Method and system for operation of a resilient closed communication network without a dedicated protection network segment |
US09/523,375 | 2000-03-10 |
Publications (2)
Publication Number | Publication Date |
---|---|
WO2001067662A2 true WO2001067662A2 (en) | 2001-09-13 |
WO2001067662A3 WO2001067662A3 (en) | 2002-06-13 |
Family
ID=24084735
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/IB2001/001251 WO2001067662A2 (en) | 2000-03-10 | 2001-03-08 | Method and system for operation of a resilient closed communication network without a dedicated protection network segment |
Country Status (4)
Country | Link |
---|---|
US (2) | US6894978B1 (en) |
EP (1) | EP1266491A2 (en) |
AU (1) | AU2001269365A1 (en) |
WO (1) | WO2001067662A2 (en) |
Families Citing this family (25)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP1041776A1 (en) * | 1999-03-30 | 2000-10-04 | International Business Machines Corporation | Multiple ARP functionality for an IP data transmission system |
JP4693328B2 (en) * | 2000-03-15 | 2011-06-01 | インフォジム インフォルマティオンステヒニク ゲゼルシャフト ミット ベシュレンクテル ハフツング | Method and system for communicating data over an optimal data path in a network |
US7239607B1 (en) * | 2000-06-30 | 2007-07-03 | Broadband Royalty Corp. | Guaranteed quality of service in an asynchronous metro packet transport ring |
US20040179471A1 (en) * | 2001-03-07 | 2004-09-16 | Adisak Mekkittikul | Bi-directional flow-switched ring |
US7146000B2 (en) * | 2002-01-25 | 2006-12-05 | Level (3) Communications | Routing engine for telecommunications network |
US8108738B2 (en) | 2007-06-26 | 2012-01-31 | International Business Machines Corporation | Data eye monitor method and apparatus |
US7984448B2 (en) * | 2007-06-26 | 2011-07-19 | International Business Machines Corporation | Mechanism to support generic collective communication across a variety of programming models |
US8509255B2 (en) | 2007-06-26 | 2013-08-13 | International Business Machines Corporation | Hardware packet pacing using a DMA in a parallel computer |
US8756350B2 (en) | 2007-06-26 | 2014-06-17 | International Business Machines Corporation | Method and apparatus for efficiently tracking queue entries relative to a timestamp |
US7827391B2 (en) | 2007-06-26 | 2010-11-02 | International Business Machines Corporation | Method and apparatus for single-stepping coherence events in a multiprocessor system under software control |
US8140925B2 (en) | 2007-06-26 | 2012-03-20 | International Business Machines Corporation | Method and apparatus to debug an integrated circuit chip via synchronous clock stop and scan |
US7802025B2 (en) | 2007-06-26 | 2010-09-21 | International Business Machines Corporation | DMA engine for repeating communication patterns |
US8032892B2 (en) * | 2007-06-26 | 2011-10-04 | International Business Machines Corporation | Message passing with a limited number of DMA byte counters |
US8468416B2 (en) | 2007-06-26 | 2013-06-18 | International Business Machines Corporation | Combined group ECC protection and subgroup parity protection |
US7738443B2 (en) * | 2007-06-26 | 2010-06-15 | International Business Machines Corporation | Asynchronous broadcast for ordered delivery between compute nodes in a parallel computing system where packet header space is limited |
US8010875B2 (en) | 2007-06-26 | 2011-08-30 | International Business Machines Corporation | Error correcting code with chip kill capability and power saving enhancement |
US8458282B2 (en) | 2007-06-26 | 2013-06-04 | International Business Machines Corporation | Extended write combining using a write continuation hint flag |
US7886084B2 (en) | 2007-06-26 | 2011-02-08 | International Business Machines Corporation | Optimized collectives using a DMA on a parallel computer |
US7793038B2 (en) | 2007-06-26 | 2010-09-07 | International Business Machines Corporation | System and method for programmable bank selection for banked memory subsystems |
US7877551B2 (en) * | 2007-06-26 | 2011-01-25 | International Business Machines Corporation | Programmable partitioning for high-performance coherence domains in a multiprocessor system |
US8103832B2 (en) * | 2007-06-26 | 2012-01-24 | International Business Machines Corporation | Method and apparatus of prefetching streams of varying prefetch depth |
US8230433B2 (en) | 2007-06-26 | 2012-07-24 | International Business Machines Corporation | Shared performance monitor in a multiprocessor system |
US8812711B2 (en) * | 2008-02-27 | 2014-08-19 | Red Hat, Inc. | Three-way communication protocol |
DE102012210816A1 (en) * | 2012-06-26 | 2014-01-02 | Siemens Aktiengesellschaft | Data packet for a bidirectional transmission of data packets in a data transmission between a first and a second communication device and method for transmitting such a data packet |
US10454851B2 (en) | 2015-04-16 | 2019-10-22 | Cisco Technology, Inc. | Optimized link failure convergence for resilient ethernet protocol networks |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5826038A (en) * | 1994-09-01 | 1998-10-20 | Fujitsu Limited | Communication network configuration detecting method using frame transmission |
EP0957611A2 (en) * | 1998-05-12 | 1999-11-17 | AT&T Corp. | Method of establishing a redundant mesh network using a minimum number of links |
Family Cites Families (40)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5088032A (en) | 1988-01-29 | 1992-02-11 | Cisco Systems, Inc. | Method and apparatus for routing communications among computer networks |
DE3919962C3 (en) | 1989-06-19 | 1994-07-14 | Hirschmann Richard Gmbh Co | Method and arrangement for securing data transmission in a linear computer network |
DE3934197A1 (en) | 1989-10-13 | 1991-04-18 | Bayer Ag | THIAZOLICARBONIC ACID DERIVATIVES |
US5448389A (en) | 1989-12-22 | 1995-09-05 | British Telecommunications Public Limited Company | Passive optical ring network |
US5247381A (en) | 1991-01-16 | 1993-09-21 | Infralan Technologies, Inc. | Apparatus and method for automatically reconfiguring, free space local area network systems |
JP3120157B2 (en) | 1991-07-08 | 2000-12-25 | 株式会社日立製作所 | Loop logical channel control method |
US5341364A (en) * | 1992-06-02 | 1994-08-23 | At&T Bell Laboratories | Distributed switching in bidirectional multiplex section-switched ringtransmission systems |
US5353283A (en) | 1993-05-28 | 1994-10-04 | Bell Communications Research, Inc. | General internet method for routing packets in a communications network |
US5473599A (en) | 1994-04-22 | 1995-12-05 | Cisco Systems, Incorporated | Standby router protocol |
US5509000A (en) | 1994-06-10 | 1996-04-16 | Motorola, Inc. | Method and apparatus for routing information in a communication system |
JPH0818592A (en) | 1994-06-30 | 1996-01-19 | Fujitsu Ltd | Optical fiber transmission system having ring protection by optical switching |
US5907417A (en) | 1994-12-30 | 1999-05-25 | Lucent Technologies Inc. | Passive optical network with diagnostic loop-back |
US5623492A (en) | 1995-03-24 | 1997-04-22 | U S West Technologies, Inc. | Methods and systems for managing bandwidth resources in a fast packet switching network |
JP2617701B2 (en) | 1995-06-28 | 1997-06-04 | 宮城日本電気株式会社 | How to avoid misconnection when switching VT paths |
US5657142A (en) | 1995-07-25 | 1997-08-12 | Mci Communications Corporation | Optimal allocation of multiplexing equipment and distribution of load in a fiber optic network |
FR2738432B1 (en) | 1995-09-01 | 1997-09-26 | Hamel Andre | OPTICAL COMPONENT SUITABLE FOR MONITORING A MULTI-WAVELENGTH LENGTH AND INSERTION-EXTRACTION MULTIPLEXER USING THE SAME, APPLICATION TO OPTICAL NETWORKS |
CA2164071C (en) | 1995-09-06 | 2001-08-21 | Thomas P. J. Flanagan | Optical communication system |
IT1277204B1 (en) | 1995-10-19 | 1997-11-05 | Pirelli S P A Ora Pirelli Cavi | TRANSPARENT OPTICAL COMMUNICATION NETWORK WITH SELF-PROTECTED RING |
US5835696A (en) | 1995-11-22 | 1998-11-10 | Lucent Technologies Inc. | Data router backup feature |
US5949755A (en) * | 1996-04-12 | 1999-09-07 | Fujitsu Network Communications, Inc. | ATM emulated path protection |
US5854899A (en) | 1996-05-09 | 1998-12-29 | Bay Networks, Inc. | Method and apparatus for managing virtual circuits and routing packets in a network/subnetwork environment |
US5917820A (en) | 1996-06-10 | 1999-06-29 | Cisco Technology, Inc. | Efficient packet forwarding arrangement for routing packets in an internetwork |
US5995503A (en) | 1996-06-12 | 1999-11-30 | Bay Networks, Inc. | Method and apparatus for providing quality of service routing in a network |
US5991817A (en) | 1996-09-06 | 1999-11-23 | Cisco Systems, Inc. | Apparatus and method for a network router |
US5898691A (en) | 1996-09-26 | 1999-04-27 | Cisco Technology, Inc. | Method and apparatus for congestion distributed adaptive routing |
US5986783A (en) | 1997-02-10 | 1999-11-16 | Optical Networks, Inc. | Method and apparatus for operation, protection, and restoration of heterogeneous optical communication networks |
US5982517A (en) | 1997-06-02 | 1999-11-09 | Fishman Consulting | Method and system for service restoration in optical fiber communication networks |
US5870212A (en) | 1998-01-14 | 1999-02-09 | Mciworldcom, Inc. | Self-healing optical network |
US6940810B1 (en) * | 1998-02-20 | 2005-09-06 | Adc Telecommunications, Inc. | Protection switching of virtual connections at the data link layer |
KR20010041157A (en) * | 1998-02-20 | 2001-05-15 | 에이디씨 텔레커뮤니케이션스 인코포레이티드 | Protection switching of virtual connections |
US6320860B1 (en) * | 1998-03-06 | 2001-11-20 | Alcatel | Method of providing ATM path switched ring functionality |
JP3639109B2 (en) * | 1998-04-02 | 2005-04-20 | 富士通株式会社 | Optical transmission device, optical transmission system, and optical terminal |
US6269452B1 (en) * | 1998-04-27 | 2001-07-31 | Cisco Technology, Inc. | System and method for fault recovery for a two line bi-directional ring network |
US6473421B1 (en) * | 1999-03-29 | 2002-10-29 | Cisco Technology, Inc. | Hierarchical label switching across multiple OSPF areas |
EP1041776A1 (en) * | 1999-03-30 | 2000-10-04 | International Business Machines Corporation | Multiple ARP functionality for an IP data transmission system |
US6785285B1 (en) * | 1999-06-03 | 2004-08-31 | Fujitsu Network Communications, Inc. | Method and system for providing broadcast channels over an emulated subnetwork |
US6532088B1 (en) * | 1999-09-10 | 2003-03-11 | Alcatel | System and method for packet level distributed routing in fiber optic rings |
EP1096712A3 (en) * | 1999-10-29 | 2005-09-07 | Nippon Telegraph and Telephone Corporation | Path network and path network operation method using conversion of protection path into working path |
JP3356145B2 (en) * | 1999-12-22 | 2002-12-09 | 日本電気株式会社 | Transmission line failure relief method, transmission line failure relief system, storage medium, and router |
JP3729051B2 (en) * | 2000-10-18 | 2005-12-21 | 日本電気株式会社 | Inter-domain routing apparatus, system and method |
-
2000
- 2000-03-10 US US09/523,375 patent/US6894978B1/en not_active Expired - Lifetime
-
2001
- 2001-03-08 WO PCT/IB2001/001251 patent/WO2001067662A2/en not_active Application Discontinuation
- 2001-03-08 EP EP01947724A patent/EP1266491A2/en not_active Withdrawn
- 2001-03-08 AU AU2001269365A patent/AU2001269365A1/en not_active Abandoned
-
2004
- 2004-04-14 US US10/823,542 patent/US20040190455A1/en not_active Abandoned
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5826038A (en) * | 1994-09-01 | 1998-10-20 | Fujitsu Limited | Communication network configuration detecting method using frame transmission |
EP0957611A2 (en) * | 1998-05-12 | 1999-11-17 | AT&T Corp. | Method of establishing a redundant mesh network using a minimum number of links |
Also Published As
Publication number | Publication date |
---|---|
EP1266491A2 (en) | 2002-12-18 |
US6894978B1 (en) | 2005-05-17 |
AU2001269365A1 (en) | 2001-09-17 |
WO2001067662A3 (en) | 2002-06-13 |
US20040190455A1 (en) | 2004-09-30 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US6894978B1 (en) | Method and system for operation of a resilient closed communication network without a dedicated protection network segment | |
CN114073052B (en) | Systems, methods, and computer readable media for slice-based routing | |
EP2817928B1 (en) | Controller placement for fast failover in the split architecture | |
US7471669B1 (en) | Routing of protocol data units within a communication network | |
US6671256B1 (en) | Data channel reservation in optical burst-switched networks | |
US7430205B2 (en) | Packet transfer apparatus | |
EP2364539B1 (en) | A system and method of implementing lightweight not-via ip fast reroutes in a telecommunications network | |
CN108702331A (en) | SR applications section is integrated with service function chain (SFC) header metadata | |
US7525919B2 (en) | Packet communication method with increased traffic engineering efficiency | |
US20070055789A1 (en) | Method and apparatus for managing routing of data elements | |
WO2000013376A9 (en) | Redundant path data communication | |
CN103581009A (en) | Drop sensitive prefix (BGP path) attribute modification | |
EP1309131A1 (en) | Method for implementation of a full-duplex switched Ethernet redundant communication network | |
WO2004003690A2 (en) | Routing header based routing in internet protocol (ip)-cellular networks | |
CN106254152A (en) | A kind of flow control policy treating method and apparatus | |
EP0895431B1 (en) | Alternate routing | |
US20020009088A1 (en) | Systems and methods for negotiating virtual circuit paths in packet switched networks | |
CN101753426B (en) | Firewall multi-outlet intelligent route selection method | |
CN101227495B (en) | Common telecommunication grouping data network system and congestion control method thereof | |
CN101909005A (en) | Method and device for processing forwarding table | |
CN113259976B (en) | Method and system for restoring network path of 5G base station based on multi-data fusion | |
US8155515B2 (en) | Method and apparatus for sharing common capacity and using different schemes for restoring telecommunications networks | |
Yazici et al. | Policy broker-centric traffic classifier architecture for deep packet inspection systems with route asymmetry | |
CN106549798A (en) | A kind of method that network management and control bus is built in IP communication networks | |
Hayashitani et al. | Flexible and automated operational control in SDN transport-base virtual router |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A2 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CR CU CZ DE DK DM DZ 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 PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG UZ VN YU ZA ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A2 Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG 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 GW ML MR NE SN TD TG |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
DFPE | Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101) | ||
AK | Designated states |
Kind code of ref document: A3 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CR CU CZ DE DK DM DZ 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 PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG UZ VN YU ZA ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A3 Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG 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 GW ML MR NE SN TD TG |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2001947724 Country of ref document: EP |
|
WWP | Wipo information: published in national office |
Ref document number: 2001947724 Country of ref document: EP |
|
NENP | Non-entry into the national phase |
Ref country code: JP |
|
WWW | Wipo information: withdrawn in national office |
Ref document number: 2001947724 Country of ref document: EP |