Optical dynamic burst switch

• US 20030095553A1
• Filed: 10/31/2002
• Published: 05/22/2003
• Est. Priority Date: 11/02/2001
• Status: Abandoned Application

• Current Assignee: Nippon Telegraph and Telephone Corporation
• Original Assignee: Nippon Telegraph and Telephone Corporation
• Inventors: Yamanaka, Naoaki, Oki, Eiji, Shiomoto, Kohei
• Application Number:
  US10/285,300
• Publication Number:
  US 20030095553A1
• Time in Patent Office: Days
• US Class Current: 370/395.52
• CPC Class Codes: H04L 45/12 Shortest path evaluation
• CPC Class Codes: H04L 45/24 Multipath
• CPC Class Codes: H04L 45/40 Wormhole routing
• CPC Class Codes: H04Q 11/0005 Switch and router aspects
• CPC Class Codes: H04Q 11/0066 Provisions for optical burst or packet networks
• CPC Class Codes: H04Q 2011/005 Arbitration and scheduling
• CPC Class Codes: H04Q 2011/0064 Arbitration, scheduling or medium access control aspects
• CPC Class Codes: H04Q 2011/0086 Network resource allocation, dimensioning or optimisation

Abstract

This invention relates to a node, comprising a data transferring function for transferring data, a data receiving function for receiving data, and an establishing unit for establishing and releasing a cut through path to a node of a next stage; the establishment and releasing unit comprising a calculating unit which calculates in advance establishment paths of a cut through path to each of a plurality of nodes in the next stage, and a detecting unit which detects the arrival of a leading packet of burst data; and the calculating unit calculating establishment paths of a plurality of cut through paths in accordance with an IP address of the leading packet, detected by the detecting unit.

Claims

1. A node comprising:

a data transferring function for transferring data;

a data receiving function for receiving data;

an establishing unit for establishing and releasing a cut through path to a node of the next stage; and

a detecting unit which detects the arrival of a leading packet of burst data,

wherein the establishing and releasing unit comprises a calculating unit which calculates in advance establishing paths of a cut through path to each of a plurality of nodes in the next stage, and the calculating unit calculates establishment paths of a plurality of cut through paths in accordance with an IP address of the leading packet, detected by the detecting unit.

2. A node according to claim 1, further comprising a measuring unit which measures the amounts of past traffic transferred to a plurality of nodes of the next stage,

wherein the calculating unit comprises a unit which calculates in advance an establishment path for a cut through path to the transferring destination node exceeding a predetermined amount of traffic in accordance with the measurement obtained by the measuring unit.

3. A node according to claim 2, the calculating unit comprises a unit which calculates in advance at least one establishment path of a cut through path to a transferring destination node which exceeds a predetermined amount of traffic, the number of establishment path calculated being proportional to the amount of traffic, in accordance with the measurement obtained by the measuring unit.

4. A node according to claim 3, wherein the establishing unit comprising a unit which establishes cut through paths to a plurality of next stages,

the node further comprises a transferring unit which disperses and transfers a plurality of packets forming a series of burst data to the plurality of cut through paths, and

sequence numbers of the packets before the packets were dispersed being appended to the packets after being dispersed.

5. A node according to claim 3, wherein the unit for calculating establishment path comprises a unit which calculates in advance the establishment path of cut through paths to a plurality of nodes in the next stage having different link costs, and

the establishing unit comprises a unit which establishes a cut through path on an establishment path having a link cost corresponding to the QoS (Quality of Service) class of the arriving burst data, from among the plurality of cut through paths having different link costs.

6. A node according to claim 3, wherein the calculating unit comprises a unit which calculates in advance establishment paths of cut through paths for a plurality of nodes in the next stage,

an establishment path for the cut through path used in transferring the burst data is allocated in advance, in accordance with the burst length of arriving burst data,

the establishing unit comprises a unit which actually establishes a cut through path along the establishment path allocated to the burst length from among the plurality of establishment paths for cut through paths, in accordance with the burst length of the arriving burst data.

7. A node according to claim 1, wherein the establishing unit establishes a cut through path to a node of the next stage on an establishment path which corresponds to the IP address from among the plurality of establishment paths for cut through paths calculated in advance.

8. A node according to claim 7, further comprising a measuring unit which measures the amounts of past traffic transferred to the plurality of nodes in the next stage,

wherein the calculating unit comprises a unit which calculates in advance an establishment path for a cut through path for a path to a transferring destination node which exceeds a predetermined amount of traffic, in accordance with the measurement obtained by the measuring unit.

9. A node according to claim 8, wherein the calculating unit comprises a unit which calculates in advance at least one establishment path of a cut through path to a transferring destination node which exceeds a predetermined amount of traffic, the number of establishment paths calculated being proportional to the amount of traffic, in accordance with the measurement obtained by the measuring unit.

