Alcatel Lucent

Alcatel-lucent USA Inc.

Amazon Technologies, Inc.

Nokia of America Corporation

Marina Thottan

Peter Johannes Winzer

Li Erran Li

Vladimir Y Kolesnikov

John Edward Simsarian

Young Jin Kim

Tirunell V Lakshman

Tin Kam Ho

David T Neilson

Sanjoy Paul

John William Evans

Bin Yao

Fabien Chraim

Binh Quang Nguyen

Frederick Bruce Shepherd

Nakjung Choi

Kyle Guan

Arun Vishwanath

Vijay Sivaraman

Shivani Deshpande

Ravi S Prasad

Fei Li

Minlan Yu

Young-Jin Kim

Binh Nguyen

In computing networks, path availabilities are estimated according to the present disclosure. The path availabilities may be calculated based on connectivity and performance measurements provided by multiple data sources, including passive, active, and/or route monitoring data sources. The measurements may be classified using network topology and processed to determine availability indicators corresponding to the measurements. The availability indicators may be aggregated to determine an overall path availability score for a path associated with the indicators.

Estimating network availability using connectivity and performance data

In one example embodiment, a distributed platform includes at least one node for performing baseband processing of signals, the at least one node including a memory and a processor. The memory has computer-readable instructions stored therein. The processor is configured to the execute computer-readable instructions to enable independent operations of a plurality of radio protocol stacks and a plurality of backhaul protocol stacks for performing the base band processing functions of a plurality of base stations, each of the plurality of base stations being configured to serve one or more user devices. The processor is further configured to manage data packet flows between the plurality of radio protocol stacks and the plurality of backhaul protocol stacks.

Programmable system architecture for routing data packets in virtual base stations

A capability for cross-layer aware communication of a multipath data flow via a communication network is presented. The multipath data flow is transported using a set of multiple transmission flows based on a multipath transport protocol. The communication network supports a set of multiple communication paths. A controller is configured to determine a set of mappings between the multiple transmission flows of the multipath data flow and the multiple communication paths based on cross-layer state information, compute a set of path mapping rules for a network element based on the mappings between the multiple transmission flows of the multipath data flow and the multiple communication paths, and provide the path mapping rules to the network element. The network element is configured to apply the path mapping rules for mapping packets of the multipath data flow between the multiple transmission flows of the multipath data flow and the multiple communication paths.

Cross-layer aware communication of a multipath data flow via a communication network

Cross-layer information associated with a software defined networking-based (SDN-based) communication network is collected. One or more updates are sent to one or more network elements in the SDN-based communication network to control one or more local decisions made at the one or more network elements. The one or more updates are based on at least a portion of the collected cross-layer information. Preferably, the collecting and sending steps are performed by a controller implementing an SDN management plane associated with the SDN-based communication network.

Dynamic local decision control in software defined networking-based environment

In a method for dynamic buffer adjustment at a line card of router, a current buffer occupancy at the line card is compared with at least a first buffer occupancy threshold, the first buffer occupancy threshold being calculated based on a buffer occupancy threshold parameter and a capacity of at least a first buffer memory at the line card; and an active buffer capacity is adjusted by at least one of activating and deactivating buffer memory blocks at the line card based on the comparing step, the activating including switching on the buffer memory blocks, and the deactivating including causing the buffer memory blocks to enter a sleep state.

Methods and apparatuses for adapting buffer capacity at routers

To address the security requirements for cyber-physical systems, embodiments of the present invention include a resilient end-to-end message protection framework, termed Resilient End-to End Message Protection or REMP, exploiting the notion of the long-term key that is given on per node basis. This long term key is assigned during the node authentication phase and is subsequently used to derive encryption keys from a random number per-message sent. Compared with conventional schemes, REMP improves privacy, message authentication, and key exposure, and without compromising scalability and end-to-end security. The tradeoff is a slight increase in computation time for message decryption and message authentication.

Method and apparatus for resilient end-to-end message protection for large-scale cyber-physical system communications

The performance of randomized load balanced or selective, randomized load balanced networks is enhanced by using ingress traffic engineering in addition to randomized traffic splitting. By first using the capacity of all links leading to the final destination of traffic, the remaining capacity is freed up for best effort traffic. Traffic splitting rules that enhance the performance of randomized load balanced networks in terms of packet missequencing and other quality of service criteria are also described.

