Abstract: Systems and methods are described herein for selecting a location service based, at least in part, on service availability, capability, and/or accuracy. In one instance, the selection may be based, at least in part, on which location service that may result in the least amount of power consumed by a user device. The selection may also be balanced between user preferences and application demands for accurate and timely location services information.

Abstract: Some demonstrative embodiments include devices, systems and/or methods of estimating a location of a mobile device. For example, a location estimation entity (LE) may be configured to receive from a server location-based location-enabling source (LES) information identifying one or more location-enabling sources based on a location area of a mobile device, and to communicate with the one or more identified location-enabling sources information for estimating the location of the mobile device.

Abstract: A method and system for time synchronization in a mobile device are disclosed. The method includes negotiating a synchronization schedule. The synchronization schedule defines a plurality of synchronization times for receiving synchronization messages. The method further includes transitioning the mobile device from a first state to a second state to receive a synchronization message. The mobile device uses less power in the first state than the second state and the mobile device cannot receive the synchronization message when in the first state. The method further includes synchronizing a clock component in response to receiving the synchronization message.

Abstract: Some demonstrative embodiments include devices, systems and/or methods of location estimation of a mobile device. For example, a device may include a location error corrector to provide location data to at least one application executed by the device, the location data indicating an estimated location of the device, which is based on location information from at least one location-information generator; to receive from the application error feedback information indicating an error in the estimated location; to determine a correction based on the error feedback information; and to provide to the application corrected location data based on the correction.

Abstract: Methods, systems, and computer-readable media are provided for offloading services and functionalities from a main host central processing unit (CPU) of a computing device to a dedicated power-efficient offload engine, thereby enabling a longer battery life for the device and an enhanced set of features.

Abstract: A system, computer program product and method for distributing incoming packets among several servers or other network devices, such as routers or proxies. The distribution is based on calculations, which include data associated with each of the packets. The data is selected to be invariant from packet to packet within a session. The system and method preferably operate independently from the servers or other devices, and therefore do not require feedback from the servers, and do not require the maintenance of a session table.

Abstract: An apparatus for charging a network subscriber's prepaid network usage account in real time. The apparatus has a service engine, a service manager and a quota manager. The service engine is operable to analyze network traffic flow through the apparatus and to identify a network transaction corresponding to the account. The service engine is further operable to determine a usage quota for the subscriber. The service manager is operable to maintain information related to the subscriber and the account. The quota manager is operable to communicate with an external prepaid server.

Abstract: An apparatus for and a method of dynamically prioritizing packets over a packet based network. Packets are dynamically prioritized on the basis of their ‘time to live’ in the network as they travel from one network entity to another. Packets are assigned a priority in accordance with how ‘old’ or ‘young’ they are. Packets with a relatively long time left to live are assigned lower priority then those with relatively little time left to live. A time to live (TTL) field is added to the packet as it travels from one network entity to another. The contents of the time to live (TTL) field represents how ‘young’ or ‘old’ the packet is and conveys the time left before the packet is no longer of any use. Each network entity that receives the packet with a TTL field, subtracts from it the time the packet spends passing through that entity. The field decreases as it hops from network entity to entity until it reaches its destination or is discarded.

Abstract: A system and method for caching data, such as a Web page, for distribution to limited bandwidth devices, including but not limited to, wireless devices. A caching server causes to download at least a portion of the Web page in advance of a specific request by a Web client on the limited bandwidth device. The download request may be performed only “as needed” for a specific device, or may be performed in advance, for example in order to fulfill a predicted or expected need for a particular Web page. The requested data may be recorded and monitored in order to determine the most popular data being requested so that the caching server caches only that data deemed to be popular.

Abstract: A method of performing flow control in a PNNI network wherein a node that becomes congested advertises this fact to the network thus eliminating additional call requests and other messages that it cannot handle due to the current load. The method utilizes the Maximum Cell Rate (MCR) and Available Cell Rate (ACR) parameters provided for in the PNNI standard. When the congestion level on a local node exceeds a predetermined threshold, a PTSE with MCR set to zero and ACR set to zero is advertised to the network. The PTSE causes nodes (originating nodes in particular) to not consider that node in route calculations. When the congestion level recedes on the local node, another PTSE is generated with the original MCR and ACR that existed before the congestion occurred causing the resumption of call request messages to be forwarded to the network.

Abstract: An apparatus for and a method of learning MAC addresses in a Local Area Network (LAN) Emulation (LANE) network implemented over an Asynchronous Transfer Mode (ATM) network. The LEC or LES is adapted to detect when the ATM address associated with a MAC address is no longer valid. Once an invalid ATM address is detected the existing entry can be updated or deleted. A LEC_ID table holding LEC_ID to ATM address bindings is created. Each frame received by the LEC is sniffed in order to find mismatches between the ATM address and the LEC_ID. Optionally, an LE_ARP request message can be forwarded to the LES for learning the new binding. If the MAC address is not found in the LE_ARP table, an entry can be created and added to the table. In another embodiment, the LES is adapted to detect when the MAC to ATM address binding stored in the internal LE_ARP cache is no longer valid. The LE_ARP table is populated by examining LE_ARP request and response sent and received by the LEC.

Abstract: A method of triggering reroutes in an ATM network based on a call optimization value being reduced beyond a predefined threshold. The method utilizes a signaling element in the SETUP message called a PNNI optimization reservation signaling element that includes an optimization type, value and percentage. A switch accumulates the optimization value and passes this value to the next node along the path. In addition, the hardware in the node is configured to measure and monitor the optimization value. The optimization value is monitored for changes that exceed the predefined optimization percentage. When this is detected, the software calculates a reroute. If the new route is better than the current route and is within the optimization percentage constraints, a reroute is performed using the newly calculated route. The reroute procedure provided by the ATM Forum can be used to implement the reroute.

