Abstract: A capability is provided for supporting fault-resilient multicast using multiple sources. A method for supporting fault-resilient propagation of multicast traffic using Redundant Multicast Trees (RMTs) includes identifying each potential Shared Risk Link Group (SRLG) conflict associated with a pair of RMTs providing node-disjoint paths to a plurality of destination nodes, identifying each potential SRLG conflict that is an actual SRLG conflict, and, for each actual SRLG conflict, determining a detour path for protecting the links of the actual SRLG conflict. The pair of RMTs includes a first RMT from a first multicast source node to each of the destination nodes and a second RMT from a second multicast source node to each of the destination nodes. Each potential SRLG conflict includes a plurality of links.

Abstract: A method is provided for enabling a base station to infer a compact topology graph among a set of mobile nodes in its cell, the mobile nodes having a secondary radio to enable inter-nodal communication. This methodology ensures that nodal membership information is gathered within approximately 100 ms, and additional topology information is gathered from all the mobile nodes within approximately 300 ms over Wi-Fi radios. In dense networks, this time can be reduced to within 100 ms.

Abstract: Various methods and devices are provided to address the need for improved multicast operation. In one method, a station transmits (401) a multicast packet to a plurality of mobile devices and to a group of monitoring stations (MSs). An indication of whether the multicast packet was received by that MS is received (402) from each monitoring station (MS) of the group of MSs. When this indication indicates that the multicast packet was not received, the multicast packet is retransmitted (403) to the plurality of mobile devices and to the group of MSs.

Abstract: Various methods and devices are provided to address the need to reduce paging latency. In one method, a wireless network determines (201) a number of mobiles to be paged in a wireless coverage area that are members of a paging group. If (202) the determined number of mobiles to be paged exceeds a group-page-threshold, then the wireless network pages (203) members of the paging group in the wireless coverage area using a group-id.

Abstract: Various methods and devices are provided to address the need to reduce paging latency. In one method, a wireless network determines (201) that a page for a mobile needs to be transmitted over a target broadcast area. The wireless network schedules (202) the transmission of the page in an upcoming paging timeslot based on the target broadcast area and then pages (203) the mobile in the target broadcast area before transmitting an earlier scheduled page for another mobile with a different target broadcast area.

Abstract: The number of directional antennas and associated radios needed to ensure a nomadic wireless mesh network (NWMN) remains operational in the event of node or link failures, while minimizing delay and other unwanted effects, may be determined using novel methods and devices. Such a determination may reduce the number of antennas and radios a service or network provider normally uses, thus reducing its costs.

Abstract: The number of directional antennas and associated radios needed to ensure a nomadic wireless mesh network (NWMN) remains operational in the event of node or link failures, while minimizing delay and other unwanted effects, may be determined using novel methods and devices. Such a determination may reduce the number of antennas and radios a service or network provider normally uses, thus reducing its costs.

Abstract: A computer-readable medium has tangibly embodied thereon and accessible therefrom a set of instructions interpretable by at least one data processing device. The set of instructions is configured for causing the at least one data processing device to carry out operations for estimating a delay for each one of a plurality of packets of a VOIP traffic flow and for allocating a delay budget for each one of the packets dependent upon the estimated delay thereof. Such estimating is performed at a fixed location between end locations of a path over which the packets traverse and is performed using packet timestamp information acquired from the packets only at the fixed location.

Abstract: An efficient protection scheme for MPLS multicast is disclosed for protection of Point-to-Multi-Point LSP connections. The efficient protection scheme for MPLS multicast includes a pair of Redundant Multicast Trees for each multicast connection which connects the source of a multicast LSP to all its destinations in such a way that in the event of a single link or node failure in the network, every destination node is still connected to the root node in at least one of the two trees. Furthermore, a method is disclosed that ensures that existing Redundant Multicast Trees can adapt to changes in the set of destination nodes and/or network topology changes without significant modifications. The efficient protection scheme for MPLS multicast is particularly useful for reducing the protection bandwidth requirements over protection methods known in the art.

Abstract: The invention includes a method and apparatus for improving a channel change response time. A method includes propagating a plurality of media streams toward at least one user terminal using a respective plurality of multicast groups and propagating a meta channel toward the at least one user terminal for conveying information adapted for use in selecting one of the media streams in a manner tending to improve the channel change response time. The media streams include an original media stream conveying media content and at least one auxiliary media stream, generated from the original media stream, where each of the at least one auxiliary media stream conveys the media content of the original media stream, where each of the at least one auxiliary media stream is offset in time with respect to the original media stream. The information conveyed by the meta channel is associated with the media streams.