Methods and devices for providing ingress routing in selective randomized load balancing

A new approach for a transport protocol for sensor data collection, such as a smart grid is described. In one embodiment of the invention, each server avoids keeping security and communication state per client through the notion of a secure 'state-token'. The state token is issued with each server message and is subsequently attached to corresponding client messages delivered to the server. An implementation is provided in which the server encrypts and authenticates the associated session state, and then gives the resulting encryption for the client to temporarily store and return to the server with a next message. In this way, a server does not keep session state after sending the encryption back to a client and can quickly restore session state when the next message from the client arrives.

Method and apparatus for a scalable and secure transport protocol for sensor data collection

Improved techniques are disclosed for detecting instability events in data communications systems that support inter-administrative domain (inter-domain) routing. For example, a technique for detecting an instability event in a communications system supporting inter-administrative domain routing includes the following steps. At an inter-domain router, one or more features are extracted from one or more messages obtained from at least another router in the communications system. The one or more extracted features include a path length feature, a path edit distance feature, or a combination thereof. Then, the inter-domain router detects whether an instability event has occurred in the communications system based on the one or more extracted features such that an action can be effectuated. By way of example, the one or more messages may include one or more border gateway protocol update messages and the inter-domain router may be a border gateway protocol router.

Methods and apparatus for instability detection in inter-domain routing

A lightweight probabilistic mechanism used to estimate the number of active flows, which estimate is used to determine the probability of admitting a new flow into the network. In one embodiment, a method for controlling admission of new flows at a node in a network of nodes interconnected by links includes: (a) for each of a plurality of incoming packets arriving at the node, each incoming packet corresponding to an active flow traversing the node: (a1) randomly selecting a packet from an output buffer of the node; (a2) determining whether the incoming packet is from the same active flow as the randomly-selected packet; and (a3) updating an estimate of the number of active flows traversing the node based on the determination of step (a2); and (b) determining whether to admit or drop part or all of a new flow at the node based on the estimated number of active flows traversing the node.

Lightweight bandwidth-management scheme for elastic traffic

The need to monitor real time network services has prompted service providers to use new measurement technologies, such as service-specific probes. A service-specific probe is an active probe that closely mimics the service traffic so that it receives the same treatment from the network as the actual service traffic. Service-specific probes are end-to-end and their deployment depends on solutions that address questions such as minimizing probe traffic, while still obtaining maximum coverage of all the links in the network. A polynomial-time probe-path computation algorithm is provided as well as a 2-approximate solution for merging probe paths when the number of probes exceeds a required bound k. The algorithms are evaluated using ISP topologies generated via Rocketfuel. For most topologies, it is possible to cover more than about 98% of the edges using just about 5% of the nodes as terminals.

End-to-end service quality using source-routed probes

A network configuration that supports latency-equalization (LEQ) routing by effectively 'storing' packets on communication links, rather than at end points. A suitable network configuration is found by (i) identifying a candidate pool of routers through which the participating client terminals and application servers can exchange packets intended for LEQ routing and (ii) analyzing the delay inventory corresponding to the network paths connecting the client terminals and application servers, through those routers. Based on the analysis, M routers from the candidate pool are selected to serve as hub nodes. Each participating client terminal is assigned m of these M hub nodes and, thereafter, directs and receives its packets intended for LEQ routing through one of these m hub nodes.

Latency equalization for interactive network applications

A method and apparatus for optimizing a distributed polling system in a network comprising a plurality of nodes. The method includes identifying bandwidth constraints on polling traffic for each of the plurality of nodes. Selecting, from a plurality of unpolled nodes within the plurality of nodes, at least one poller node according to a maximum number of unpolled nodes assignable to each of the at least one poller node without violating bandwidth constraints, and respectively assigning the unpolled nodes as pollee nodes to the at least one poller node. The apparatus includes a central manager and a plurality of pollee nodes coupled to at least one poller node via at least one routing path. At least one aggregating node is coupled to the at least one poller nodes, where the aggregating node is further coupled to the central manager.

Growing community of inventors

Westfield, NJ, United States of America

Marina Thottan