Fast packet adaptation method for ensuring packet portability across diversified switching type networks

• US 5,425,029 A
• Filed: 09/20/1993
• Issued: 06/13/1995
• Est. Priority Date: 09/20/1993
• Status: Expired due to Term

• Current Assignee: Google Technology Holdings LLC (Alphabet Inc.)
• Original Assignee: Motorola, Inc. (Motorola Solutions, Inc.)
• Inventors: Ahmed, Hassan, Hluchyj, Michael G., Cook, Steven R.
• Primary Examiner(s): Olms, Douglas W.
• Assistant Examiner(s): HOM, SHICK C
• Application Number:
  US08/123,776
• Time in Patent Office: 631 Days
• Field of Search: 370/94.1, 370/99, 370/85.7, 370/85.13, 370/110.1, 370/54, 370/102, 370/85.6, 370/85.14
• US Class Current: 370/395.6
• CPC Class Codes: H04L 12/66 Arrangements for connecting between networks having differing types of switching systems, e.g. gateways
• CPC Class Codes: H04L 2012/5619 Network Node Interface, e.g. tandem connections, transit switching
• CPC Class Codes: H04L 2012/5652 Cell construction, e.g. including header, packetisation, depacketisation, assembly, reassembly
• CPC Class Codes: H04Q 11/0478 Provisions for broadband connections

Abstract

The present invention provides for fast packet information transfer from a first type switching system to a diverse, i.e., different, type switching system by adaptation of a format of each fast packet from the first type switching system to a format that is portable across the second type switching system. For example, the present invention enables transport of fast packets from a fast packet switching system across a cell relay system and vice versa, from a fast packet switching system across an asynchronous transfer mode system and vice versa, and so on.

Claims

1. A packet format adaptation method for ensuring portability of packet traffic from a first switching type network to a second switching type network, comprising the steps of:

1A) applying predetermined constraints to edge traffic type specific adaption protocols, and

1B) adaptation of a format of each packet from the first switching type packet system to a format that is portable across the second switching type packet system, wherein the first switching type network is a fast packet (FP) network and the second switching type network is a cell relay network.

2. The packet format adaptation method of claim 1 wherein the adaption and predetermined translation procedure comprises the steps of:

2A) determining a maximum allowable FP payload length (MAX_-- FPPL) (applying constraints-Step 1A) in accordance with the function;

MAX_-- FPPL=CRPL-SALF-LCF, where CRPL represents cell relay payload length in network, SALF represents storage area required for a length field to store the fast packet payload length, and LCF represents a length of any additional control fields,

3B) enforcing a maximum fast packet length constraint (applying constraints-Step 1A) at a fast packet traffic source edge node where the traffic type specific adaption protocol is constrained to limit resulting fast packet payload sizes to MAX_-- FPPL, and

2C) encapsulating the fast packets into cells at a first inter-networking node (adaptation of a format-Step 1B).

3. The packet format adaptation method of claim 2 wherein at least one of:

3A) a format of the fast packets (FPs) includes a FP header and a payload field, and

3B) a format of the cells includes a cell header, a control field, a length field, and a payload field.

4. The packet format adaptation method of claim 2 wherein encapsulating the fast packets into cells further includes, for each packet, at least one of:

4A) mapping a logical address of the fast packet to a cell relay logical address,

4B) mapping a congestion level of the fast packet to a cell relay congestion level,

4C) mapping a priority level of the fast packet to a cell relay priority level,

4D) indicating a payload length of the fast packet in the cell,

4E) copying the payload from the fast packet into the cell, and, where necessary, padding the cell to a predetermined length,

4F) where step (4A) is utilized, further including using a predetermined multi-stage table look-up procedure for the mapping of step (4A),

4G) where step (4B) is utilized, further including mapping a cell congestion field in cell header for 2 levels of congestion as a function of a fast packet congestion field in the fast packet header for 2 or more levels of congestion in the fast packet network,

4H) where step (4C) is utilized, further including mapping a cell relay loss priority field (CLP) in the cell header for 2 levels of cell discard priority as a function of a fast packet discard priority field n the fast packet header for 2 or more levels of discard priority in the fast packet network, and

