A new approach to solve the k-server problem based on network flows and flow cost reduction

This paper is concerned with two algorithms for solving the k-server problem: the optimal off-line algorithm (OPT) and the on-line work function algorithm (WFA). Both algorithms are usually implemented by network flow techniques including the flow augmentation method. In the paper a new implementati...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Computers & operations research Ročník 40; číslo 4; s. 1004 - 1013
Hlavní autori: Rudec, Tomislav, Manger, Robert
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Kidlington Elsevier Ltd 01.04.2013
Elsevier
Pergamon Press Inc
Predmet:
Algorithms
Applied sciences
Augmentation
Cost reduction
Exact sciences and technology
Experiments
Flows in networks. Combinatorial problems
Implementation
k-server problem
Mathematical functions
Network flow problem
Network flows
Networks
On-line problems
On-line systems
Operational research and scientific management
Operational research. Management science
Operations research
Optimal off-line algorithm
Optimization
Optimization algorithms
Studies
Work function algorithm
Work functions
Work function algorithm
On-line problems
Cost reduction
k-server problem
Optimal off-line algorithm
Network flows
Experiments
Implementation
On line
Network flow
Optimal algorithm
Work function
Indirect method
Off line
Cost lowering
ISSN:0305-0548, 1873-765X, 0305-0548
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:This paper is concerned with two algorithms for solving the k-server problem: the optimal off-line algorithm (OPT) and the on-line work function algorithm (WFA). Both algorithms are usually implemented by network flow techniques including the flow augmentation method. In the paper a new implementation approach is proposed, which is again based on network flows, but uses simpler networks and the cost reduction method. The paper describes in detail the corresponding new implementations of OPT and WFA, respectively. All necessary correctness proofs are given. Also, experiments are presented, which confirm that the new approach assures faster execution of both algorithms.
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ObjectType-Article-1
ObjectType-Feature-2
ISSN:0305-0548
1873-765X
0305-0548
DOI:10.1016/j.cor.2012.11.006