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: A method for managing media content streamed to users via a network includes streaming a media content file via the network to a media player for playing the media content file. When the media content file is played by a user, a media mark associated with the played media content file is created to identify a section of the played media content file which is of interest to the user. The media mark includes a start indicator, a stop indicator and a content identifier. The media mark is stored. It may be stored locally, or at a store included in the network, or at the content provider, or in any combination of these.

Abstract: A method and apparatus for controlling an interactive billboard. A billboard controller builds a UAP dataset, using the UAP dataset for audience estimation, and causing selected content to be displayed on one or more billboards based on the estimate. The UAP dataset preferably contain scored or ranked user association sets that associate users with content and other characteristics of detected interactions with the billboard.

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: A local domain name system (DNS) server communicates a request for resolving a domain name to a first remote DNS server. The first remote DNS server resolves part of the domain name and relays the request to a second remote DNS server in a hierarchy according to the DNS, thereby obviating the need of repeating by the local DNS server the request to the second remote DNS server. As a result, the latency of locating a network resource by the domain name is reduced.

Abstract: A SoftRouter architecture deconstructs routers by separating the control entities of a router from its forwarding components, enabling dynamic binding between them. In the SoftRouter architecture, control plane functions are aggregated and implemented on a few smart servers which control forwarding elements that are multiple network hops away. A dynamic binding protocol performs network-wide control plane failovers. Network stability is improved by aggregating and remotely hosting routing protocols, such as OSPF and BGP. This results in faster convergence, lower protocol messages processed, and fewer route changes following a failure. The SoftRouter architecture includes a few smart control entities that manage a large number of forwarding elements to provide greater support for network-wide control. In the SoftRouter architecture, routing protocols operate remotely at a control element and control one or more forwarding elements by downloading the forwarding tables, etc. into the forwarding elements.

Abstract: A method of characterizing a capacity region in a multi-channel, multi-radio mesh network of nodes interconnected by links. The method includes: (a) modeling the network by determining one or more link-flow feasibility constraints; (b) obtaining a feasible upper-capacity bound by solving an optimization problem using the one or more link-flow feasibility constraints as necessary conditions; and (c) using an algorithm adapted to provide a feasible lower-capacity bound by (i) receiving the solution to the optimization problem as input, (ii) allocating channels to links to meet a demand vector that satisfies the one or more link-flow feasibility constraints, and (iii) scheduling flows along the allocated channels. The upper- and lower-capacity bounds define the capacity region.

Abstract: In a network arrangement where a client requests a service from a server system, e.g., through the Internet, a multiple-load balancer is used for balancing loads in two or more server clusters in the server system to completely identify a sequence of servers for processing the service request. Each server in the resulting sequence belongs to a different server cluster. The service request is sent to the first server in the sequence, along with information for routing the request through the sequence of servers.

Abstract: The invention includes a method and apparatus for assigning an IP address to a mobile node (MN) from an IP address space represented using an address aggregation tree. A method includes receiving a request for an IP address for the MN, identifying each of a plurality of sub-tree gaps in the address aggregation tree, selecting one of the identified sub-tree gaps, and assigning an available IP address from the selected sub-tree gap to the MN. The sub-tree gaps of the address aggregation tree are identified using a recursive algorithm that traverses the address aggregation tree. The selected one of the sub-tree gaps is selected based on respective sizes of the identified sub-tree gaps. The assigned IP address is communicated to the MN for use by the MN in accessing various services.

Abstract: A method for creating a multi-level enmeshed structure is provided. The multi-level enmeshed directory structure of the present embodiments contain objects described by multiple object descriptors, which can be thought of as tags. Each object can be accessed by any one of the descriptors that describe the object and the descriptors of an object are also accessible.

Abstract: A method and system for load balancing in a multiple server system supporting multiple services are provided to determine the best server or servers supporting a service with the best response time. An induced aggregate load is determined for each of the multiple services in accordance with corresponding load metrics. A maximum induced aggregate load on a corresponding server that generates a substantially similar QoS for each of the plurality of services is determined. A load balancing server distributes the multiple services across the multiple servers in response to the determined induced aggregate and maximum induced aggregate loads, such that the QoS for each of the multiple services is substantially uniform across the servers.

