Alcatel Lucent

Alcatel-lucent USA Inc.

Lucent Technologies Inc.

Bell Communications Research, Inc.

Nokia of America Corporation

Other

Nokia Solutions and Networks Oy

Provenance Asset Group LLC

Tirunell V Lakshman

Muralidharan Sampath Kodialam

Fang Hao

Haoyu Song

Sudipta Sengupta

Thomas Y Woo

Randeep Singh Bhatia

Ramachandran Ramjee

Thyagarajan Nandagopal

Dimitrios Stiliadis

Murali Kodialam

Furquan Ahmed Ansari

Harish Viswanathan

Krishan Kumar Sabnani

Sarit Mukherjee

Wing Cheong Lau

Teunis J Ott

Martin Havemann

Hui Joyce Zhang

Adiseshu Hari

Oded Hauser

Muralidharam S Kodialam

Peter Johannes Winzer

Nicholas G Duffield

Colin Leon Kahn

Martin Zirngibl

Rakesh H Chandwani

Krishna P Puttaswamy Naga

Hyunseok Chang

Marina Thottan

Ramesh Viswanathan

Arnold Leslie Neidhardt

Rene-Jean Essiambre

Arturo Cisneros

Pramod V N Koppol

Yuh-Jye Chang

Paul Claisse

Anindo Bagchi

Doohee Yun

Kasra Rastani

Ravi S Prasad

Nan Hua

Naeem Asghar

Colin Corcoran, Jr

Joseph Karwisch

Michael P Siesta

Stephen M Zlatos

Isaac Keslassy

Zizhong Cao

Koushik Kar

Myung Jin Lee

Sugam Agarwal

Kodialam Murali

Mohammed A Tabatabai-Yazdi

Martin Zimgibl

Limin Wang

Piotr W Mirowski

Various example embodiments for supporting scheduling of deterministic flows in time synchronized networks are presented. Various example embodiments for supporting scheduling of deterministic flows in a time synchronized network may be configured to support scheduling of deterministic flows in the time synchronized network based on assignment of transmission start times to data flows of communication devices such that the communication devices may transmit data of the data flows at the transmission start times in a manner tending to reduce or eliminate collisions in the time synchronized network.

Scheduling deterministic flows in time synchronized networks

The present disclosure generally discloses an Internet security mechanism configured to provide security for Internet resources of the Internet using an Internet blockchain. The Internet blockchain may be configured to provide security for Internet resources of the Internet by supporting various types of verification related to Internet resources of the Internet, which may include verification of Internet resource ownership, verification of Internet resource transactions, and so forth. The Internet blockchain may be configured to enable Internet participants (e.g., Internet registries, Domain Name Service (DNS) entities, Autonomous Systems (ASes), or the like) to verify Internet resource ownership of Internet resources (e.g., Internet Protocol (IP) addresses, AS numbers, IP prefixes, DNS domain names, or the like) by Internet participants, to verify Internet resource transactions (e.g., allocation of IP addresses, allocation of AS numbers, advertisements of IP prefixes, allocation of DNS domain names, or the like) attempted by Internet participants, and so forth.

Internet security

The present disclosure generally discloses a data plane configured for processing function scalability. The processing functions for which scalability is supported may include charging functions, monitoring functions, security functions, or the like.

Data plane for processing function scalability

This disclosure generally discloses an anchor mobility mechanism. The anchor mobility mechanism is configured to support migration of flows between mobility anchors within a wireless communication system. The anchor mobility mechanism may be configured to support migration of flows between mobility anchors within a wireless communication system in a highly seamless manner. The anchor mobility mechanism may be configured to support migration of a flow of a wireless device between mobility anchors within a wireless communication system using functions performed by a control element (CE) and one or more forwarding elements (FEs) within the data plane of the flow of the wireless device. The functions may include identifying a time at which to initiate migration of the flow, initiating migration of the flow based on identification of the time at which to initiate migration of the flow, or the like, as well as various combinations thereof.

Anchor mobility in wireless networks

A resource assignment capability is presented. A resource specification associated with a plurality of elements is received. The resource specification includes, for each of the elements, a resource request including an indication of a quantity of resources requested by the element and a resource offer including an indication of a quantity of resources offered by the element for use by one or more other elements. A resource assignment, including an indication of an association between the resources requests and the resource offers, is determined using a resource assignment process. The resource assignment process may be a greedy assignment process or a maximum flow resource assignment process. The maximum flow resource assignment process includes constructing a maximum flow resource graph based on the one or more resource specifications and applying a maximum flow process to the maximum flow resource graph to determine thereby the resource assignment.

