Journal Article
@Article
Artikel in Fachzeitschrift


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:








Author, Editor(s)

Author(s):

Epstein, Leah
Kesselman, Alexander

dblp
dblp

Not MPG Author(s):

Epstein, Leah

BibTeX cite key*:

Epstein2006

Title

Title*:

On the remote server problem or more about TCP acknowledgments

Journal

Journal Title*:

Theoretical Computer Science

Journal's URL:


Download URL
for the article:

http://dx.doi.org/10.1016/j.tcs.2006.09.003

Language:

English

Publisher

Publisher's
Name:

Elsevier

Publisher's URL:


Publisher's
Address:

Amsterdam, The Netherlands

ISSN:

0304-3975

Vol, No, pp, Date

Volume*:

369

Number:

1-3

Publishing Date:

December 2006

Pages*:

285

Number of
VG Pages:


Page Start:

285-299

Page End:


Sequence Number:


DOI:

10.1016/j.tcs.2006.09.003

Note, Abstract, ©

Note:


(LaTeX) Abstract:

We study an on-line problem that is motivated by service calls management in a remote support center. When a customer calls the remote support center of a software company, a technician opens a service request and assigns it a severity rating. This request is then transferred to the appropriate support engineer (SE) who establishes a connection to the customer's site and uses remote diagnostic capabilities to resolve the problem. We assume that the SE can service at most one customer at time and a request service time is negligible. There is a constant setup cost of creating a new connection to a customer's site and a specific cost per request for delaying its service that depends on the severity of the request. The problem is to decide which customers to serve first so as to minimize the incurred cost. This problem with just two customers is a natural generalization of the TCP acknowledgment problem. For the on-line version of the Remote Server Problem (RSP), we present algorithms for the general case and for a special casef of two customers that achieve competitive ratios of exactly 4 and 3, respectively. We also show that no deterministic on-line algorithm can have competitive ratio better than 3. Then we study generalized versions of our model, these are the case of an asymmetric setup cost function and the case of multiple SEs. For the off-line version of the RSP, we derive an optimal algorithm with a polynomial running time for a constant number of customers.

URL for the Abstract:


Categories,
Keywords:


HyperLinks / References / URLs:


Copyright Message:


Personal Comments:


Download
Access Level:

Internal

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Algorithms and Complexity Group

Audience:

Expert

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort


BibTeX Entry:

@ARTICLE{Epstein2006,
AUTHOR = {Epstein, Leah and Kesselman, Alexander},
TITLE = {On the remote server problem or more about TCP acknowledgments},
JOURNAL = {Theoretical Computer Science},
PUBLISHER = {Elsevier},
YEAR = {2006},
NUMBER = {1-3},
VOLUME = {369},
PAGES = {285},
ADDRESS = {Amsterdam, The Netherlands},
MONTH = {December},
ISBN = {0304-3975},
DOI = {10.1016/j.tcs.2006.09.003},
}


Entry last modified by Anja Becker, 02/28/2008
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Anja Becker
Created
02/08/2008 02:46:36 PM
Revision
0.



Editor
Anja Becker



Edit Date
08.02.2008 14:50:09