Telcordia Technologies, Inc.

Lucent Technologies Inc.

Toyota Motor Corporation

Tti Inventions D LLC

Telcordia Applied Research Center Taiwan Company

Telcodia Applied Research Center Taiwan Co.

Telcordia Applied Research Taiwan Company

Chung-Min Chen

Wai Chen

Phone Lin

Yibei Ling

Tao Zhang

Randeep Singh Bhatia

Ming-Syan Chen

Marcus Pang

Shengwei Cai

Yuan-Ying Hsu

Rakesh Kumar Sinha

Yen-Cheng Lai

Russell Hsing

Wanjiun Liao

Shan-Hung Wu

Chen-Kai Hsieh

Yun-Yin Huang

Peer-to-peer mobility management in heterogeneous IP networks provides a peer-to-peer mobility module operable to intercept a data packet received at a communication protocol layer of an Internet Protocol communication stack. A translation table may be stored on memory device. The translation table stores real address of one or more network interfaces and a corresponding virtual address. The peer-to-peer mobility module may be further operable to modify the intercepted data packet using the real address and virtual address stored on the translation table.

Peer-to-peer mobility management in heterogeneous IPV4 networks

Disclosed is an improved proactive location based routing protocol for ad-hoc wireless networks. When a source node has a data packet to send to a destination node, the source node calculates an estimated future location of the destination node prior to forwarding a data packet to the destination node. The estimated future location may be based on the last known location, velocity and bearing of the destination node, as well as upon the estimated propagation delay (i.e., the estimated time it will take the data packet to reach the destination node after being transmitted by the source node). The source node routes the data packet by identifying which one of a plurality of its neighbor nodes is closest to the estimated future location of the destination node, and routes the data packet the identified neighbor node as an intermediate node along the route from the source node to the destination node. Further, the frequency of flooding broadcasts is based on the velocity of the network nodes. As the velocity of a network node increases, the rate at which the node broadcasts its location and mobility data also increases. The broadcast frequency of a network node may be dynamically adjusted as its velocity changes.

Proactive location based routing in a wireless ad-hoc network

In a Vehicular Ad Hoc Network (VANET) a hybrid method combines SDMA (Space Division Multiple Access) and dynamic TDMA (Time Division Multiple Access) that divides the roadway into regions (whose size is larger than the SDMA unit) where each region is allocated a pool of radio channels based on SDMA and may contain a limited number of vehicles. Vehicles within the same region compete for and access the channels using dynamic TDMA. A channel allocation scheme that maps the pool of channels to the regions such that when a vehicle acquires multiple channels (time slots) in a region, the intervals among the channels are as uniform as possible, thus minimizing the waiting time of the messages to be broadcast by the vehicle, which is critical for safety related applications. This solution is referred to as R-SDMA (Region based SDMA).

Region-based clustering mechanism for channel access in vehicular Ad Hoc networks

An asymmetric and asynchronous energy conservation protocol for vehicular networks is provided. In one aspect, an a-quorum may be defined for one or more members for the one or more members to establish asymmetric links to contact the cluster head. An s-quorum for the cluster head to establish symmetric link between the cluster heads and relays may be defined.

Asymmetric and asynchronous energy conservation protocol for vehicular networks

A channel buffering method is for dynamically altering a number of channels for an Internet protocol television (IPTV). The method is applicable for a home gateway (HG) having a channel section used for channel buffering. After the HG has received two consecutive channel-switching requests, the HG compares whether the two requests are similarly directed to switching a channel towards the same direction or not; if yes, a cumulative switching frequency is set, and two trimming numerical values are set through the cumulative switching frequency, and thus, the channel section for buffering the channels can be dynamically adjusted through the two trimming numerical values.

Channel buffering method for dynamically altering channel number of internet protocol television

A plurality of servers for processing client requests forward the requests among themselves to achieve a balanced load. When a server initially receives a client request, it randomly selects another of the plurality of servers, referred to as a first-chance server, and forwards the request to this server. Upon receiving the request, the first-chance server determines if it is overloaded and if not, processes the request. However, if overloaded, the first-chance server compares its load to the load of one or more predetermined next-neighbor servers. If the next-neighbor server(s) are more loaded than the first-chance server, the first-chance server processes the request. Otherwise, the first-chance server forwards the request to the least loaded next-neighbor server. The next-neighbor receiving the request either processes it directly, or alternatively, based on its current load and that of its next-neighbor server(s), forwards the request to another next-neighbor server for processing.

Distributed request routing

A method of declustering data among a number of storage units, e.g., disks, to minimize response time for range queries. Data to be stored is identified in the form of a dataset, wherein the data is divided among uniform data blocks (x, y) and each data block is to be stored in one of a number (M) of storage units each of which has an associated seek time. M pairs (i, key ) are defined wherein i&equals;0,1, . . . m&minus;1 and key is the fractional part of 2i/(1&plus;5). First components of the pairs are ordered according to an ascending order of the key values of the pairs, thus defining a permutation array A of size M. Another permutation array B is defined such that for i&equals;0,1, . . . ,M&minus;1 B&lsqb;a(i)&rsqb;&equals;i, and data block (x,y) is assigned to storage unit (x&minus;B&lsqb;y mod M&rsqb;)mod M, wherein mod is the remainder function.

Storage disk declustering method

Growing community of inventors

Taipei, Taiwan

Chung-Min Chen