Patent
Method for shortest path routing
Reads0
Chats0
TLDR
In this paper, a method and apparatus for assigning link "distance" metrics that result in near optimal routing for a network formed of nodes (routers) and links, where each link has a capacity associated with it, and where source-destination flows are given.Abstract:
The invention discloses a method and apparatus for assigning link "distance" metrics that result in near optimal routing for a network formed of nodes (routers) and links, where each link has a capacity associated with it, and where source-destination flows are given. The routing optimality is measured with respect to some objective function (e.g., average network delay).read more
Citations
More filters
Patent
Enhancement of network operation and performance
TL;DR: In this article, a set of logical networks is established on top of a physical network and a predefined objective function, closely related to the operation and performance of the physical network, is optimized with respect to at least one set of decision variables.
Patent
Magnetic field sensor to detect a magnitude of a magnetic field in any direction
TL;DR: In this article, a magnetic field sensor includes an electronic circuit coupled to receive the first and second magnetic field signals and provides one or more signals in response to the magnitude of the vector sum determined.
Patent
Method for maximizing throughput for multiple links using directional elements
TL;DR: In this article, a maximum throughput metric is provided for separate links through the network between a source node and a collection of end-point nodes to be optimized which is based on measurement of link quality with respect to neighboring nodes and information about link quality and other factors related to propagation delay or "latency" as reported to it by other nodes regarding their neighboring links.
Patent
Magnetic field sensor for detecting a magnetic field in any direction above thresholds
TL;DR: In this article, the first, second, and third magnetic field sensing elements are operable to generate first second, third and fourth magnetic field signals in response to a magnetic field, the first second and third signals are compared with thresholds to determine if the magnetic field is greater than thresholds.
Patent
Method and device for dynamic synchronous transfer mode in a dual ring topology
TL;DR: In this paper, a dynamic synchronous transfer mode network (DSMTN) consisting of two ring topologies (12 and 14) having opposite fiber direction is considered, where the time slots are dynamically allocated to the nodes (60-70) and the first ring topology is adapted to transmit frames only in a first fiber direction (D1).
References
More filters
Journal ArticleDOI
The New Routing Algorithm for the ARPANET
TL;DR: The new ARPANET routing algorithm is an improvement over the old procedure in that it uses fewer network resources, operates on more realistic estimates of network conditions, reacts faster to important network changes, and does not suffer from long-term loops or oscillations.
Journal ArticleDOI
A Minimum Delay Routing Algorithm Using Distributed Computation
TL;DR: A new global convergence theorem for noncontinuous iteration algorithms is developed that converges, with successive updates of the routing tables, to the minimum average delay over all routing assignments.
Journal ArticleDOI
The revised ARPANET routing metric
TL;DR: The ARPANET routing metric was revised in July 1987, resulting in substantial performance improvements, especially in terms of user delay and effective network capacity as discussed by the authors. But these revisions only affect...
Journal ArticleDOI
Optimal Routing in a Packet-Switched Computer Network
D.G. Cantor,M. Gerla +1 more
TL;DR: The problem of finding optimal routes in a packet-switched computer network can be formulated as a nonlinear multicommodity flow problem.
Journal ArticleDOI
A Review of the Development and Performance of the ARPANET Routing Algorithm
TL;DR: This paper presents a comprehensive review of the ARPANET routing algorithm, from its original implementation to the authors' plans for future modifications, and describes in detail subsequent modifications and the actual implementation currently in use.