Amortized efficiency of list update and paging rules
Communications of the ACM
Competitive algorithms for on-line problems
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The maximum concurrent flow problem
Journal of the ACM (JACM)
An optimal algorithm for on-line bipartite matching
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Scheduling parallel machines on-line
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
New algorithms for an ancient scheduling problem
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Call preemption in communication networks
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
The competitiveness of on-line assignments
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
An optimal on-line algorithm for metrical task system
Journal of the ACM (JACM)
Online load balancing and network flow
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Fast approximation algorithms for multicommodity flow problems
Selected papers of the 23rd annual ACM symposium on Theory of computing
Wireless Networks
Fast approximation algorithms for fractional packing and covering problems
Mathematics of Operations Research
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Routing and admission control in general topology networks with Poisson arrivals
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Competitive routing of virtual circuits with unknown duration
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Competitive non-preemptive call control
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Online Load Balancing of Temporary Tasks
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
Load balancing in the L/sub p/ norm
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Disjoint paths in densely embedded graphs
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
On-line routing for permanent virtual circuits
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
An Improved Lower Bound for Load Balancing of Tasks with Unknown Duration
An Improved Lower Bound for Load Balancing of Tasks with Unknown Duration
Routing and Admission Control in General Topology Networks
Routing and Admission Control in General Topology Networks
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
ACM Computing Surveys (CSUR)
An Opportunity Cost Approach for Job Assignment in a Scalable Computing Cluster
IEEE Transactions on Parallel and Distributed Systems
Lower bounds & competitive algorithms for online scheduling of unit-size tasks to related machines
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
(Incremental) priority algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On-line load balancing of temporary tasks revisited
Theoretical Computer Science
IEEE Transactions on Parallel and Distributed Systems
On-line restricted assignment of temporary tasks with unknown durations
Information Processing Letters
On-Line Load Balancing of Temporary Tasks Revisited
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Evaluating Resource Bundle Derivatives for Multi-agent Negotiation of Resource Allocation
E-Commerce Agents, Marketplace Solutions, Security Issues, and Supply and Demand
On-Line Load Banancing in a Hierarchical Server Topology
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
On-Line Maximizing the Number of Items Packed in Variable-Sized Bins
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
A polynomial-time tree decomposition to minimize congestion
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Optimal oblivious routing in polynomial time
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
The Home Model and Competitive Algorithms for Load Balancing in a Computing Cluster
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Scheduling data transfers in a network and the set scheduling problem
Journal of Algorithms
The all-or-nothing multicommodity flow problem
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Journal of Scheduling - Special issue: On-line algorithm part I
Scheduling with conflicts on bipartite and interval graphs
Journal of Scheduling - Special issue: On-line scheduling
Stochastic Networks: Admission and Routing Using Penalty Functions
Queueing Systems: Theory and Applications
Optimal oblivious routing in polynomial time
Journal of Computer and System Sciences - Special issue: STOC 2003
Online client-server load balancing without global information
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Oblivious routing on node-capacitated and directed graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
High-bandwidth routing in dynamic peer-to-peer streaming
Proceedings of the ACM workshop on Advances in peer-to-peer multimedia streaming
Approximate majorization and fair online load balancing
ACM Transactions on Algorithms (TALG)
ACM SIGACT News
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Online Multicasting for Network Capacity Maximization in Energy-Constrained Ad Hoc Networks
IEEE Transactions on Mobile Computing
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks
IEEE Transactions on Mobile Computing
AdWords and generalized online matching
Journal of the ACM (JACM)
Routing selfish unsplittable traffic
ACM Transactions on Algorithms (TALG)
(Almost) optimal coordination mechanisms for unrelated machine scheduling
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Better bounds for online load balancing on unrelated machines
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Preemptive scheduling on a small number of hierarchical machines
Information and Computation
Optimal hierarchical decompositions for congestion minimization in networks
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
On the computational complexity and effectiveness of N-hub shortest-path routing
IEEE/ACM Transactions on Networking (TON)
Deterministic monotone algorithms for scheduling on related machines
Theoretical Computer Science
A Preemptive Algorithm for Maximizing Disjoint Paths on Trees
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Online unit clustering: Variations on a theme
Theoretical Computer Science
Efficient coordination mechanisms for unrelated machine scheduling
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Journal of Scheduling
Reliable routings in networks with generalized link failure events
IEEE/ACM Transactions on Networking (TON)
Coordination mechanisms for selfish scheduling
Theoretical Computer Science
Online scheduling with general machine cost functions
Discrete Applied Mathematics
Bi-objective Optimization: An Online Algorithm for Job Assignment
GPC '09 Proceedings of the 4th International Conference on Advances in Grid and Pervasive Computing
Online Primal-Dual Algorithms for Covering and Packing
Mathematics of Operations Research
Multicast Routing and Design of Sparse Connectors
Algorithmics of Large and Complex Networks
The Design of Competitive Online Algorithms via a Primal: Dual Approach
Foundations and Trends® in Theoretical Computer Science
On designing truthful mechanisms for online scheduling
Theoretical Computer Science
Optimal and online preemptive scheduling on uniformly related machines
Journal of Scheduling
Non-clairvoyant Scheduling Games
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Price of anarchy in parallel processing
Information Processing Letters
Fast approximation of minimum multicast congestion: implementation versus theory
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Online primal-dual algorithms for maximizing ad-auctions revenue
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Randomized algorithms for online bounded bidding
Information Processing Letters
Assigning tasks for efficiency in Hadoop: extended abstract
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Power in unity: forming teams in large-scale community systems
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Max-min online allocations with a reordering buffer
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
How to allocate goods in an online market?
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Online and semi-online hierarchical scheduling for load balancing on uniform machines
Theoretical Computer Science
Inverted index compression via online document routing
Proceedings of the 20th international conference on World wide web
Inner product spaces for MinSum coordination mechanisms
Proceedings of the forty-third annual ACM symposium on Theory of computing
Minimum congestion mapping in a cloud
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Robust algorithms for preemptive scheduling
ESA'11 Proceedings of the 19th European conference on Algorithms
Smoothed performance guarantees for local search
ESA'11 Proceedings of the 19th European conference on Algorithms
Online scheduling with rejection and withdrawal
Theoretical Computer Science
Variable sized online interval coloring with bandwidth
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Coordination mechanisms for selfish scheduling
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Reliable routings in networks with generalized link failure events
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
Deterministic monotone algorithms for scheduling on related machines
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Implementation of approximation algorithms for the multicast congestion problem
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
On designing truthful mechanisms for online scheduling
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Online team formation in social networks
Proceedings of the 21st international conference on World Wide Web
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
A lower bound for on-line scheduling on uniformly related machines
Operations Research Letters
On-Line scheduling of parallel jobs in heterogeneous multiple clusters
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
A complex network-based approach for job scheduling in grid environments
HPCC'07 Proceedings of the Third international conference on High Performance Computing and Communications
Multicast routing for energy minimization using speed scaling
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Journal of Scheduling
Inefficiency of Nash equilibria with parallel processing policy
Information Processing Letters
Approximate strong equilibria in job scheduling games with two uniformly related machines
Discrete Applied Mathematics
Competitive and deterministic embeddings of virtual networks
Theoretical Computer Science
Algorithms for hub label optimization
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Lower bounds for online makespan minimization on a small number of related machines
Journal of Scheduling
Hi-index | 0.01 |
In this paper we study the problem of on-line allocation of routes to virtual circuits (both point-to-point and multicast) where the goal is to route all requests while minimizing the required bandwidth. We concentrate on the case of Permanent virtual circuits (i.e., once a circuit is established it exists forever), and describe an algorithm that achieves on O (log n) competitive ratio with respect to maximum congestin, where nis the number of nodes in the network. Informally, our results show that instead of knowing all of the future requests, it is sufficient to increase the bandwidth of the communication links by an O (log n) factor. We also show that this result is tight, that is, for any on-line algorithm there exists a scenario in which ***(log n) increase in bandwidth is necessary in directed networks.We view virtual circuit routing as a generalization of an on-line load balancing problem, defined as follows: jobs arrive on line and each job must be assigned to one of the machines immediately upon arrival. Assigning a job to a machine increases the machine's load by an amount that depends both on the job and on the machine. The goal is to minimize the maximum load. For the related machines case, we describe the first algorithm that achieves constant competitive ratio. for the unrelated case (with nmachines), we describe a new method that yields O(logn)-competitive algorithm. This stands in contrast to the natural greed approach, whose competitive ratio is exactly n. show that this result is tight, that is, for any on-line algorithm there exists a scenario in which ***(log n) increase in bandwidth is necessary in directed networks.