edoc-Server der Humboldt-Universität zu Berlin

SPEPS Preprint

Author(s): Shane Dye, University of Canterbury, New Zealand
Leen Stougie, Eindhoven University of Technology and CWI Amsterdam, The Netherlands
Asgeir Tomasgard, SINTEF Industrial Management, Norway
Title: The stochastic single node service provision problem
Date of Acceptance: 13.02.2002
Submission Date: 05.12.2001
Series Title: Stochastic Programming E-Print Series
(SPEPS)
Editors: Julie L. Higle; Werner Römisch; Surrajeet Sen
Complete Preprint: pdf (urn:nbn:de:kobv:11-10058318)
ps (urn:nbn:de:kobv:11-10058320)
Keywords (eng): telecommunications, distributed processing, service provision, stochastic (integer) parogramming, strong NP-hardness, approximation, worst-case analysis
Metadata export: To export the complete metadata set as Endote or Bibtex format please click to the appropriate link. Endnote   Bibtex  
print on demand: If you click on this icon you can order a print copy of this publication. Bestellung als gedruckte und gebundene Version bei epubli.de, Ausführung der Bestellung erst nach Bestätigung auf den epubli.de-Seiten
Diese Seite taggen: These icons lead to social bookmarking systems where you can create and manage personal bookmarks and discover bookmakrs of other users.
  • connotea
  • del.icio.us
  • Furl
  • RawSugar

Abstract (eng):
The service provision problem described in this paper comes from an application of distributed processing in telecommunications networks. The objective is to maximize a service provider's profit from offering computational based services to customers. The service provider has limited capacity and must choose from a set of software applications those he would like to offer. This can be done dynamically taking into consideration that demand for the different services is uncertain. The problem is examined in the framework of stochastic integer programming. Approximations and complexity are examined for the case when demand is described by a discrete probability distribution. For the deterministic counterpart a fully polynomial approximation scheme is known. We show that introduction of stochasticity makes the problem stongly NP-hard, implying that the existence of such a scheme for the stochastic problem is highly unlikely. For the general case a heuristic with a worst-case performance ratio that increases in the number of scenarios is presented. Restricting the class of problem instances in a way that many reasonable practical problem instances will satisfy, allows for the derivation of a heuristic with a constant worst-case performance ratio. These worst-case results are the first results for stochastic programming problems that the authors are aware of in a direction that is classical in the field of combinatorial optimization.
Access Statistics: These data concerning access statistics for individual documents have been compiled using the webserver log files aggregated by AWSTATS. They refer to a monthly access count to the full text documents as well as to the entry page.
 
As for format versions of a document which consist of multiple files (such as HTML) the highest monthly access number to one of the files (chapters) is shown respectivly.
 
To see the detailled access numbers please move the mouse pointer over the single bars of the digaram.
Startseite: 1 Zugriffe Startseite: 1 Zugriffe PDF: 2 Zugriffe Startseite: 1 Zugriffe Startseite: 1 Zugriffe PDF: 2 Zugriffe PDF: 2 Zugriffe Startseite: 2 Zugriffe PDF: 2 Zugriffe PDF: 2 Zugriffe PDF: 1 Zugriffe PDF: 3 Zugriffe Startseite: 2 Zugriffe PDF: 9 Zugriffe PDF: 10 Zugriffe PDF: 5 Zugriffe PDF: 4 Zugriffe PDF: 8 Zugriffe PDF: 5 Zugriffe Startseite: 1 Zugriffe PDF: 6 Zugriffe Startseite: 1 Zugriffe PDF: 5 Zugriffe Startseite: 2 Zugriffe PDF: 7 Zugriffe Startseite: 1 Zugriffe PDF: 2 Zugriffe Startseite: 2 Zugriffe PDF: 6 Zugriffe PDF: 3 Zugriffe PDF: 6 Zugriffe PDF: 7 Zugriffe Startseite: 16 Zugriffe PDF: 6 Zugriffe Startseite: 3 Zugriffe PDF: 2 Zugriffe Startseite: 19 Zugriffe PDF: 7 Zugriffe Startseite: 27 Zugriffe PDF: 3 Zugriffe Startseite: 20 Zugriffe PDF: 7 Zugriffe Startseite: 21 Zugriffe PDF: 10 Zugriffe
Jul
11
Sep
11
Oct
11
Nov
11
Dec
11
Feb
12
Apr
12
May
12
Jun
12
Jul
12
Sep
12
Oct
12
Nov
12
Dec
12
Jan
13
Feb
13
Mar
13
Apr
13
May
13
Jun
13
Jul
13
Aug
13
Sep
13
Oct
13
Nov
13
Dec
13
Jan
14
Feb
14
Mar
14
Apr
14
May
14
Jun
14
Jul
14
Aug
14
Monat Jul
11
Sep
11
Oct
11
Nov
11
Dec
11
Feb
12
Jun
12
Jul
12
Oct
12
Nov
12
Jan
13
Feb
13
Mar
13
Apr
13
May
13
Jun
13
Jul
13
Aug
13
Sep
13
Oct
13
Nov
13
Dec
13
Jan
14
Feb
14
Mar
14
Apr
14
May
14
Jun
14
Jul
14
Aug
14
Startseite 1 1 1 1   2         2           1 1 2 1 2       16 3 19 27 20 21
PDF   2   2 2   2 2 1 3 9 10 5 4 8 5 6 5 7 2 6 3 6 7 6 2 7 3 7 10

Gesamtzahl der Zugriffe seit Jul 2011:

  • Startseite – 121 (3.56 pro Monat)
  • PDF – 132 (4 pro Monat)
 
 
Generated at 02.09.2014, 06:47:03