Method for QoS delivery in contention-based multi hop network

• US 8,077,737 B2
• Filed: 09/25/2008
• Issued: 12/13/2011
• Est. Priority Date: 09/25/2008
• Status: Expired due to Fees

• Current Assignee: AT&T Intellectual Property I LP (AT&T, Inc.)
• Original Assignee: AT&T Intellectual Property I LP (AT&T, Inc.)
• Inventors: Ji, Lusheng
• Primary Examiner(s): Phung, Luat
• Application Number:
  US12/284,868
• Publication Number:
  US 20100074273A1
• Time in Patent Office: 1,174 Days
• Field of Search: 370/465, 370/235, 370/238, 370/278, 370/311, 370/338, 370/389, 370/443, 370/455, 455/39, 455/41.2, 455/63.1, 709/227, 709/228
• US Class Current: 370/465
• CPC Class Codes: H04L 45/10 Routing in connection-oriented networks, e.g. X.25 or ATM
• CPC Class Codes: H04L 45/302 Route determination based on requested QoS
• CPC Class Codes: H04L 45/38 Flow based routing
• CPC Class Codes: H04W 28/04 Error control
• CPC Class Codes: H04W 28/26 Resource reservation
• CPC Class Codes: H04W 40/28 for reactive routing
• CPC Class Codes: H04W 74/0808 using carrier sensing, e.g. carrier sense multiple access [CSMA]
• CPC Class Codes: H04W 76/10 Connection setup
• CPC Class Codes: H04W 8/04 Registration at HLR or HSS [Home Subscriber Server]

Abstract

An arrangement and a method that, for a given pair of nodes that wish to intercommunicate with a high QoS measure, converts a portion of the contention-based network into a contention-less subnetwork by sending a reservation message and a confirmation message between the given pair of nodes. All nodes that are on the paths used for communicating between the pair of nodes are protected from interference by causing all nodes that potentially can interfere to enter a non-transmitting state.

Claims

1. A method for establishing a communication path and protocol in a network of nodes that operate asynchronously, employing a contention protocol for gaining access to the network, which path includes a forward path and a reverse path, between an originating node of said nodes and a terminating node of said nodes comprising:

said originating node sending a reservation message that is addressed to said terminating node, where the reservation message progresses through one or more nodes of said network that are included said forward path, thereby forming said forward path;

said originating node receiving a reservation confirmation message from said terminating node, where the reservation confirmation message progresses through one or more nodes of said network that are included said forward path that are included in said reverse path, thereby forming said reverse path; and

in response to said reservation message, said reservation confirmation message, or an acknowledgement message from said originating node that is subsequent to said reservation confirmation message, switching all nodes in said forward path and in said reverse path to operate asynchronously, employing a contention-less protocol, when a packet is to be transmitted, and switching all nodes of said network that can interfere with communication between said originating node and said terminating node over said communication path (neighboring nodes) to operate in a manner that cannot interfere with said communication (non-interfering mode).

2. The method of claim 1 where said contention-less protocol allows a node to transmit as soon as a message is available for transmission, or pursuant to a predetermined schedule.

3. The method of claim 1 where each of said neighboring nodes switches to said non-interfering mode upon reception of said reservation message.

4. The method of claim 1 where each of said neighboring nodes switches to said non-interfering mode upon reception of said reservation confirmation message.

5. The method of claim 1 where each of said neighboring nodes switches to said non-interfering mode upon reception of said acknowledgement message.

6. The method of claim 1 where said forward path is chosen by executing the steps where:

(a) the originating node sends a reservation message, addressed to the terminating node, which message includes a path list that contains the originating node'"'"'s address, and

(b) a node of said network that receives a reservation message (receiving node), forwards a modified reservation message, where the modified reservation message corresponds to the reservation message received by the receiving node and includes an augmented path list that reflects the forwarding of said reservation message by said receiving node, and

(c) returning to step (b) when said receiving node is other than said terminating node.

7. The method of claim 6 where

said originating node of step (a) identifies a next node in accordance with a preselected protocol, includes said next node in said path list, and sends the reservation message to said next node;

and

each receiving node of step (b) identifies its own next node in accordance with said preselected protocol, includes said its own next node in said augmented path list, and sends the modified reservation message to said its own next node.

8. The method of claim 6 where

said originating node of step (a) broadcasts the reservation message, and

each receiving node of step (b) identifies the node from which it receives said reservation message or said modified reservation message, includes the identified node in the augmented path list in said augmented reservation message, and broadcasts the augmented reservation message.

9. The method of claim 8 wherein each receiving node of step (b) that receives a plurality of broadcasted modified reservation messages selects one of the received messages from which it creates its modified reservation message to be broadcasted.

10. The method of claim 1 where said reverse path comprises the nodes that are included in said forward path.

11. The method of claim 1 where

in establishing said forward path, each node that participates in establishing the forward path employs a first protocol to determine a next node in said forward path;

and

in establishing said reverse path, each node that participates in establishing the reverse path employs a second protocol to determine a next node in said reverse path.

12. The method of claim 1 where said reservation message includes an originator field that contains identity of said originating node, a responder field that contains identity of said terminating node, and a type field that identifies the message as a reservation message.

13. The method of claim 1 where said reservation message includes one or more of the following fields:

type, specifying the message'"'"'s type;

address of said originating node;

address of said terminating node;

path list;

duration, specifying duration of the reservation requested by the reservation message;

passcode, containing encryption information;

reservation identifier;

idle time, specifying expected maximum idle time between information messages;

packet arrival interval, specifying arrival times of information messages;

step interval, specifying a frame structure for transmitting and receiving;

negotiable, specifying whether said originating node is amenable to proposed changes in the reservation;

renewal window, specifying when a renewal message might arrive;

neighbor sleep allowed, specifying whether the neighboring nodes can go to sleep for duration of said reservation; and

new channel, specifying a channel for path nodes.

14. The method of claim 1 further comprising said originating node sending a reservation termination message.

15. The method of claim 1 further comprising said originating node sending a reservation renewal message.

16. The method of claim 1 further comprising an acknowledgement message sent by said originating node following receipt of said reservation confirmation message.