10. A node according to claim 9, wherein

the establishing unit comprises a unit which establishes cut through paths to a plurality of next stages,

the node further comprises a unit which disperses and transfers a plurality of packets forming a series of burst data along the plurality of cut through paths;

and

sequence numbers prior to dispersal being appended to each of the dispersed packets.

11. A node according to claim 9, wherein the unit for calculating establishing path comprises a unit which calculates in advance the establishment path of cut through paths to a plurality of nodes in the next stage having different link costs, and

the establishing unit comprises a unit which establishes a cut through path on an establishment path having a link cost corresponding to the QoS (Quality of Service) class of the arriving burst data, from among the plurality of cut through paths having different link costs.

12. A node according to claim 9, wherein

the calculating unit comprises a unit which calculates in advance establishment paths of cut through paths for a plurality of nodes in the next stage,

an establishment path for the cut through path used in transferring the burst data is allocated in advance, in accordance with the burst length of arriving burst data, and

the establishing unit comprises a unit which actually establishes a cut through path along the establishment path allocated to the burst length from among the plurality of establishment paths for cut through paths, in accordance with the burst length of the arriving burst data.

13. A node according to claim 1, wherein

the establishing unit comprises a unit which establishes cut through paths to a plurality of next stages,

the node further comprises a unit which disperses and transfers a plurality of packets forming a series of burst data along the plurality of cut through paths, and

sequence numbers prior to dispersal being appended to each of the dispersed packets.

14. A node according to claim 1, wherein the establishing unit comprises a unit which actually establishes two cut through paths as the establishment path which corresponds to the IP address of the leading packet detected by the detecting unit from among the plurality of establishment paths for cut through paths calculated in advance in accordance with the IP address, one of the cut through paths being a working path and the other a protection path.

15. A node according to claim 14, further comprising a unit which transfers identical burst data along the working path and the protection path.

16. A node according to claim 1, further comprising:

a unit which actually establishes as a working path the cut through path to a node in the next stage of the establishment path which corresponds to the IP address of the leading packet detected by the detecting unit from among the plurality of establishment paths for cut through paths calculated in advance in accordance with the IP address;

a selecting unit which selects an establishment path of a protection cut through path having a different path to that of the working path from among the plurality of establishment paths for cut through paths calculated in advance; and

a unit which actually establishes a protection cut through path on the establishment path of the protection cut through path selected by the selecting unit when the working cut through path is damaged.

17. A node according to claim 14, further comprising:

a unit which transfers burst data along the working path when there is no detected damage to the path which the working path has been established on; and

a unit which transfers burst data on the protection path when damage is detected on the path which the working path has been established on.

18. A node according to claim 17, wherein sequence numbers are appended to packets forming the burst data,

the node further comprises:

a unit which notifies a node in the next stage via the protection path of the final sequence number of burst data transferred along the working path when the burst data has been lost;

a unit which temporarily accumulates burst data; and

a unit which refers to the final sequence number, notified from the node of the next stage prior to transferring the burst data accumulated by the temporary accumulating unit along the protection path, and deems a packet, which the next sequence number after the final sequence number is appended to, as the leading packet of burst data to be transferred along the protection path.

19. A node according to claim 16, further comprising:

a unit which transfers burst data along the working path when there is no detected damage to the path which the working path has been established on; and

a unit which transfers burst data on the protection path when damage is detected on the path which the working path has been established on.

20. A node according to claim 16, wherein sequence numbers are appended to packets forming the burst data,

the node further comprising:

a unit which notifies a node in the next stage via the protection path of the final sequence number of burst data when the burst data transferred along the working path has been lost;

a unit which temporarily accumulates burst data;

a unit which refers to the final sequence number, notified from the node of the next stage prior to transferring the burst data accumulated by the temporary accumulating unit along the protection path, and deems a packet, which the next sequence number after the final sequence number is appended to, as the leading packet of burst data to be transferred along the protection path.

21. A node according to in claim 1, further comprising:

a unit which transmits an optical packet for test along a planned establishment path for the cut through path, prior to establishment of the cut through path;

a determining unit which receives the optical packet for test and determines its signal quality;

a unit which notifies a node in a preceding stage when the determining unit has determined that the signal quality has deteriorated; and

a unit which receives the notification, and performs 3R (reshaping, retiming, and regenerating) processing of optical packets which subsequently travel along the path.

37. An optical communication network, comprising:

a transmission side edge node which accommodates a data transferring source;

a reception side edge node which accommodates a data transferring destination; and

a relay node which relays between the transmission side edge node and the reception side edge node,

wherein the nodes having the units described in claim 2.