4I) where step (4E) is utilized, padding utilizing multiple code words.

5. The packet format adaption method of claim 2 wherein a first inter-networking node performs translation of the fast packets into cells, thus providing subsequent translating of the cells into fast packets, and a second inter-networking node subsequently performs translation of said cells back into fast packets.

6. The packet format adaption method of claim 5 wherein said subsequent translating the cells into fast packets further includes, for each packet, at least one of:

6) mapping a logical address of the cell to a fast packet logical address,

6B) mapping a congestion level of the cell to a fast packet congestion level,

6C) mapping a priority level of the cell to a fast packet priority level,

4D) reading a payload length indication field in the cell payload to determine;

the payload length of the fast packet,

6E) copying the payload from the cell into the fast packet,

6F) where step (6) is utilized, further including using a predetermined, possibly multi-stage, table look-up procedure for the mapping of step (6),

6G) where step (6B) is utilized, further including mapping a fast packet congestion field in fast packet header for 2 or more levels of congestion as a function of a cell relay congestion field in the cell header for 2 levels of congestion in the cell relay network, and

6H) where step (6C) is utilized, further including mapping a fast packet loss priority field in the fast packet header for 2 or more levels of fast packet discard priority as a function of a cell relay discard priority field in the cell header for 2 levels of discard priority in the cell relay network.

7. The packet format adaption method of claim 5 wherein:

7A) said first inter-networking node includes mapping a congestion and loss priority field from the header of the fast packet into a control field in the payload of the cell, and

7B) said second inter;

networking node includes mapping fast packet congestion and loss priority field in fast packet header to be a boolean function of said control field in the payload of the cell and cell congestion and loss priority information in cell header.

8. The packet format adaptation method of claim 4 wherein the padding is the code word 01101010, binary, repeated.

9. The packet format adaptation method of claim 2 wherein:

9A) MAX_-- FPPL is equal to 46 octets,

9B) CRPL=48 octets,

9C) SALF=1 octet, and

9D) LCF=1 octet.

10. The packet format adaptation method of claim 2 wherein:

10A) MAX_-- FPPL is equal to 47 octets

10B) CRPL=48 octets,

10C) SALF=1 octet, and

10D) LCF=0 octets.

11. A packet format adaptation method for ensuring portability of diverse traffic types from various sources of traffic from a first type packet switching network across a second type packet switching network, where the adaption at an edge of first packet network ensures that one packet is transported in said second packet network for every packet in first network, comprising the steps of:

11A) limiting the payload size of the generated packets at an edge node of said first packet network,

11B) receiving packets from the first type packet switching network at an inter-networking switching node connected to the second type switching network,

11C) translating the packets from the first switching type network into packets of the second type switching network in accordance with a predetermined translation procedure, wherein the first switching type network is a fast packet network and the second type switching network is a cell relay network.

12. The packet format adaptation method of claim 11 wherein the adaption, and predetermined translation procedure comprises the steps of:

12A) determining a maximum allowable FP payload length (MAX_-- FPPL) (adaption) in accordance with the function;

MAX_-- FPPL=CRPL-SALF-LCF, where CRPL represents cell relay payload length in network, SALF represents storage area required for a length field to store the fast packet payload length, and LCF represents a length of any additional control fields,

12B) enforcing a maximum fast packet length constraint (adaption) at a fast packet traffic source edge node where the traffic type specific adaption protocol is constrained to limit resulting fast packet payload sizes to MAX_-- FPPL,

12C) encapsulating the fast packets into cells at a first inter-networking node (predetermined translation).

13. The packet format adaptation method of claim 12 wherein at least one of:

13A) a format of the fast packets (FPs) includes a FP header and a payload field, and

13B) a format of the cells includes a cell header, a control field, a length field, and a payload field.

14. The packet format adaptation method of claim 12 wherein translating the fast packets into cells further includes, for each packet, at least one of:

14A) mapping a logical address of the fast packet to a cell relay logical address,

14B) mapping a congestion level of the fast packet to a cell relay congestion level,

14C) mapping a priority level of the fast packet to a cell relay priority level,

14D) indicating a payload length of the fast packet in the cell,

