Nokia Corporation

Nokia Telecommunications Oy

Nokia Siemens Networks Oy

Nokia Internet Communications, Inc.

Iii Holdings 1, LLC

Sudhir Sharan Dixit

Tao Wu

Sadhna Ahuja

Baranitharan Subbiah

Zoe Antoniou

Nasir Ghani

Edward Knightly

Chunming Qiao

Yile Guo

Yinghua Ye

Suman Sarkar

Hongyi Wu

Tau Wu

Chunsheng Xin

Baranitharan Subblah

Evsen Yanmaz

Method and apparatus for efficient management and transport of traffic over a network. The available bandwidth capacity of paths in a network may be stored in a first router. A request may be received at the first router from a network node of a second network for a signaled path through the network to a destination node. Paths may be examined by the first router and the signaled path assigned to a path from the first router to the destination node using an existing path through the network. Further, all traffic from a subnet to a given destination network may be handled by one or more mobile agents at the subnet. One or more mobile agents may be assigned to all or some of the traffic based on current path loading.

Method and system for efficient management and transport of traffic over a network

In a wireless mesh network of network nodes, there is identified a first subset of the nodes that have a direct connection to at least one end user, and a second subset of nodes that are necessary to maintain connections among the end users. The first subset is exclusive of the second subset. Nodes that are not within either the first subset or the second subset enter a power savings mode, which may include shutting down completely for a predetermined period. This enables power savings in that only the minimum number of nodes that are necessary to maintain connectivity of the end users may remain powered. A centralized node may make the decisions and inform individual nodes to shut down, or each node may run the same algorithm using the same input information and determine its own shutdown decision.

Adaptive mechanism for dynamic reconfiguration of mesh networks

Methods and systems are provided for delivering content from a website to a computer device. The website and computer device negotiate terms for use of a cache memory coupled to the computer device. The computer device requests content, such as web page objects, from the website. In addition to transmitting the requested content, the website transmits non-requested content to the computer device. The non-requested content is stored in the cache memory for later retrieval by the computer device.

Cache on demand

The present invention supports a protection path in a radio access network in order to continue communication between terminating nodes of the radio access network if a failure occurs with a communications path between the terminating nodes. A node may assume the functionality of a router, a base transceiver station, or a base station gateway. The establishment of the protection path utilizes the redundancy of connectivity in the radio access network when routing the protection path in accordance with a service protection model. The protection path may be configured with a service protection model that is based on a quality of service model or on a separate protection model. With a quality of service being associated with a traffic class, the service profile indicates the quality of service for different types of services for a user as well as the quality of service that is provided by the protection path if a failure occurs with the communications path.

Service-oriented protection scheme for a radio access network

A novel approach is provided for avoiding the 'slow-start restart' in TCP communications when network conditions dictate such. The disclosed approach serves to overcome the latency related to the 'slow-start restart' by assessing network conditions and avoiding the &#x201c;slow-start restart&#x201d; when network conditions justify the avoidance. The disclosed methods, applications and devices implement the periodic communication of a probe packet that is generated and transmitted from a TCP sender to a TCP receiver during the period that the TCP network connection remains idle. Receipt of the probe packet by the TCP receiver will trigger transmission of an acknowledgment message by the TCP receiver. Upon receipt of the acknowledgement message the TCP sender will restart measurement of the idleness period and, as such the &#x201c;slow-start restart&#x201d; is avoided.

Methods and applications for avoiding slow-start restart in transmission control protocol network communications

The present invention provides signaling protocols that enable an integrated cellular relaying system to support a call for a wireless terminal. In embodiments of the invention, the wireless terminal is redirected to a relaying path corresponding to at least one relaying station. A relaying station communicates with the wireless terminal and with other relaying stations. In addition, one of the relaying stations (that is configured in the relaying path) completes the relaying path by communicating with a base transceiver station.

Signaling and routing protocols for an integrated cellular and relaying system

Admission of new objects into a memory such as a web cache is selectively controlled. If an object is not in the cache, but has been requested a specified number of prior occasions (e.g., if the object has been requested at least once before), it is admitted into the cache regardless of size. If the object has not previously been requested the specified number of times, the object is admitted into the cache if the object satisfies a specified size criterion (e.g., if it is smaller than the average size of objects currently stored in the cache). To make room for new objects, other objects are evicted from the cache on, e.g., a Least Recently Used (LRU) basis. The invention could be implemented on existing web caches, on distributed web caches, in client-side web caching, and in contexts unrelated to web object caching.

