On-line Network Routing
@inproceedings{Leonardi1996OnlineNR,
title={On-line Network Routing},
author={Stefano Leonardi},
booktitle={Online Algorithms},
year={1996},
url={https://api.semanticscholar.org/CorpusID:15339275}
}This chapter has concentrated on routing in electrical and optical networks, presented algorithms for load minimization and throughput maximization problems, and mentioned some of the most popular open problems in the area.
36 Citations
Independent Sets in Hypergraphs with Applications to Routing via Fixed Paths
- 1999
Computer Science, Mathematics
Borders for the best possible performance ratio of deterministic vs. randomized and non-preemptive vs. preemptive algorithms for routing problems via fixed paths over networks are provided.
Temporal Routing Metrics for Networks with Advance Reservations
- 2008
Computer Science, Engineering
This paper proposes an extension of the path selection process that is imposed by advance reservations and classifies and proposes specific temporal routing metrics and presents ways to integrate these metrics into routing algorithms.
Service Curve Based Routing Subject to Deterministic QoS Constraints
- 2003
Computer Science
A novel blend of generic service curves as abstraction of network transport services, of the associated network calculus under min–plus algebra and of existing heuristics for the restricted shortest path problem is proposed.
Minimizing Congestion in General Networks
- 2002
Computer Science, Engineering
This work introduces a framework for solving online problems that aim to minimize the congestion in general topology networks and achieves a competitive ratio of O(log/sup 3/ n) with respect to the congestion of the network links.
Minimizing congestion in general networks
- 2002
Computer Science, Engineering
This work introduces a framework for solving online problems that aim to minimize the congestion in general topology networks and achieves a competitive ratio of O(log/sup 3/ n) with respect to the congestion of the network links.
Online Algorithms: A Study of Graph-Theoretic Concepts
- 1999
Computer Science, Mathematics
In this paper we survey results on the design and analysis of online algorithms, focusing on problems where graphs and graphtheoretic concepts have proven particularly useful in the formulation or in…
Throughput Optimal On-Line Algorithms for Advanced Resource Reservation in Ultra High-Speed Networks
- 2007
Computer Science
This paper presents two new, on-line algorithms for advanced reservation, called BatchAll and BatchLim, that are guaranteed to achieve optimal throughput performance, based on multi-commodity flow arguments, shown to have polynomial-time complexity and provable bounds on the maximum delay for 1+epsilon bandwidth augmented networks.
Optimal oblivious routing in polynomial time
- 2003
Computer Science
This work gives a polynomial time construction that guarantees Racke's bounds, and more generally gives the true optimal ratio for any network.
Wavelength Management in WDM Rings to Maximize the Number of Connections
- 2009
Computer Science, Engineering
A general analysis method for a class of iterative algorithms for a more general coloring problem and presents an algorithm based on linear programming and randomized rounding with approximation ratio 1.49015, improving on the $\frac{e}{e-1}\approx1.58198$ bound obtained by a simple iterative algorithm.
Online lifetime-centric multicast routing for ad hoc networks with directional antennas
- 2005
Computer Science, Engineering
A highly competitive online heuristic algorithm is developed that takes network lifetime consideration directly into iterative calculations and it is shown that an algorithm designed under this methodology provides consistently better performance than the current state-of-the-art algorithm that takes remaining energy into Iterative calculations.
41 References
On-line Competive Algorithms for Call Admission in Optical Networks
- 1996
Computer Science, Engineering
This work gives randomized algorithms with logarithmic competitive ratios for specific topologies in two models of optical networks, and considers the case of full-duplex communication as well.
Packet Routing via Min-Cost Circuit Routing
- 1996
Computer Science
This paper introduces competitive algorithms for a new problem called min-cost load circuit routing, here, the goal is to create on-line virtual circuits in a graph, while trying to simultaneously minimize link bandwidth and (related) communication costs.
Throughput-competitive on-line routing
- 1993
Computer Science, Engineering
We develop a framework that allows us to address the issues of admission control and routing in high-speed networks under the restriction that once a call is admitted and routed, it has to proceed to…
On-line load balancing with applications to machine scheduling and virtual circuit routing
- 1993
Computer Science
An algorithm is described that achieves an O (log n) competitive ratio, where n is the number of nodes in the network, for the case where virtual circuits continue to exist forever and for the related machines case, the first algorithm that achieves constant competitive ratio is described.
Competitive multicast routing
- 1995
Computer Science
An online competitive routing strategy that has anO(logn logd) competitive factor wheren is the size of the network andd(≤n) is the maximum size of a multicast group is introduced.
Dynamic wavelength allocation in all-optical ring networks
- 1997
Computer Science, Engineering
It is proved that shortest path routing produces a routing which has at most twice the load of the optimal solution, and at least 0.5 L/ sub max/ log/sub 2/N+L/sub max/ wavelengths are required by any algorithm in the worst case.
Dynamic wavelength conversion in optical networks
- 1997
Computer Science, Engineering
Algorithms for allocation of wavelengths to connections (lightpaths) in WDM networks, that is, optical wavelength division multiplexed networks, are proposed and it is proved that the known algorithm which requires 2L– 1 wavelengths is optimal.
On-line admission control and circuit routing for high performance computing and communication
- 1994
Computer Science
The paper describes both upper and lower bounds on the competitive ratio of algorithms for admission control and virtual circuit routing in trees, arrays, and hypercubes (the networks most commonly used in conjunction with nigh performance computing and communication).
Lower bounds for on-line graph problems with application to on-line circuit and optical routing
- 1996
Computer Science
An Ω(nǫ) lower bound on the competitive ratio of randomized online algorithms for virtual circuit routing on general networks is obtained, in contrast to the known results for some specific networks.