14E) copying the payload from the fast packet into the cell, and, where necessary, padding the cell to a predetermined length,

14F) where step (14A) is utilized, further including using a predetermined, where selected multi-stage, table look-up procedure for the mapping of step (14A),

14G) where step (16B) is utilized, further including mapping a cell congestion field in cell header for 2 levels of congestion as a function of a fast packet congestion field in the fast packet header for 2 or more levels of congestion in the fast packet network,

14H) where step (14C) is utilized, further including mapping a cell relay;

loss priority field (CLP) in the cell header for 2 levels of cell discard priority as a function of a fast packet discard priority field in the fast packet header for 2 or more levels of discard priority in the fast packet network, and

14I) where step (14E) is utilized, padding utilizing multiple code words.

15. The packet format adaption method of claim 12 wherein a first inter-networking node performs translation of the fast packets into cells, and a second inter-networking node subsequently performs translation of said cells back into fast packets.

16. The packet format adaption method of claim 15 wherein said subsequent translating the cells into fast packets further includes, for each packet, at least one of:

16A) mapping a logical address of the cell to a fast packet logical address,

16B) mapping a congestion level of the cell to a fast packet congestion level,

26C) mapping a priority level of the cell to a fast packet priority level,

14D) reading a payload length indication field in the cell payload to determine the payload length of the fast packet,

16E) copying the payload from the cell into the fast packet,

16F) where step (16) is utilized, further including using a predetermined, possibly multi-stage, table look-up procedure for the mapping of step (16),

16G) where step (16B) is utilized, further including mapping a fast packet congestion field in fast packet header for 2 or more levels of congestion as a function of a cell relay congestion field in the cell header for 2 levels of congestion in the cell relay network, and

16H) where step (16C) is utilized, further including mapping a fast packet loss priority field in the fast packet header for 2 or more levels of fast packet discard priority as a function of a cell relay discard priority field in the cell header for 2 levels of discard priority in the cell relay network.

17. The packet format adaption method of claim 15 wherein:

17A) said first inter-networking node includes mapping a congestion and loss priority field from the header of the fast packet into a control field in the payload of the cell, and

17B) said second inter-networking node includes mapping fast packet congestion and loss priority field in fast packet header to be a boolean function of said control field in the payload of the cell and cell congestion and loss priority information in cell header.

18. The packet format adaptation method of claim 14 wherein the padding is the code word 01101010, binary, repeated.

19. The packet format adaptation method of claim 12 wherein:

19A) MAX_-- FPPL is equal to 46 octets

19B) CRPL=48 octets,

19C) SALF=1 octet, and

19D) LCF=1 octet.

20. The packet format adaptation method of claim 12 wherein:

20A) MAX_-- FPPL is equal to 47 octets

20B) CRPL=48 octets,

20C) SALF=1 octet, and

20D) LCF=0 octets.

21. A connection oriented communication network system for ensuring portability of packet traffic from a first switching type network to a second switching type network, comprising:

21A) traffic sources, for providing diverse traffic to a first networking edge node of the first switching type packet network,

21B) the first networking edge node, having a first edge traffic adapter for performing predetermined traffic type specific adaption protocols to convert various traffic types to first type packets compatible with the first type packet network, where the packets are also convertible one-to-one to second type packets that are compatible with the second type packet network,

21C) the first type packet network, operably coupled to the first networking edge node, for transporting first type packets sequentially to at least a first inter-networking node,

21D) the first inter-networking node, operably coupled to the first type packet network, for operably coupling the first type packet network to at least the second type packet network and converting the first type packets to second type packets that are compatible with the second type packet network,

21E) the second type packet network, operably coupled to the first inter-networking node, for transporting second type packets sequentially to at least a second inter-networking node,

21F) the second inter-networking node, operably coupled to the second type packet network, for operably coupling the second type packet network to at least a third type packet network and converting the second type packets to third type packets that are compatible with the third type packet network,

21G) the third type packet network, operably coupled to the second inter-networking node, for transporting third type packets sequentially to at least a second edge node,

21H) the second edge node, operably coupled to the third type packet network, having a second edge traffic adapter for performing predetermined traffic type specific adaption protocols to convert the third type packets to the original diverse traffic types that are compatible with destination sources, and

