Nec Laboratories America, Inc.

Nec Corporation

Telcordia Technologies, Inc.

Rauf Izmailov

Samrat Ganguly

Akshay Vashist

Aniruddha Bohra

Ting Wang

Hui Joyce Zhang

Ravindranath Kokku

Kyriakos Manousakis

Stephen B Weinstein

Ritu Chadha

Ruixue Fan

Vladimir Vapnik

Cho-Yu Jason Chiang

Subir K Biswas

Constantin Serban

Jian Liang

A communication node operable to estimate faults in a mobile ad hoc network and method of performing the same. In one embodiment, the communication node includes a processor and memory including computer program code configured to, with the processor, cause the communication node to monitor a set of observable parameters at the communication node, produce a fault estimate at the communication node from the set of observable parameters, and provide the fault estimate to a global fault detector at another communication node.

Communication node operable to estimate faults in an ad hoc network and method of performing the same

A system and method for support vector machine plus (SVM+) computations include selecting a set of indexes for a target function to create a quadratic function depending on a number of variables, and reducing the number of variables to two in the quadratic function using linear constraints. An extreme point is computed for the quadratic function in closed form. A two-dimensional set is defined where the indexes determine whether a data point is in the two-dimensional set or not. A determination is made of whether the extreme point belongs to the two-dimensional set. If the extreme point belongs to the two-dimensional set, the extreme point defines a maximum and defines a new set of parameters for a next iteration. Otherwise, the quadratic function is restricted on at least one boundary of the two-dimensional set to create a one-dimensional quadratic function. The steps are repeated until the maximum is determined.

Generalized sequential minimal optimization for SVM+ computations

Traditional networked file systems like NFS do not extend to wide-area due to network latency and dynamics introduced in the WAN environment. To address that problem, a wide-area networked file system is based on a traditional networked file system (NFS/CIFS) and extends to the WAN environment by introducing a file redirector infrastructure residing between the central file server and clients. The file redirector infrastructure is invisible to both the central server and clients so that the change to NFS is minimal. That minimizes the interruption to the existing file service when deploying WireFS on top of NFS. The system includes an architecture for an enterprise-wide read/write wide area network file system, protocols and data structures for metadata and data management in this system, algorithms for history based prefetching for access latency minimization in metadata operations, and a distributed randomized algorithm for the implementation of global LRU cache replacement scheme.

Wide area networked file system

A multipath routing architecture for large data transfers is disclosed. The architecture employs an overlay network that provides diverse paths for packets from communicating end hosts to utilize as much capacity as available across multiple paths while ensuring network-wide fair allocation of resources across competing data transfers. A set of transit nodes are interposed between the end-hosts and for each end-to-end connection, a transit node can logically operate as an entry gateway, a relay or exit gateway. Packets from the sender enter the entry node and go to the exit node either directly or through one of a plurality of relay nodes. The exit node delivers the packets to the receiver. A multipath congestion control protocol is executed on the entry node to harness network capacity for large data transfers.

Multipath routing architecture for large data transfers

A system and method for path provisioning in a network calculates an optimal path using a greedy algorithm with backtracking to execute service level agreements (SLAs). More specifically, a sequential path shifting (SPS) algorithm compares a cost of a suboptimal path for a present quadruplet with the cost of switching a path for a previous quadruplet configured for alteration. If the present path is already an optimal path, then no further operations are performed. However, if the cost of a suboptimal path is greater than the switching cost, the previous path is altered so that an optimal path may be configured for the present quadruplet. Otherwise, the present quadruplet maintains its existing path. The capacity of the network is iteratively adjusted to compensate for path selection. The present system may be applied to a differentiated services network or an optical network.

Path provisioning for service level agreements in differentiated service networks

Hierarchical hybrid optical networking is based on balancing cost and performance of optical networks by providing transparent (optical) switching of subsets of wavelengths in addition to opaque (electrical) switching of individual light paths. Effective use of wavelength-subset switching requires aggregating and deaggregating wavelength subsets in a simple, cost-effective manner. Non-uniform wavebands are introduced and analyzed their performance advantage as compared with uniform wavebands. Also proposed are several architectural options for a hierarchical hybrid optical cross-connect system that combines non-uniform wavebands and improved utilization of OEO ports.

Non-uniform optical waveband aggregator and deaggregator and hierarchical hybrid optical cross-connect system

Growing community of inventors

Plainsboro, NJ, United States of America

Rauf Izmailov