Packet data communications system having a malfunction list

• US 5,805,569 A
• Filed: 04/30/1996
• Issued: 09/08/1998
• Est. Priority Date: 04/30/1996
• Status: Expired due to Fees

• Current Assignee: Telefonaktiebolaget LM Ericsson
• Original Assignee: Telefonaktiebolaget LM Ericsson
• Inventors: Andersson, Per Erik, Lindqvist, Pontus, Andersson, Ingvar Gustaf, Henriksson, Anders
• Primary Examiner(s): Patel, Ajit
• Application Number:
  US08/640,445
• Time in Patent Office: 861 Days
• Field of Search: 370/229, 370/930, 370/935, 370/936, 370/937, 370/252, 370/253, 370/351
• US Class Current: 370/229
• CPC Class Codes: H04L 47/10 Flow control; Congestion control

Abstract

A packet switching network having a malfunction list is provided to reduce network congestion. According to an exemplary embodiment, each node in the network includes a malfunction list which stores an unavailability value representing a state of unavailability of certain addressees in the network. Before sending a packet to an addressee, the node consults its own malfunction list to determine the unavailability value of the addressee. A packet addressed to an unavailable addressee is selectively returned to the sender by the node rather than travelling through the network to the addressee and back through the network to the sender. Packets can be returned to the sender with a probability proportional to the unavailability value of the addressee so that transmission is gradually resumed after a state of unavailability as the unavailability value decreases over time.

Claims

1. A packet switching method comprising the steps of:

detecting in a node in a transmission path from a first user of a packet switching network to a second user a state of unavailability of the second user;

storing in the node a value representing the state of unavailability of the second user; and

selectively returning a packet received from the first user and addressed to the second user to said first user from the node based on the value representing the state of unavailability of the second user.

2. The packet switching method of claim 1, wherein the unavailability state of the second user is detected by determining that a packet received at the node was returned before reaching the second user.

3. The packet switching method of claim 1, wherein the unavailability state of the second user is detected by receiving at the node a message which identifies the addressee as being unavailable.

4. The packet switching method of claim 1, wherein the node is a source node.

5. The packet switching method of claim 1, further comprising the steps of:

representing the state of unavailability of the second user with a value which ranges between a first number and a second number;

generating a random number which is normalized to range between the first number and the second number; and

returning a packet received from the first user to said first user when the normalized random number is less than the value which represents the state of unavailability of the second user.

6. The packet switching method of claim 1, further comprising the step of decreasing over time the value representing the state of unavailability of the second user.

7. The packet switching method of claim 1, further comprising the step of storing in said node a plurality of values which represent states of unavailability of a plurality of users of the network.

8. The packet switching method of claim 1, further comprising the steps of:

representing the state of unavailability of the second user with a value which ranges between a first number and a second number;

setting a threshold value between the first number and the second number; and

returning a packet received from the first user to said first user when the value representing the state of unavailability of the second user is greater than the threshold value.

9. The packet switching method of claim 1, wherein the node is connected to a second node of a different level in a hierarchical packet switching network.

32. The packet switching method of claim 1, wherein said value is associated with a probability that said second user is unavailable.

10. A packet switching apparatus comprising:

a first node and a second node which transmit and receive packets in a transmission path between a first user and a second user;

a control processor which detects in the first node a state of unavailability of the second user;

a memory for storing in the first node a value representing the state of unavailability of the second user; and

wherein the control processor selectively returns to the first user a packet received from the first user and addressed to the second user based on the value representing the state of unavailability of the second user stored in the memory.

11. The packet switching apparatus of claim 10, wherein the first node and the second nodes are source nodes.

12. The packet switching apparatus of claim 10, wherein at least one of the first node and the second node is an intermediate node not directly connected to the first user or to the second user.

13. The packet switching apparatus of claim 10, wherein the value representing the state of unavailability of the second user ranges between a first number and a second number;

and

wherein the first node further comprises a random number generator for generating a random number normalized between the first number and the second number, and wherein the control processor returns a packet received from the first user to the first user when the random number generated by the random number generator is less than the value representing the state of unavailability of the second user.

14. The packet switching apparatus of claim 10, wherein the control processor is adapted to decrease over time the value representing the state of unavailability of the second user.

15. The packet switching apparatus of claim 10, wherein the value representing the state of unavailability of the second user ranges between a first number and a second number;

and

wherein the first node comprises a memory for storing a threshold value ranging between the first number and the second number, and wherein the control processor returns a packet received at the first node from the first user to the first user when the value representing the state of unavailability of the second user is greater than the threshold value.

16. The packet switching apparatus of claim 10, wherein the control processor returns a packet received at the first node from the first user to the first user with a probability based on the value representing the state of unavailability of the second user.

17. The packet switching apparatus of claim 10, wherein the control processor detects the state of unavailability of the second user by receiving a message which identifies the second user as being unavailable.

18. The packet switching apparatus of claim 17, wherein the message is a packet returned to the first user before reaching the second user.

33. The packet switching apparatus of claim 10, wherein said value is associated with a probability that said second user is unavailable.

19. A method comprising the steps of:

receiving at a first node a packet from a first party to be transmitted to a second party;

recalling at the first node a value stored in the first node which represents a state of unavailability of the second party; and

selectively returning the packet to the first party from the first node based on the value stored in the first node which represents the state of unavailability of the second party.

20. The method of claim 19, further comprising the step of detecting in the first node a state of unavailability of the second party.

21. The method of claim 20, wherein the step of detecting the state of unavailability of the second party is carried out by receiving a message in the first node which identifies the second party as being unavailable.

22. The method of claim 19, further comprising the step of detecting in a second node in a transmission path between the first party and the second party a state of unavailability of the first party.

23. The method of claim 22, wherein the first node and the second node are source nodes.

24. The method of claim 22, wherein at least one of the first node and the second node is an intermediate node not directly connected to the first party or to the second party.

25. The method of claim 19, wherein the packet is returned to the first party from the first node with a probability equal to the value representing the state of unavailability of the second party.

26. The method of claim 19, further comprising the step of periodically decreasing the value representing the state of unavailability of the second party.

27. The method of claim 19, further comprising the step of storing in the first node the value which represents the state of unavailability of the second party responsive to receiving at the first node a packet returned to the first party before reaching the second party.

28. A packet switching network comprising:

a plurality of source nodes which form a first level in a hierarchy of the packet switching network, each of the source nodes including;

means for detecting a state of unavailability of an addressee;

a memory for storing a value representing the state of unavailability of the addressee detected by the detecting means; and

means for selectively returning a packet addressed to the addressee based on the value representing the state of unavailability of the addressee stored in the memory; and

a plurality of intermediate nodes, connected to the source nodes, which form a second level in the hierarchy of the packet switching network.

29. The packet switching network of claim 28, wherein each of the intermediate nodes also comprises:

said means for detecting a state of unavailability of an addressee;

said memory for storing a value representing the state of unavailability of the addressee detected by the detecting means; and

said means for selectively returning a packet addressed to the addressee based on the value representing the state of unavailability of the addressee stored in the memory.

30. The packet switching network of claim 28, wherein the means for detecting detects a state of unavailability of an addressee based on a packet being returned before reaching the addressee.

31. The packet switching network of claim 28, wherein the means for detecting detects a state of unavailability of an addressee based on receiving a message which identifies the addressee as being unavailable.