Efficient routing in all-optical networks
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Lower bounds for on-line graph problems with application to on-line circuit and optical routing
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Online computation and competitive analysis
Online computation and competitive analysis
Competitive non-preemptive call control
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
On-line randomized call control revisited
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On-line Competive Algorithms for Call Admission in Optical Networks
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Disjoint paths in densely embedded graphs
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Deterministic online optical call admission revisited
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
| Hi-index | 0.00 |
In the problem of Online Call Admission in Optical Networks, briefly called Oca, we are given a graph G = (V, E) together with a set of wavelengths W and a finite sequence 驴 = r1, r2, . . . of calls which arrive in an online fashion. Each call rj specifies a pair of nodes to be connected and an integral demand indicating the number of required lightpaths. A lightpath is a path in G together with a wavelength 驴 驴 W. Upon arrival of a call, an online algorithm must decide immediately and irrevocably whether to accept or to reject the call without any knowledge of calls which appear later in the sequence. If the call is accepted, the algorithm must provide the requested number of lightpaths to connect the specified nodes. The essential restriction is the wavelength conflict constraint: each wavelength is available only once per edge, which implies that two lightpaths sharing an edge must have different wavelengths. Each accepted call contributes a benefit equal to its demand to the overall profit. The objective in Oca is to maximize the overall profit.Competitive algorithms for Oca have been known for the special case where every call requests just a single lightpath. In this paper we present the first competitive online algorithms for the more general case in which the demand of a call may be as large as |W|.