Abstract: An architecture by which combined scheduling and network coding can be used in mesh networks, and more particularly wireless mesh networks. In various embodiments, this architecture includes a scheduling MAC protocol for scheduling nodes in the mesh network in order to take advantage of network coding opportunities. The schedule takes advantage of these opportunities by assigning a gain to transmit packets based upon the number of packets that are transmitted concurrently and choosing a schedule which minimizes the gain over the scheduling horizon. Regarding the assigned gain, in one embodiment this value is one for basic non-encoded operations and two or more for encoded operations. A scheduling MAC protocol is also used to announce and arbitrate network coding opportunities by indicating which packets (as characterized by their transmission slot) are to be encoded with each other.

Abstract: A method of transmitting data in a communication system from a first node to destination node comprising transmitting the data from the first node to an intermediate node; determining if the intermediate node communicated with the destination node more recently than the first node that transmitted the data to the intermediate node communicated with the destination node; forwarding the data from the intermediate node to a further node if the intermediate node communicated with the destination node more recently than the first node that transmitted the data to the intermediate node communicated with the destination node.

Abstract: An opportunistic ad hoc routing protocol system and method includes a dynamic ad hoc network having one or more nodes configured to communicate wirelessly with each other. Each node is configured to implement a routing protocol wherein a list of possible relay nodes is stored in each of the one or more nodes' routing tables. In addition, each node is configured to implement a protocol adapted to allow different nodes to receive the same packet. Further, each node is adapted to update the list of possible relay nodes in order to capture a change in the ad hoc network.

Abstract: A method and apparatus is disclosed herein for a resource allocation protocol. In one embodiment, the apparatus comprises a resource allocation engine to allocate physical resources to primary and redundant virtual infrastructures, wherein, when the resource allocation engine allocates virtual infrastructures, physical resources of redundant virtual infrastructures are shared across multiple primary virtual infrastructures.

Abstract: A method and apparatus is disclosed herein for scalable routing with greedy embedding. In one embodiment, the method comprises storing log(n) coordinates in a routing table, where n is the number of nodes in a network, and further wherein the log(n) coordinates are generated by constructing a greedy embedding that embeds a graph topology depicting connections between n nodes of a network into a geometric space so as to use greedy forwarding by generating a spanning tree out of a connection graph representing the connections between the n nodes of the network, decomposing the tree into at most n branches, assigning a set of geometric coordinates to vertices in the tree in an n-dimensional space, and projecting the set of geometric coordinates onto a k-dimensional space, where k is less than n, to create the log(n) coordinates; and routing packets via nodes of the network using the log(n) coordinates in the routing table.

Abstract: A quality of service (QoS) signaling packet for arranging QoS connections upon handoff between a mobile node (MN) and a correspondent node (CN) using Internet Protocol (IP), the signaling packet includes one or more QoS flow requirements, one or more classifier parameters, QoS session identification information composed of a previous QoS session ID, a new QoS session ID, and a sequence number. The QoS session IDs are used for establishing a new data path and for added security against spoofing, can be composed of a key-based signature combination of a mobile node's new care of address (CoA) and the sequence number. The packet may also include a previous node address and a cookie, both of which are inserted by a previous node. The previous router address is used for backtracking communications and establishing/updating flow tables while the cookie is used for authentication of node-to-node messages.

Abstract: Various example embodiment are disclosed. An example embodiment may include sending, by a relay node in a wireless network, a ready to send message to a plurality of wireless nodes. The ready to send message may indicate access channels for each of the wireless nodes to send clear to send messages. This example may also include receiving, via the indicated access channels for sending the clear to send messages, the clear to send messages from each of the wireless nodes. This example may also include sending an XOR-ed packet to the wireless nodes in response to receiving the clear to send messages. The XOR-ed packet may indicate access channels for each of the wireless nodes to send acknowledgment messages.

Abstract: A quality of service (QoS) signaling packet for arranging QoS connections upon handoff between a mobile node (MN) and a correspondent node (CN) using Internet Protocol (IP), the signaling packet includes one or more QoS flow requirements, one or more classifier parameters, QoS session identification information composed of a previous QoS session ID, a new QoS session ID, and a sequence number. The QoS session IDs are used for establishing a new data path and for added security against spoofing, can be composed of a key-based signature combination of a mobile node's new care of address (CoA) and the sequence number. The packet may also include a previous node address and a cookie, both of which are inserted by a previous node. The previous router address is used for backtracking communications and establishing/updating flow tables while the cookie is used for authentification of node-to-node messages.

Abstract: An architecture by which combined scheduling and network coding can be used in mesh networks, and more particularly wireless mesh networks. In various embodiments, this architecture includes a scheduling MAC protocol for scheduling nodes in the mesh network in order to take advantage of network coding opportunities. The schedule takes advantage of these opportunities by assigning a gain to transmit packets based upon the number of packets that are transmitted concurrently and choosing a schedule which minimizes the gain over the scheduling horizon. Regarding the assigned gain, in one embodiment this value is one for basic non-encoded operations and two or more for encoded operations. A scheduling MAC protocol is also used to announce and arbitrate network coding opportunities by indicating which packets (as characterized by their transmission slot) are to be encoded with each other.

