Alcatel Lucent

Lucent Technologies Inc.

Alcatel-lucent USA Inc.

Other

Nokia of America Corporation

Dimitrios Stiliadis

Tirunell V Lakshman

T V Lakshman

Muralidharan Sampath Kodialam

Vijay Pochampalli Kumar

Adiseshu Hari

Andrea Francini

Sanjay D Kamat

Peter Johannes Winzer

Harish Viswanathan

Kajamalai Gopalaswamy Ramakrishnan

Sarit Mukherjee

Pramod V Koppol

Pramod V N Koppol

Thanos Stathopoulos

Nicholas G Duffield

Viswanath Poosala

Martin Zirngibl

Debasis Mitra

Mansoor Ali Khan Alicherry

Florin S Balus

Suresh Boddapati

Harsha S Nagesh

Hyunseok Chang

Sunder Raj Rathnavelu

Hong-Yi Tzeng

Antony Martin

Yuh-Jye Chang

Sunder Rathnavelu Raj

Mary S Chan

Bernhard Suter

Sunil S Khandekar

Abhijit Kumar Choudhury

Isaac Keslassy

Raman Arunachalam

Petri Aukia

Tirunellai Viswanathan Lakshman

Limin Wang

Pramod Koppol

Pramod VN Koppol

Systems, methods, architectures and/or apparatus for providing a distributed Virtual Routing and Switching (dVRS) solution at a data center (DC) by logically representing the networking resources of the data center as a plurality virtual nodes, each virtual node comprising an IP infrastructure based on a physical network node and a plurality of virtual switches, each virtual switch including a VRS instance linked to one or more VRS instances at other virtual switches via a VLAN to provide thereby a virtual service, wherein the physical network node performs control plane processing and provides to each virtual switch the specific routing information associated with the local services of that virtual switch. Thus, from a data plane perspective the virtual switches route and/or switch traffic directly to tunnels pointing to remote VRS instances without involving the Controller in the forwarding of the packets.

System and method providing distributed virtual routing and switching (DVRS)

Provided is a method and devices for asynchronous virtual machine replication. The method includes determining a class corresponding to a data packet associated with the virtual machine and one of buffering the packet and transmitting the packet based on the determined class.

Asynchronous virtual machine replication

Provided is a method and devices for overload control in a cloud computing environment. The method includes receiving a first message from a network element associated with the cloud computing environment. The first message includes information associated with a target virtual machine and a list of sessions from the one or more sessions to move from the serving virtual machine to the target virtual machine. Associating one or more client addresses with an address associated with the target virtual machine based on the list of sessions. And, treating the target virtual machine as the serving virtual machine if processing sessions associated with the list of sessions.

Overload control in a cloud computing environment

The invention includes a method and apparatus for notification and delivery of messages to mobile users using a secure client associated with a user device. The secure client includes a power module, a communication module, a storage module, and an alert module. The power module powers the client device independent of a power state of the user device. The communication module receives a wake-up message and responsively triggers the secure client to switch from an inactive state to an active state without changing the power state of the user device, initiates a secure connection with a secure gateway in response to the wake-up message, and requests and receives a user message from a messaging application using the secure connection. The storage module stores the received message independent of the power state of the user device. The alert module activates an alert to indicate that the message is available.

Method and apparatus for notification and delivery of messages to mobile PC users

A system and method of rate adaptation is disclosed for energy efficiency. The system and method of rate adaptation for energy efficiency provides for parsing a heterogeneous network into rate-adaptation domains that are fully isolated with respect to the control of their operating states. The system and method is particularly useful for creating the conditions for the incremental introduction of rate-adaptive devices in existing networks; combining the best properties of sleep-state exploitation and rate scaling techniques by defining a class of state-setting policies for rate adaptation schemes that enforce tight deterministic bounds on the extra delay that the schemes may cause to network traffic at every node where they are deployed.

Energy efficiency with rate adaptation

A method of remotely treating malicious mobile terminals connected to a mobile communications network. In one embodiment, when a malicious mobile terminal is detected by the intrusion-detection services of the network, the network changes the subscriber profile associated with the mobile terminal to operate the latter in a quarantine mode. The packet-switched subsystem of the network then links the quarantined mobile terminal to a remediation manager. The remediation manager remotely treats the mobile terminal, e.g., to repair or reinstall any corrupted software, terminate any active malicious processes, delete or quarantine any malware, and restore the operating system, configuration, and/or memory of the mobile terminal to a clean operational state. After the treatment, the network reverts the subscriber profile back to the initial state and removes the mobile terminal from the quarantine.

Treatment of malicious devices in a mobile-communications network

A method and system of coordination independent rate adaptation is disclosed. The method and system of coordination independent rate adaptation provides for deploying a rate adaptation subdomain into a packet network having no rate adaptation coordination among the network nodes. The method and system is particularly useful for incremental introduction of rate-adaptive devices in existing networks; combining the best properties of sleep-state exploitation and rate scaling techniques by defining a class of state-setting policies for rate adaptation schemes that enforce tight deterministic bounds on the extra delay that the schemes may cause to network traffic at every node where they are deployed.

Coordination independent rate adaptation deployment methods and systems

The invention includes a method and apparatus for providing secure remote access to enterprise networks. An apparatus includes a network interface module adapted for maintaining a secure network connection with a network device independent of a power state of a host computer associated with the apparatus a storage module for storing information associated with the secure connection, and a processor coupled to the network interface and the memory where the processor is adapted for automatically initiating the secure connection without user interaction.

