Online computation and competitive analysis
Online computation and competitive analysis
Journal of the ACM (JACM)
OSPF: Anatomy of an Internet Routing Protocol
OSPF: Anatomy of an Internet Routing Protocol
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Developments from a June 1996 seminar on Online algorithms: the state of the art
Developments from a June 1996 seminar on Online algorithms: the state of the art
Increasing Internet Capacity Using Local Search
Computational Optimization and Applications
Selfish Routing in Capacitated Networks
Mathematics of Operations Research
Throughput-competitive on-line routing
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Optimizing OSPF/IS-IS weights in a changing world
IEEE Journal on Selected Areas in Communications
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Nonadaptive selfish routing with online demands
CAAN'07 Proceedings of the 4th conference on Combinatorial and algorithmic aspects of networking
| Hi-index | 0.00 |
In this paper we study online multicommodity minimum cost routing problems in networks, where commodities have to be routed sequentially. The flow of each commodity can be split on several paths. Arcs are equipped with load dependent price functions defining routing costs. We discuss a greedy online algorithm that routes each commodity by minimizing a convex cost function that only depends on the demands previously routed. We present a competitive analysis of this algorithm showing that for affine linear price functions this algorithm is $\tfrac{4K}{2+K}$-competitive, where K is the number of commodities. For the parallel arc case, this algorithm is optimal. Without restrictions on the price functions and network, no algorithm is competitive. Finally, we investigate a variant in which the demands have to be routed unsplittably.