pular para conteúdo
Competitive Analysis of Call Admission Algorithms that Allow Delay. Ver prévia deste item
FecharVer prévia deste item
Checando...

Competitive Analysis of Call Admission Algorithms that Allow Delay.

Autor: Anja FeldmannBruce MaggsJiri SgallDaniel D SleatorAndrew TomkinsTodos os autores
Editora: Ft. Belvoir Defense Technical Information Center 13 JAN 1995.
Edição/Formato   e-book : Inglês
Base de Dados:WorldCat
Resumo:
This paper presents an analysis of several simple on-line algorithms for processing requests for connections in distributed networks. These algorithms are called call admission algorithms. Each request comes with a source, a destination, and a bandwidth requirement. The call admission algorithm decides whether to accept a request, and if so, when to schedule it and which path the connection should use through the  Ler mais...
Classificação:

(ainda não classificado) 0 com críticas - Seja o primeiro.

Assuntos
Mais como este

 

Encontrar uma cópia on-line

Links para este item

Encontrar uma cópia na biblioteca

&AllPage.SpinnerRetrieving; Encontrando bibliotecas que possuem este item...

Detalhes

Tipo de Material: Recurso Internet
Tipo de Documento: Recurso Internet
Todos os Autores / Contribuintes: Anja Feldmann; Bruce Maggs; Jiri Sgall; Daniel D Sleator; Andrew Tomkins; CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE.
Número OCLC: 227828357
Descrição: 35 p.

Resumo:

This paper presents an analysis of several simple on-line algorithms for processing requests for connections in distributed networks. These algorithms are called call admission algorithms. Each request comes with a source, a destination, and a bandwidth requirement. The call admission algorithm decides whether to accept a request, and if so, when to schedule it and which path the connection should use through the network. The duration of the request is unknown to the algorithm when the request is made. We analyze the performance of the algorithms on simple networks such as linear arrays, trees, and networks with small separators. We use three measures to quantify their performance: makespan, maximum response time, and data-admission ratio. Our results include a proof that greedy algorithms are log-competitive with respect to makespan on n-node trees for arbitrary durations and bandwidth, a proof that on an n-node tree no algorithm can be better than Omega (log log n/log log log n)- competitive with respect to makespan, and a proof that no algorithm can be better than Omega(log n)-competitive with respect to call-admission and data-admission ratio on a linear array, if each request can be delayed for at most some constant times its (known) duration. (AN).

Críticas

Críticas contribuídas por usuários
Recuperando críticas GoodReas...
Recuperando comentários DOGObooks

Etiquetas

Seja o primeiro.
Confirmar esta solicitação

Você já pode ter solicitado este item. Por favor, selecione Ok se gostaria de proceder com esta solicitação de qualquer forma.

Dados Ligados


<http://www.worldcat.org/oclc/227828357>
library:oclcnum"227828357"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/227828357>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:bookFormatschema:EBook
schema:contributor
schema:contributor
schema:contributor
schema:contributor
schema:contributor
schema:contributor
schema:datePublished"1995"
schema:datePublished"13 JAN 1995"
schema:description"This paper presents an analysis of several simple on-line algorithms for processing requests for connections in distributed networks. These algorithms are called call admission algorithms. Each request comes with a source, a destination, and a bandwidth requirement. The call admission algorithm decides whether to accept a request, and if so, when to schedule it and which path the connection should use through the network. The duration of the request is unknown to the algorithm when the request is made. We analyze the performance of the algorithms on simple networks such as linear arrays, trees, and networks with small separators. We use three measures to quantify their performance: makespan, maximum response time, and data-admission ratio. Our results include a proof that greedy algorithms are log-competitive with respect to makespan on n-node trees for arbitrary durations and bandwidth, a proof that on an n-node tree no algorithm can be better than Omega (log log n/log log log n)- competitive with respect to makespan, and a proof that no algorithm can be better than Omega(log n)-competitive with respect to call-admission and data-admission ratio on a linear array, if each request can be delayed for at most some constant times its (known) duration. (AN)."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/1807662828>
schema:inLanguage"en"
schema:name"Competitive Analysis of Call Admission Algorithms that Allow Delay."@en
schema:numberOfPages"35"
schema:publisher
schema:url
schema:url<http://handle.dtic.mil/100.2/ADA292242>

Content-negotiable representations

Close Window

Por favor, conecte-se ao WorldCat 

Não tem uma conta? Você pode facilmente criar uma conta gratuita.