21I) destination sources, operably coupled to the second edge node, for receiving the traffic.

22. The connection-oriented communication network system of claim 21 wherein the third type of packets are packets of the first type, and the third type packet network is a packet network of the first type.

23. A connection-oriented communication network system for ensuring portability of packet traffic from a first switching type network to a second switching type network, comprising:

23A) traffic sources, for providing diverse traffic to a first edge node of the first switching type packet network,

23B) the first edge node, having a first traffic adapter for performing predetermined traffic type specific adaption protocols to convert various traffic types from the traffic sources to first type packets compatible with the first type packet network, where the packets are also convertible one-to-one to second type packets that are compatible with the second type packet network, then converting the first type packets to second type packets that are compatible with the second type packet network,

23C) the second type packet network, operably coupled to the first edge node, for transporting second type packets sequentially to at least a first inter-networking node,

23D) the first inter-networking node, operably coupled to the second type packet network, for operably coupling the second type packet network to at least a third type packet network and converting the second type packets to third type packets that are compatible with the third type packet network,

23E) the third type packet network, operably coupled to the first inter-networking node, for transporting third type packets sequentially to at least a second edge node,

23F) the second edge node, operably coupled to the third type packet network, having a second traffic adapter for performing predetermined traffic type specific adaption protocols to convert the third type packets to the original diverse traffic types that are compatible with destination sources, and

23G) destination sources, operably coupled to the second edge node, for receiving the traffic.

24. The connection-oriented communication network system of claim 23 wherein the third type of packets are packets of the first type, and the third type packet network is a packet network of the first type.

25. A connection-oriented communication network system for ensuring portability of packet traffic from a first switching type network to a second switching type network, comprising:

25A) traffic sources, for providing diverse traffic to a first edge node of the first switching type packet network,

25B) the first networking edge node, having a first edge traffic adapter for performing predetermined traffic type specific adaption protocols to convert various traffic types to first type packets compatible with the first type packet network, where the packets are also convertible one-to-one to second type packets that are compatible with the second type packet network,

25C) the first type packet network, operably coupled to the first networking edge node, for transporting first type packets sequentially to at least a first inter-networking node,

25D) the first inter-networking node, operably coupled to the first type packet network, for operably coupling the first type packet network to at least the second type packet network and converting the first type packets to second type packets that are compatible with the second type packet network,

25E) the second type packet network, operably coupled to the first inter-networking node, for transporting second type packets sequentially to at least a second edge node,

25F) the second edge node, operably coupled to the second type packet network, converts the second type packets to third type packets that are compatible with a third type packet network, and having a second edge traffic adapter for performing predetermined traffic type specific adaption protocols to convert the third type packets to the original diverse traffic types that are compatible with destination sources, and

25G) destination sources, operably coupled to the second edge node, for receiving the traffic.

26. The connection-oriented communication network system of claim 25 wherein the third type of packets are packets of the first type, and the third type packet network is a packet network of the first type.

27. A connection,oriented communication network system for ensuring portability of packet traffic from a first switching type network to a second switching type network, comprising:

27A) traffic sources, for providing diverse traffic to a first edge node of the first switching type packet network,

27B) the first edge node, having a first traffic adapter for performing predetermined traffic type specific adaption protocols to convert various traffic types from the traffic sources to first type packets compatible with the first type packet network, where the packets are also convertible one-to-one to second type packets that are compatible with the second type packet network, then converting the first type packets to second type packets that are compatible with the second type packet network,

27C) the second type packet network, operably coupled to the first edge node, for transporting second type packets sequentially to at least a second edge node,

27D) the second edge node, operably coupled to the second type packet network, converts the second type packets to third type packets that are compatible with a third type packet network, and having a second edge traffic adapter for performing predetermined traffic type specific adaption protocols to convert the third type packets to the original diverse traffic types that are compatible with destination sources, and

27E) destination sources, operably coupled to the second edge node, for receiving the traffic.

28. The connection-oriented communication network system of claim 27 wherein the third type of packets are packets of the first type, and the third type packet network is a packet network of the first type.