22. A program which is installed in an information processing device, and allows the information processing device to realize functions of establishing and releasing a cut through path to a node of the next stage, the functions comprising:

detecting the arrival of a leading packet of burst data; and

calculating in advance establishment paths for a plurality of nodes in the next stage, in accordance with an IP address of the leading packet detected by the detecting function.

23. A program according to claim 22, wherein the establishing function actually establishes a cut through path along a path to a node of the next stage which corresponds to the IP address of the leading packet, detected by the detecting function, from among the plurality of cut through path establishment paths calculated in advance in accordance with the IP address.

24. A program according to claim 23, wherein

the actual establishing function establishes cut through paths to a plurality of nodes in the next stage,

the program realizes the function of dispersing and transferring a plurality of packets forming a series of burst data along the plurality of cut through paths, sequence numbers prior to dispersal being appended to each of the dispersed packets.

25. A program according to claim 23, wherein the actually establishing function actually establishes two cut through paths as the establishment path which corresponds to the IP address of the leading packet detected by the detecting function from among the plurality of establishment paths for cut through paths calculated in advance in accordance with the IP address, one of the cut through paths being a working path and the other a protection path.

26. A program according to claim 25, wherein the program realizes the function of transferring identical burst data along the working path and the protection path.

27. A program according to claim 25, wherein the program further realizes the functions of:

transferring burst data along the working path when there is no detected damage to the path which the working path has been established on; and

transferring burst data on the protection path when damage is detected on the path which the working path has been established on.

28. A program according to claim 27, wherein sequence numbers are appended to packets forming the burst data,

the program further realizes the functions of:

notifying a transmission side edge node via the protection path of the final sequence number of burst data transferred along the working path when the burst data has been lost;

temporarily accumulating burst data; and

referring to the final sequence number, notified from the node of the next stage prior to transferring the burst data, accumulated by the temporary accumulating function, along the protection path, and deeming a packet, which the next sequence number after the final sequence number is appended to, as the leading packet of burst data to be transferred along the protection path.

29. A program according to claim 23, wherein the program further realizes the functions of:

actually establishing as a working path the cut through path which corresponds to the IP address of the leading packet detected by the detecting function from among the plurality of establishment paths for cut through paths calculated in advance in accordance with the IP address;

selecting an establishment path of a protection cut through path having a different path to that of the working path from among the plurality of establishment paths for cut through paths calculated in advance; and

actually establishing a protection cut through path on the protection cut through path establishment path selected by the selecting function when the working cut through path is damaged.

30. A program according to claim 29, wherein the program further realizes the functions of:

transferring burst data along the working path when there is no detected damage to the path which the working path has been established on; and

transferring burst data on the protection path when damage is detected on the path which the working path has been established on.

31. A program according to claim 30, wherein sequence numbers are appended to packets forming the burst data, the program further realizes the functions of:

notifying a transmission side edge node via the protection path of the final sequence number of burst data transferred along the working path when the burst data has been lost;

temporarily accumulating burst data; and

referring to the final sequence number, notified from the node of the next stage prior to transferring the burst data, accumulated by the temporary accumulating function, along the protection path, and deeming a packet, which the next sequence number after the final sequence number is appended to, as the leading packet of burst data to be transferred along the protection path.

32. A program according to claim 22, wherein the program further realizes the function of measuring the amounts of past traffic transferred to a plurality of nodes of the preceding stage, and

the function of calculating establishment path calculates in advance an establishment path for a cut through path to the transferring destination node exceeding a predetermined amount of traffic in accordance with the measurement obtained by the measuring function.

33. A program according to claim 22, wherein the function of calculating establishment path calculates in advance at least one establishment path of a cut through path to a transferring destination node which exceeds a predetermined amount of traffic, the number of establishment path calculated being proportional to the amount of traffic, in accordance with the measurement obtained by the measuring function.

34. A program according to claim 22, wherein

the function of calculating establishment path calculates in advance the establishment path of cut through paths to a plurality of nodes in the next stage having different link costs;

and

the actual establishing function actually establishes a cut through path on an establishment path having a link cost corresponding to the QoS (Quality of Service) class of the arriving burst data, from among the plurality of cut through paths having different link costs.

35. A program according to claim 22, wherein

the function of calculating the establishment path calculates in advance establishment paths of cut through paths for a plurality of nodes in the next stage,

an establishing path for the cut through path used in transferring the burst data is allocated in advance, in accordance with the burst length of arriving burst data, and

the actual establishing function actually establishes a cut through path along the establishment path allocated to the burst length from among the plurality of establishment paths for cut through paths, in accordance with the burst length of the arriving burst data.

36. A recording medium which the program as described in claim 23 is stored in, the recording medium being readable by the information processing device.