Abstract: An advance is made over the prior art in accordance with the principles of the present invention that is directed to a new approach for a system and method of Single Rate Three Color Marker (srTCM) and Two Rate Three Color Marker (trTCM) methodology. The invention eliminates deficiencies present in existing standards that allow a user to defeat the traffic meter that is used to ensure bandwidth usage is within limits imposed by the provider. Adoption of these invention will ensure compliance with the goals of an ideal Single Rate Three Color Marker (srTCM) and Two Rate Three Color Marker (trTCM) scheme.

Abstract: An enmeshed hierarchy of policers, different from traditional tree-based hierarchical system of policers is used in accordance with the present invention. A goal of using an enmeshed architecture of policing systems is to allow for a more complex set of policies to be defined across a network. Hierarchical/cascading systems ensure that the higher granularity assignments essentially dictate/constrain the behavior of finer grained assignments at higher levels for sub-flows. There is only one type of metric possible for the largest granular policer, so the only way to implement multiple system-wide metrics is to repeat the hierarchy multiple times over, which adds to the delay of the packet and the complexity of the router. In accordance with the enmeshed architecture of the present invention, multiple system-wide metrics can be implemented simultaneously, which allows for easier management of the various macro-level policies by the manager of an access network.

Abstract: The SoftRouter architecture separates the implementation of control plane functions from packet forwarding functions. In this architecture, all control plane functions are implemented on general purpose servers called the control elements (CEs) that may be multiple hops away from the forwarding elements (FEs). A network element (NE) or a router is formed using dynamic binding between the CEs and the FEs. The flexibility of the SoftRouter architecture over conventional routers with collocated and tightly integrated control and forwarding functions results in increased reliability, increased scalability, increased security, ease of adding new functionality, and decreased cost.

Abstract: In one embodiment, a method for estimating the cardinality of one or more tags in a system that has the one or more tags and one or more readers. The reader issues a command requesting that the tags identify themselves. The command includes timing information defining a total number of timeslots. In response to the command, each of the one or more tags (i) selects a timeslot in which to reply to the command and (ii) issues a reply in the selected timeslot.

Abstract: A method of routing data in a multi-hop network. In one embodiment, the method includes: determining that a link-flow vector representing a set of flows to be routed from a source to a destination node satisfies necessary scheduling conditions for achievability; generating a scheduling multi-graph having at least one pair of nodes with multiple edges therebetween; deriving one or more sufficient scheduling conditions for achievability of the vector; solving a linear optimization problem over the necessary scheduling conditions to obtain an upper bound on achievability of the vector; and generating, based on the scheduling multi-graph, a routing solution that is a lower bound on the achievability of the vector and has a set of routes and associated schedule for achieving the vector. At least one node v receives transmissions from a specified plurality ?(v) of other nodes. At least one of the scheduling conditions depends on ?(v).

Abstract: The invention includes a method and apparatus for assigning an IP address to a mobile node (MN) from an IP address space represented using an address aggregation tree. A method includes receiving a request for an IP address for the MN, identifying each of a plurality of sub-tree gaps in the address aggregation tree, selecting one of the identified sub-tree gaps, and assigning an available IP address from the selected sub-tree gap to the MN. The sub-tree gaps of the address aggregation tree are identified using a recursive algorithm that traverses the address aggregation tree. The selected one of the sub-tree gaps is selected based on respective sizes of the identified sub-tree gaps. The assigned IP address is communicated to the MN for use by the MN in accessing various services.

Abstract: The invention manages an IP address space in a mobility network, including partitioning of the IP address space, assignment of IP addresses from the IP address space, and/or use of hysteresis to control reassignment of IP addresses from the IP address space. The IP address assignment is performed using one or more residual time statistics from a residual time profile maintained for the mobile node requesting assignment of an IP address. A residual time profile of a mobile node includes one or more residual time statistics associated with the mobile node. The residual time statistics for a mobile node are determined using a residual time associated with each IP address assigned to the mobile node. The IP address space partitioning is performed using residual time statistics maintained for mobile nodes of the network. The reassignment of IP addresses from the IP address space is controlled using hysteresis.