Memory admission control based on object size or request frequency

Systems and methods are provided for delivering content in a communications system. A communications system is provided that includes a plurality of terminals and a content director. The terminals are adapted to communicate via a communications network, and are each capable of requesting and thereafter receiving content via the communications network. The content director, on the other hand, is capable of receiving a request for content from one terminal. The content director can then push the content to the terminal based upon the request, and push the content to at least one other terminal before the other terminals request the content. Each terminal can have an associated user interest correlation with each other terminal. In such instances, the content director can push the content to other terminals based upon the user interest correlation of the other terminals with respect to the terminal requesting the content.

Content delivery architecture for mobile access networks

A transport scheme is provided based on Internet protocol (IP) and multiprotocol label switching (MPLS) technology for third generation (3G) radio access networks (RAN). Label switched paths are established and managed for interconnecting base stations and radio network controllers. The process incorporates constraint-based routing and Diffserv to provide transport bearers that can support bandwidth provisioning and a variety of QoS requirements in the RAN.

IP/MPLS-based transport scheme in 3G radio access networks

A network element is deployed in a network of interconnected elements. The network element includes a shared buffer multiplexer connected to a link, a set of regulators connected to the shared buffer mulitplexer, and an admission control unit communicatively coupled to the set of regulators and the shared buffer multiplexer. Each of the set of regulators has an input traffic flow. Each traffic flow has a varying flow rate. In order to control admission of the traffic flow to the link in the network element, the admission control unit evaluates the traffic flowing into each regulator. For each traffic flow, the admission control unit receives an envelope of the flow input to the regulator. The admission control unit maximizes the entropy of a distribution of the rate of flow over all time scales. The admission control unit determines the maximum-entropy distribution for the flow using information derived from the traffic envelope, including bounds of the mean rate, the minimum rate, and the maximum rate. The admission control unit approximates the rate variance of the maximum-entropy distribution for a given maximum rate. The admission control unit makes an admission control decision based on the approximated rate variance for the given maximum rate. If the flow is admitted, the flow is set up and transmission begins.

Enforceable and efficient service provisioning

A method and system supports multilevel QoS (Quality of Service) in transferring a plurality of packets from a local peer entity to a remote peer entity of a communication system, such as a mobile environment using AAL2. During AAL2 Negotiation Procedures (ANP), QoS requirement of each user is obtained either from the user or a computed based on the call setup and is recorded in a ANP memory. After a successful call request negotiation and after a corresponding packet is received by a AAL2 service module, the packet's QoS recorded in the memory is checked. Based on the QoS, the packet is placed into a queue of the AAL2 service module with the same QoS such that a plurality of packets having the same QoS are grouped into the same queue. The packets are transferred from the local peer entity to the remote peer entity based on different QoS requirements.

Adaptive scheduling method and apparatus to service multilevel QoS in AAL2

A method of switching partial minicells in an AAL2 switching network without the need for re-assembly of the partial minicells at intermediate nodes. Identification of each remainder partial minicell ( ) is accomplished using an 8-bit channel identifier ( ), a double octet identifier ( ) or a triple octet identifier ( ) depending on traffic requirements. Each partial minicell is immediately transmitted based upon the identification code attached to each partial minicell.

Method and apparatus for efficient switching of partial minicells in ATM adaptation layer 2

A method and data structure for preventing the misconcatenation of partial packets when an even number of packets are lost over the network. A channel identifier code is added to the head of a remainder partial packet to allow the remainder partial packet to reassembled with a prior partial packet having the same channel identifier code. The method includes the steps of determining whether each packet will be divided into a first partial packet and a remainder partial packet at an ATM cell boundary, adding a CID at the beginning of each remainder partial packet, assembling the first and remainder partial packets into ATM cells, transmitting the ATM cells, receiving the ATM cells, verifying whether a first partial packet and a remainder partial packet in the received ATM cells have the same CID and assembling the first partial packet and the remainder partial packet into a single packet when the CIDs match. The method may also includes the steps of discarding the first and remainder partial packets when the CIDs do not match or sending the first partial packet to a user identified by the CID for the first partial packet and the remainder partial packet to a user identified by the CID for the remainder partial packet. The CID comprises a one byte code. The data structure for the ATM cell includes a header and a payload assembled to the header, the payload comprising at least one packet, wherein the at least one packet comprises a remainder partial packet having a channel identifier code attached thereto to identify the user for the remainder partial packet.

Growing community of inventors

Weston, MA, United States of America

Sudhir Sharan Dixit