Apparatus and method for matching offers and requests for sharing of resources

Various embodiments provide a method and apparatus for providing adaptive self-tuned routing within a network. In particular, one or more path selection values are adaptable to the changing network utilization and are configured to balance the influence of a first objective and a second objective on the path selection. Advantageously, balancing the influence of the first and second objectives on path selection provides improved efficiency and improved revenue generating capacity when compared to conventional routing methods.

Method and apparatus for self-tuned adaptive routing

A manner of providing redundancy protection for a data center network that is both reliable and low-cost. In a data center network where the data traffic between numerous access nodes and a network core layer via primary aggregation nodes, an optical network device such as and OLT (optical line terminal) is provided as a backup aggregation node for one or more of the primary aggregation nodes. When a communication path through a primary aggregation node fails, traffic is routed through the optical network device. In a preferred embodiment, a communication link is formed from a plurality of access nodes to a single port of the OLT or other optical network device via an optical splitter that combines upstream transmissions and distributes downstream transmissions. The upstream transmissions from the plurality of access nodes may occur according to an allocation schedule generated when the backup aggregation node is needed.

Apparatus and method for protection in a data center

We disclose a signal-routing method directed at improving the throughput of an optical network by taking into account the fiber nonlinearity in the process of solving a joint signal-routing and power-control problem for the optical network. Based on the obtained solution, a network controller may set the signal-routing configurations of the various network nodes and the optical gains of the various optical amplifiers to enable the optical network to carry the traffic in a manner that results in a higher throughput than that achievable with the use of conventional signal-routing and/or power-control methods.

Joint signal-routing and power-control for an optical network

Various embodiments provide a method and apparatus of providing a load balancing configuration that adapts to the overall load and scales the power consumption with the load to improve energy efficiency and scalability. The energy efficient distributed and elastic load balancing architecture includes a collection of multi-tiered servers organized as a tree structure. The handling of incoming service requests is distributed amongst a number of the servers. Each server in the virtual load distribution tree accepts handles incoming service requests based on its own load. Once a predetermined loading on the receiving server has been reached, the receiving server passes the incoming requests to one or more of its children servers.

Method and apparatus for energy efficient distributed and elastic load balancing

The invention includes a method for routing traffic from a first node towards a plurality of intermediate nodes. A method includes receiving traffic at a first node and routing respective portions of the received traffic toward respective intermediate nodes according to respective traffic weighting factors associated with the intermediate nodes. Upon receiving the respective portions of the traffic, the intermediate nodes may then route the traffic toward one or more destination nodes, or may route the traffic toward another plurality of intermediate nodes before the traffic is routed to a destination node. The intermediate node traffic weighting factors may be dependent on the first node and the destination node, or may be independent of the first node and the destination node.

Method for routing traffic using traffic weighting factors

A method and system for scheduling tasks is provided. A plurality of lower bound completion times is determined, using one or more computer processors and memory, for each of a plurality of jobs, each of the plurality of jobs including a respective subset plurality of tasks. A task schedule is determined for each of the plurality of processors based on the lower bound completion times.

Scheduling in MapReduce-like systems for fast completion time

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. There is a protocol failover mechanism for handling failovers initiated by FEs to transfer control from one CE to another CE.

SoftRouter protocol failovers

An optical routing scheme in which an optical network having a mesh topology is configured to route optical packets through an optical routing layout superimposable with the mesh topology, but having a star-like topology. Using this routing layout, the optical network can be configured to transport optical packets from respective ingress nodes, through the hub node located at the star center, to respective egress nodes in a manner that enables a data throughput that approaches the theoretical capacity. No special hardware is required for implementing the hub functionality, and any node of the optical network can be configured to serve as the hub node. The latter feature enables relatively straightforward optimization of the optical routing layout and transmission schedule, e.g., by changing the identity of the hub node and adjusting the transmission schedule at the ingress nodes to synchronize packet arrivals to the hub node.

High-throughput routing in an optical network having a mesh topology

Growing community of inventors

Morganville, NJ, United States of America

Tirunell V Lakshman