Abstract: A device comprises a first binding unit which provides for a binding to a first tunnelling server using a first protocol, a second binding unit which provides for a binding to a second tunnelling server using a second protocol different from the first protocol, and an authorizing unit which causes the first or second binding unit to provide the binding.

Abstract: A quality of service (QoS) signaling packet for arranging QoS connections upon handoff between a mobile node (MN) and a correspondent node (CN) using Internet Protocol (IP), the signaling packet includes one or more QoS flow requirements, one or more classifier parameters, QoS session identification information composed of a previous QoS session ID, a new QoS session ID, and a sequence number. The QoS session IDs are used for establishing a new data path and for added security against spoofing, can be composed of a key-based signature combination of a mobile node's new care of address (CoA) and the sequence number. The packet may also include a previous node address and a cookie, both of which are inserted by a previous node. The previous router address is used for backtracking communications and establishing/updating flow tables while the cookie is used for authentication of node-to-node messages.

Abstract: A method comprising transmitting a busy signal from a first node; receiving said busy signal at a second node; and transmitting data from said second node to said first node on a channel associated with said busy signal.

Abstract: The invention provides, according to one embodiment, a system and method for determining an optimum route time-out value. The method may include determining a route from a source node to a destination node, and forwarding a route request from the source node to an intermediate node. The method further includes dynamically computing, at the intermediate node, a number of hops that the route has traversed since the source node. The adaptive route time-out value (ART) for a route to the destination node is then set to be a value that is a function of the number of hops, f(N).

Abstract: A method of transmitting data in a communication system from a first node to destination node comprising transmitting the data from the first node to an intermediate node; determining if the intermediate node communicated with the destination node more recently than the first node that transmitted the data to the intermediate node communicated with the destination node; forwarding the data from the intermediate node to a further node if the intermediate node communicated with the destination node more recently than the first node that transmitted the data to the intermediate node communicated with the destination node.

Abstract: An opportunistic ad hoc routing protocol system and method includes a dynamic ad hoc network having one or more nodes configured to communicate wirelessly with each other. Each node is configured to implement a routing protocol wherein a list of possible relay nodes is stored in each of the one or more nodes' routing tables. In addition, each node is configured to implement a protocol adapted to allow different nodes to receive the same packet. Further, each node is adapted to update the list of possible relay nodes in order to capture a change in the ad hoc network.

Abstract: The use of bandwidth constrained wireless links in mobile networks necessitates the use of bandwidth saving header compression schemes. In these schemes, a compressor and a decompressor collaborate to code bulky IP headers into streamlined compressed headers. The gain of establishing the compressed header state in a greedy manner, without the compressor waiting for the decompressor's acknowledgment is evaluated. The impact of header compression on the traffic pattern, and the consequences on the channel allocation or connection admission control are also evaluated. A decision method for channel allocation or for connection admission control are proposed that maximizes the bandwidth utilization of the channel while providing some performance guarantees in terms of delay.

Abstract: A differentiated service network having a plurality of routers. An operating condition such as stability may be determined at a first router. An indication of the operating condition may be propagated from a first router to a second router such as an edge router. Based on the indication of the operating condition, one or more parameters of a constraint may be adjusted. The indication may be a signal corresponding to a network traffic status.

Abstract: Due to bandwidth constraints on the wireless link in an IP network, it is useful to compress the headers so as to maximize the utilization of the link. There exists Header Compression algorithms that make use of the similarity in consecutive headers in a packet flow to compress these headers. In this document, a novel header compression scheme was introduced that makes use of the similarity in consecutive flows from or to a given mobile terminal to compress these headers. Using information theory, the optimal gain to be expected from the use of such a scheme was analyzed. A model was defined for the distribution of the connections of a single user over the address space. The compression scheme was evaluated with respect to this model and to actual internet data traces. The scheme is complementary and the benefits are additional to the traditional approach to header compression. However, the scheme outperforms current schemes with respect to actual internet traces.

Abstract: A method of scheduling data transmission between a plurality of nodes in a wireless communication network, the method comprising: defining a plurality of rate bins each defined by a quantile index; receiving transmission requests from said nodes, said requests each defining a data rate; assigning a value to each request based on the rate defined in the request and the quantile indices of the rate bins; and effecting a scheduling decision based on the value assigned to the request.

Abstract: The system and method provides virtual mobility to an application by using a mobile router tunneling protocol (MRTP). The system and method use a MRTP to enable bi-directional tunneling between gateways so as to facilitate processing at a second network cluster in a way that is transparent to the user.