Abstract: A capability is provided for supporting fault-resilient multicast using multiple sources. A method for supporting fault-resilient propagation of multicast traffic using Redundant Multicast Trees (RMTs) includes identifying each potential Shared Risk Link Group (SRLG) conflict associated with a pair of RMTs providing node-disjoint paths to a plurality of destination nodes, identifying each potential SRLG conflict that is an actual SRLG conflict, and, for each actual SRLG conflict, determining a detour path for protecting the links of the actual SRLG conflict. The pair of RMTs includes a first RMT from a first multicast source node to each of the destination nodes and a second RMT from a second multicast source node to each of the destination nodes. Each potential SRLG conflict includes a plurality of links.

Abstract: A system and method providing fault resilient multicast services using a network topology in which a source node communicates with a plurality of receiver nodes via at least two disjoint paths in which at least one receiver node is provisioned according to a 1+1 protection mechanism.

Abstract: Association control is utilized for associating wireless local area network users with at least one wireless local area network access point and thereby achieving simultaneous fairness and load balancing. In the present method, a network operation center receives user parameters from each user in the wireless network via the access points. It then sets out both to determine a set of associations between each user and one or more access points based on the user parameters using fractional load balancing and produce a second set of associations by rounding so that, in said second set, each user is associated with only one access point. The present method achieves close to optimal load balancing and max-min fairness while outperforming commonly-used heuristic approaches.

Abstract: A capability is provided for supporting fault-resilient propagation of traffic in networks using redundant multicast trees (RMTs). Fault-resilient propagation of traffic from a first node to a second node is supported using one or both of a pair of RMTs rooted at the first node and a pair of RMTs rooted at the second node. The pair of RMTs rooted at the first node includes a pair of node-disjoint paths from the first node to the second node. The pair of RMTs rooted at the second node includes a pair of node-disjoint paths from the second node to the first node. The first node propagates multicast traffic toward the second node using at least one of the RMTs in the pair of RMTs rooted at the first node. The first node propagates unicast traffic toward the second node using at least one of: at least one of the RMTs in the pair of RMTs rooted at the first node, or at least one of the RMTs in the pair of RMTs rooted at the second node.

Abstract: Embodiments described include methods of determining neighboring nodes with which to link a subject node in a wireless communication network. Depending on the network preferences, the links between neighbor nodes and the subject node may include high capacity links or fault resilient high capacity links. The number of neighboring nodes may be as high as ten in a fault resilient high capacity network and five or less for a high capacity network.

Abstract: A system and method providing fault resilient multicast services using a network topology in which a source node communicates with a plurality of receiver nodes via at least two disjoint paths in which at least one receiver node is provisioned according to a 1+1 protection mechanism.

Abstract: A method comprises allocating a respective restoration path to protect each of a plurality of primary paths in a network. Each primary path has a plurality of nodes and at least two subpaths connecting the nodes of the primary path. Each restoration path includes at least one link. Each link protects at least one of the subpaths of the primary path. Each of the subpaths of the primary path is protected. None of the links in the restoration path is included in the corresponding primary path. At least one of the links is shared among at least two restoration paths corresponding to at least two of the primary paths.

Abstract: Methods and apparatus are provided for improved coverage verification schemes in a wireless sensor network that do not require information about the location of sensor nodes in the wireless sensor network. Coverage holes are detected by a first node in a wireless sensor network by obtaining an estimate of a distance to each of a plurality of additional nodes in a transmission radius of the first node; determining a relative location of each of the plurality of additional nodes in the coordinate system of the first node; identifying border segments of a sensing border of the first node, where each of the border segments comprises a section of a sensing border of the first node that is covered by a sensing radius of at least one of the additional nodes; and determining if a coverage hole exists for the first node by determining if a plurality of the border segments comprise a cyclic segment sequence.

Abstract: A configurable access network (CAN) architecture is used to identify primary routing paths that allows each wireless station within a static, multi-hop wireless CAN to route packetized data in a way that simplifies the operation of each station and makes more efficient use of the limited energy available to each station.

Abstract: A method may include allocating channels of a wireless local area network (WLAN) including a plurality of access points to the plurality of access points based on a load of each access point. The load of each access point may include a user load and/or an interference load. The user load may be generated by each user of the access point. The interference load may be based on interference caused by transmissions between the remainder of the plurality of access points and users of the remainder of the plurality of access points.