689
eng
reportzib
0
2002-05-07
2002-05-07
--
Online Call Admission in Optical Networks with Larger Wavelength Demands
In the problem of \emph{Online Call Admission in Optical Networks}, briefly called \textsc{oca}, we are given a graph $G=(V,E)$ together with a set of wavelengths~$W$ and a finite sequence $\sigma=r_1,r_2,\dots$ of calls which arrive in an online fashion. Each call~$r_j$ 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~$\lambda \in 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 \textsc{oca} is to maximize the overall profit. Competitive algorithms for \textsc{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 general case of larger demands.
02-22
690
urn:nbn:de:0297-zib-6890
Appeared in: Graph-Theoretic Concepts in Computer Science. 28 Intern. Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, revised papers. L. Kucera (ed.) Springer 2002. LNCS 2573. Pp. 333-344
Sven Krumke
Diana Poensgen
ZIB-Report
02-22
eng
uncontrolled
Call Admission
eng
uncontrolled
Routing and Wavelength Allocation
eng
uncontrolled
Optical Networks
eng
uncontrolled
Competitive Analysis
eng
uncontrolled
Colorability
Informatik, Informationswissenschaft, allgemeine Werke
Analysis of algorithms and problem complexity [See also 68W40]
Communication networks [See also 68M10, 94A05]
Combinatorial optimization
ZIB Allgemein
DynRoute
ONLINE-PLANNING
https://opus4.kobv.de/opus4-zib/files/689/ZR-02-22.ps
https://opus4.kobv.de/opus4-zib/files/689/ZR-02-22.pdf