Method and apparatus for providing secure remote access to enterprise networks

A communications switch or router employs a replication server to perform batch processing of multicast connections. The replication server performs three distinct forms of processing using staging queues: packet arrival processing, packet replication processing, and per-interface transmission processing. Packet arrival processing queues arriving packets in session queues, adds new multicast sessions to a replication set, and assigns a counter equivalent to the fan-out of the multicast session. Packet replication processing assigns a descriptor to packets of each session in the replication set, and copies the descriptor to each per-interface queue. Per-interface transmission processing examines each descriptor in the per-interface queue, copies the corresponding packets for transmission by the interface, adjusts the counter as each packet is copied, and clears the packet in the switch based on the adjusted counter.

Multicast scheduling and replication in switches

A network of nodes interconnected by links, such as a wavelength division multiplexing (WDM) ring network, is modeled by a delayed graph in which propagation delay between nodes is accounted for. Given the delayed graph, a traffic matrix for an admissible traffic pattern is scheduled over a frame period. Scheduling of the traffic matrix formulates a set of scheduling constraints based on the delays and decomposes the traffic matrix into a set of transmission matrices. Each of the set of transmission matrices is scheduled over the frame period.

Scheduling with delayed graphs for communication networks

A scalable, high-speed router for routing packets of information through an interconnected network comprises an interface for receiving a packet containing header and data information; a device for extracting routing information from the header of an arrived packet and generating a corresponding header packet for the arrived packet; a memory device for storing the data information of the arrived packet at predetermined memory locations; a device for processing the corresponding header packet to determine a route for the arrived packet and assigning packet forwarding information to the header packet; and, a device for retrieving the data information from the predetermined memory locations and forwarding both the data and header packet containing the packet forwarding information to the interface for routing the packet to a further destination in accordance with the packet forwarding information. The processing device includes devices performing filtering, route-table lookup and flow identification functions and which devices are organized in a pipelined fashion for successive, high-speed operations on the header packet. The router ensures that the arrived packet is forwarded in accordance with any quality of service requirements and flow specifications.

Scalable high speed router apparatus

A load-balanced network architecture is disclosed in which a traffic flow at a given network node is split into a plurality of parts, and the parts are distributed to respective ones of the plurality of nodes that are designated as participating in a load balancing process for the traffic flow. Each of at least a subset of the participating nodes receiving one of the parts routes at least a portion of its received part to one or more destination nodes.

Load balancing method and apparatus for ethernet over SONET and other types of networks

A switch schedules guaranteed-bandwidth, low-jitter-traffic characterized by a guaranteed rate table (GRT) method. A rate matrix generated from collected provisioning information is decomposed into schedule tables by a low jitter (LJ) decomposition method. The LJ decomposition method imposes a set of constraints for the schedule tables: schedule tables are partial permutation matrices, weighted sum of the partial permutation matrices is greater than or equal to the weighted sum of the rate matrix, and each entry in the rate matrix belongs to one element of the LJ decomposition schedule matrices. An integer LJ decomposition programming problem is employed to generate the schedule tables that are scheduled for each time slot of the period of the switch. Schedule tables are selected in turn based upon selecting eligible tables having the earliest finishing time. If necessary, the rate matrix is updated prior to decomposition for a subsequent period.

Scheduling of guaranteed-bandwidth low-jitter traffic in input-buffered switches

A packet network employs routers that determine network routing based on quality of service (QoS) provisioning parameters and network topology information. QoS provisioning parameters are provided to each router from a network management database, and the network topology information is determined from a link state database of the router. The link state database may include network topology information collected by the router in accordance with the open shortest path protocol (OSPF). A network link, router, or other node failure initiates a new path-selection process. First, a temporary set of provisioning entries may be determined with a shortest path first (SPF) routing method. Then, the network packet flows may be classified into packet flows, real-time and non-real-time, and then as packet flows that require reserved bandwidth or that may be multiplexed. A multicommodity flow (MCF) routing method is then employed to determine an optimized set of candidate provisioning entries for the packet flows that may be multiplexed. The MCF routing method determines new routing for the packet flows based on QoS provisioning commitments as parameters. The MCF routing method determines the new routing based on an optimization criterion, such as maximized revenue. Once the new routing is determined, routing of network traffic is enabled by converting the provisioning entries into filter rules, which are then loaded into the packet classifier of the router.

Adaptive routing system and method for QOS packet networks

Apparatus for routing packets in a communication network comprises a plurality of per-connection queues, each queue established for receiving packets from a respective source and temporarily storing received packets before routing to a particular destination; a weighted fair-queuing scheduler for servicing packets from each of the plurality of per-connection queues at guaranteed pre-allocated rates; a sensing device for sensing a presence or absence of packets in queues, the absence of packets in queues indicating availability of excess bandwidth; and, a state dependent scheduler for redistributing excess bandwidth upon sensing of queues absent packets, the state dependent scheduler servicing those queues in accordance with a state variable corresponding to a performance property of the queues, wherein delay and isolation properties for routing packets of respective queues in weighted fair-queuing is preserved.

Fair queuing system with adaptive bandwidth redistribution

Growing community of inventors

Middletown, NJ, United States of America

Dimitrios Stiliadis