Abstract: An apparatus for and a method of establishing a connection between a source and destination node using multiple parallel paths. To establish a connection, bandwidth capacity on one or more parallel paths are aggregated and combined to form a route having a bandwidth larger than any single path. A technique similar to inverse multiplexing is used at the source end to split the cell stream into multiple parallel paths. At the destination end, the parallel multiple cell streams are inverse demultiplexed and the multiple cell streams combined into a single cell stream. The parallel routes are established by building parallel VCCs for the same call via the network. The ATM signaling process at the source and destination nodes is modified to accommodate multiple VCCs. In addition, the hardware at each source and destination node is configured to perform the inverse and inverse demultiplexing.

Abstract: An apparatus for and method of enabling the debugging and testing of complex multilevel PNNI based ATM networks. The invention has applications in networks wherein one or more nodes implement only the Minimum Function PNNI implementation and wherein these modes must operate correctly in a PNNI hierarchy environment. A plurality of PTSEs representing simulated virtual portions of an ATM network are injected into a node under test. The PTSEs represent hierarchical portions of ATM networks that are difficult or impossible to implement. The virtual portions of the networks may or may not have been able to be created using real physical network elements. The method includes first generating the injection file containing all the PTSEs to be simulated and then injecting this file into the node under test.

Abstract: A system comprising a single sender SMS for forwarding multicast traffic is collocated in the same device as the LEC thus creating an optimal distribution path for multicast traffic. This reduces the latency of transmission of multicast traffic from sender to receivers by eliminating the need to transmit cells from the LEC to the SMS via the network and reassemble cells into frames and segment frames into cells. The SMS functions as a private SMS for exclusive use by the LEC alone. The SMS of the present invention enables a LEC to distribute multicast traffic in a very efficient manner. The LEC communicates with the SMS directly via the operating system internal messaging subsystem or equivalent. The multicast traffic is sent on a P2M connection from the sending LEC via the SMS to all the receiving LECs interested in listening to a given MMAC. In a first embodiment, the LEC internally has knowledge of the existence of the private SMS and is inhibited from issuing a LE_ARP_REQ to find the SMS.

Abstract: A method of determining the optimum route from a source to a destination node in an ATM network utilizing fuzzy logic processing to determine the optimum route based on a set metrics that may or may not be related to each other. The invention utilizes well known fuzzy logic techniques to perform optimization and calculations based on intuitive rules rather then complex mathematical solutions. The method of the invention can be applied to routing algorithms to determine the optimum route when it is desired to optimize the route based on a large number of metrics, attributes and/or parameters. The fuzzy logic processing is divided into two phases each having its own set of rules that the input data is applied against. Fuzzy logic processing is performed for all candidate routes wherein the route chosen is the one having a maximum link quality.

Abstract: A system for reducing the memory requirements of an ATM device utilizing one or more temporary code uploads to bring needed portions of application code into the memory of the ATM embedded system on a temporary basis. The present invention functions to divide the code necessary for operation of the ATM device into two categories: (1) application code that is seldom used or code used only once and (2) all other application code. The application code that is seldom used or used only once is removed from the memory of the ATM embedded system and placed in a software storage device external to the system. This serves to significantly reduce the memory requirements of the ATM device, by as much as 40% in come cases depending on the size of the application code portions.

Abstract: A system of building a hierarchy in a PNNI based ATM network utilizing one or more proxy SVCC-based RCC entities. The invention separates the routing, signaling, etc. functions from the functions required to be performed by the peer group leader and the logical group node. A dedicated computing platform is connected to the network but does not perform functions related to routing, signaling, etc. Rather, it is dedicated to running peer group leader and logical group node functions, including complex node representation (summarization calculations) of the child peer group. The dedicated computer has PVCs connecting it to one or more entities that are termed ‘proxy SRCC’ nodes. The proxy SRCC nodes perform the SRCC functionality on behalf of the dedicated computer. When the border nodes in the peer group run the Hello FSM over outside links they each advertise the closest proxy SRCC entity, which is themselves.

Abstract: A method of distributing network resources fairly in an ATM network that is applicable in situations where a large number of clients establish connections to a single server. The method provides a way to more evenly distribute network resources when large number of clients desire connections to a popular server. A fair percentage value is assigned to a popular server and advertised in a PTSE. The fair percentage value is associated with a reachable ATM destination address and is flooded throughout the network. When a source node desires to connect to this server, the route is chosen in accordance with the fair percentage value. Rather than always selecting the best route, the source node chooses a route at random from among a percentage of the best routes. The switches can be configured with the fair percentage value either statically via a network manager or dynamically under program control.

Abstract: A method of calculating a complex node representation for logical nodes in a hierarchical peer group in a PNNI based ATM network. The summary information for default spokes, exceptions and bypasses is determined in a way that closely represents the underlying metrics associated with the peer group. A list of all border nodes in the peer group is generated and maintained and a matrix of tables is generated, one table for each metric per each class of service. The table is populated by the best value associated with the corresponding metric for a particular pair of border nodes within a particular class of service. Once the table is populated, each element is placed in a group or bin. The bins are generated by dividing the full range of the metric into a plurality of smaller subgroups or bins. The bin having a count greater than a threshold count is selected and 80% of the worst value for that group is used as the default spoke.