Arun Narayan Netravali - Westfield NJ, US Krishan Kumar Sabnani - Westfield NJ, US Ramesh Viswanathan - Manalapan NJ, US
Assignee:
Alcatel-Lucent USA Inc. - Murray Hill NJ
International Classification:
H04J 1/16 H04L 12/56
US Classification:
370238, 370254, 370252, 709238
Abstract:
Network convergence is greatly reduced because new routing paths are only selected when they are substantially better than pre-existing, best available paths.
Scalable Methods And Devices For Computing Routing Paths Within The Internet
Arun Narayan Netravali - Westfield NJ, US Krishan Kumar Sabnani - Westfield NJ, US Ramesh Viswanathan - Manalapan NJ, US
Assignee:
Alcatel-Lucent USA Inc. - Murray Hill NJ
International Classification:
H04L 12/28
US Classification:
370254, 370252
Abstract:
Routing-related scalability problems associated with the growth of the Internet are solved by assigning topologically encoded Internet addresses to each node within a network.
Methods And Apparatus For Passive Mid-Stream Monitoring Of Real-Time Properties
Lalita J. Jagadeesan - Naperville IL, US Ramesh Viswanathan - Manalapan NJ, US
Assignee:
Alcatel-Lucent USA Inc. - Murray Hill NJ
International Classification:
H04Q 7/20
US Classification:
455424, 379 1501, 379 14
Abstract:
Methods and apparatus are provided for passive mid-stream monitoring of real-time properties. A passive mid-stream monitoring process is disclosed that determines whether a system is faulty. The passive mid-stream monitoring process obtains a real-time correctness property and a passively monitored mid-stream observation of the system. A timed correctness property, A, is constructed from the passively monitored mid-stream observation. An intersection of the real-time correctness property and the timed correctness property is then determined to determine if the system is faulty. A passively testable determination process is also disclosed that determines whether a real-time correctness property for a system is passively testable. A determination is made as to whether (i) a set of all timed traces that are correct according to the real-time correctness property is timed prefix and timed suffix closed; and (ii) a system would satisfy the real-time correctness property if all timed-trace behaviors of the system would be included in the set.
Methods And Devices For Computing Paths To Assure The Inter-Domain Transport Of Qos Sensitive Information
Richard Wayne Buskens - Robbinsville NJ, US Sandra Ramos Thuel - Middletown NJ, US Ramesh Viswanathan - Manalapan NJ, US
Assignee:
Alcatel-Lucent USA Inc. - Murray Hill NJ
International Classification:
H04J 1/16
US Classification:
370248, 370389, 370351
Abstract:
Information can be transported over domains operated by different service providers at required Quality-of-Service (QoS) levels without disclosing inter- and/or intra-domain information to ensure that the topology of a given service provider's domain (e. g. , network) is not disclosed.
Method For Fusing Images Acquired From A Plurality Of Different Image Acquiring Modalities
Chenyang Xu - Allentown NJ, US Daniel J. Paulish - Yardley PA, US Ramesh Viswanathan - Princeton NJ, US
Assignee:
Siemens Aktiengesellschaft - München
International Classification:
G06K 9/00 A61B 8/00
US Classification:
382128, 600147
Abstract:
A method for fusing a plurality of images. The method includes: acquiring the plurality of images from a plurality of different modalities, each one of the images having a different reference space; and fusing the plurality of images into a common reference space, such common reference space being different from the reference space of each one of the plurality of acquired images. Thus, with such method, a unified process is provided for handling fusion across multiple clinical interventional and/or surgery (i. e. , intra-operative) procedures.
System And Method For Optimizing Batch Resource Allocation
Fangzhe Chang - Edison NJ, US Jennifer Ren - Basking Ridge NJ, US Ramesh Viswanathan - Manalapan NJ, US
Assignee:
Alcatel Lucent - Paris
International Classification:
G06F 9/46
US Classification:
718101
Abstract:
A system for configuring resources in an environment for use by at least one process. In one embodiment, the system includes: (1) a process sorter configured to rank the at least one process based on numbers of resources that steps in the at least one process can use, (2) an optimizer coupled to the process sorter and configured to employ an optimization heuristic to accumulate feasible allocations of resources to the steps based on the ranking of the at least one process, (3) a resource sorter coupled to the optimizer and configured to rank the resources in a non-decreasing order based on numbers of the steps in which the resources can be used, the optimizer further configured to remove one of the resources from consideration based on the ranking of the resources until infeasibility occurs and (4) an environment configuration interface configured to allow the environment to be configured in accordance with remaining ones of the resources.
Methods And Devices For Computing Paths To Assure The Inter-Domain Transport Of Qos Sensitive Information
Richard Wayne Buskens - Robbinsville NJ, US Sandra Ramos Thuel - Middletown NJ, US Ramesh Viswanathan - Manalapan NJ, US
Assignee:
Alcatel Lucent - Paris
International Classification:
H04L 12/28
US Classification:
370389, 3703951, 37039521
Abstract:
Information can be transported over domains operated by different service providers at required Quality-of-Service (QoS) levels without disclosing inter- and/or intra-domain information to ensure that the topology of a given service provider's domain (e. g. , network) is not disclosed.
Methods And Devices For Generating A Hierarchical Structure For The Internet
Arun Netravali - Westfield NJ, US Krishan Sabnani - Westfield NJ, US Ramesh Viswanathan - Manalapan NJ, US
International Classification:
H04L 12/56
US Classification:
370400000
Abstract:
A hierarchical structure for the Internet only requires designated nodal elements, each within its own associated cluster of nodal elements, to compute routing paths to other similarly designated nodal elements outside of its cluster. In this manner, the number of routing paths needed to be computed by a given element is greatly reduced.