コンテンツへ移動
Competitive Analysis of Call Admission Algorithms that Allow Delay. 資料のプレビュー
閉じる資料のプレビュー
確認中…

Competitive Analysis of Call Admission Algorithms that Allow Delay.

著者: Anja FeldmannBruce MaggsJiri SgallDaniel D SleatorAndrew Tomkinsすべての著者
出版: Ft. Belvoir Defense Technical Information Center 13 JAN 1995.
エディション/フォーマット:   電子書籍 : English
データベース:WorldCat
概要:
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  続きを読む
評価:

(まだ評価がありません) 0 件のレビュー - 是非あなたから!

件名:
関連情報:

 

オンラインで入手

この資料へのリンク

オフラインで入手

&AllPage.SpinnerRetrieving; この資料の所蔵館を検索中…

詳細

資料の種類: インターネット資料
ドキュメントの種類: インターネットリソース
すべての著者/寄与者: Anja Feldmann; Bruce Maggs; Jiri Sgall; Daniel D Sleator; Andrew Tomkins; CARNEGIE-MELLON UNIV PITTSBURGH PA Dept. of COMPUTER SCIENCE.
OCLC No.: 227828357
物理形態: 35 pages

概要:

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).

レビュー

ユーザーレビュー
GoodReadsのレビューを取得中…
DOGObooksのレビューを取得中…

タグ

まずはあなたから!
リクエストの確認

あなたは既にこの資料をリクエストしている可能性があります。このリクエストを続行してよろしければ、OK を選択してください。

リンクデータ


Primary Entity

<http://www.worldcat.org/oclc/227828357> # Competitive Analysis of Call Admission Algorithms that Allow Delay.
    a schema:CreativeWork, schema:Book ;
    library:oclcnum "227828357" ;
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/1807662828#Place/ft_belvoir> ; # Ft. Belvoir
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/vau> ;
    schema:about <http://experiment.worldcat.org/entity/work/data/1807662828#Topic/input_output_processing> ; # Input output processing
    schema:about <http://experiment.worldcat.org/entity/work/data/1807662828#Topic/computer_communications> ; # Computer communications
    schema:about <http://experiment.worldcat.org/entity/work/data/1807662828#Topic/algorithms> ; # Algorithms
    schema:about <http://experiment.worldcat.org/entity/work/data/1807662828#Topic/bandwidth> ; # Bandwidth
    schema:about <http://experiment.worldcat.org/entity/work/data/1807662828#Topic/distributed_data_processing> ; # Distributed data processing
    schema:about <http://experiment.worldcat.org/entity/work/data/1807662828#Topic/competition> ; # Competition
    schema:about <http://experiment.worldcat.org/entity/work/data/1807662828#Topic/computer_systems> ; # Computer Systems
    schema:about <http://experiment.worldcat.org/entity/work/data/1807662828#Topic/computer_networks> ; # Computer networks
    schema:about <http://experiment.worldcat.org/entity/work/data/1807662828#Topic/requirements> ; # Requirements
    schema:about <http://experiment.worldcat.org/entity/work/data/1807662828#Topic/information_transfer> ; # Information transfer
    schema:about <http://experiment.worldcat.org/entity/work/data/1807662828#Topic/optimization> ; # Optimization
    schema:about <http://experiment.worldcat.org/entity/work/data/1807662828#Topic/data_management> ; # Data management
    schema:about <http://experiment.worldcat.org/entity/work/data/1807662828#Topic/linear_arrays> ; # Linear arrays
    schema:about <http://experiment.worldcat.org/entity/work/data/1807662828#Topic/reaction_time> ; # Reaction time
    schema:about <http://experiment.worldcat.org/entity/work/data/1807662828#Topic/computer_programming_and_software> ; # Computer Programming and Software
    schema:about <http://experiment.worldcat.org/entity/work/data/1807662828#Topic/online_systems> ; # Online systems
    schema:about <http://experiment.worldcat.org/entity/work/data/1807662828#Topic/scheduling> ; # Scheduling
    schema:bookFormat schema:EBook ;
    schema:contributor <http://viaf.org/viaf/54241399> ; # Daniel D. Sleator
    schema:contributor <http://viaf.org/viaf/18886472> ; # Bruce Maggs
    schema:contributor <http://viaf.org/viaf/117427528> ; # Jiri Sgall
    schema:contributor <http://experiment.worldcat.org/entity/work/data/1807662828#Organization/carnegie_mellon_univ_pittsburgh_pa_dept_of_computer_science> ; # CARNEGIE-MELLON UNIV PITTSBURGH PA Dept. of COMPUTER SCIENCE.
    schema:contributor <http://viaf.org/viaf/43259878> ; # Andrew Tomkins
    schema:contributor <http://viaf.org/viaf/31669454> ; # Anja Feldmann
    schema:datePublished "13 JAN 1995" ;
    schema:datePublished "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:productID "227828357" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/227828357#PublicationEvent/ft_belvoirdefense_technical_information_center13_jan_1995> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/1807662828#Agent/defense_technical_information_center> ; # Defense Technical Information Center
    schema:url <http://handle.dtic.mil/100.2/ADA292242> ;
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/227828357> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/1807662828#Agent/defense_technical_information_center> # Defense Technical Information Center
    a bgn:Agent ;
    schema:name "Defense Technical Information Center" ;
    .

<http://experiment.worldcat.org/entity/work/data/1807662828#Organization/carnegie_mellon_univ_pittsburgh_pa_dept_of_computer_science> # CARNEGIE-MELLON UNIV PITTSBURGH PA Dept. of COMPUTER SCIENCE.
    a schema:Organization ;
    schema:name "CARNEGIE-MELLON UNIV PITTSBURGH PA Dept. of COMPUTER SCIENCE." ;
    .

<http://experiment.worldcat.org/entity/work/data/1807662828#Topic/computer_communications> # Computer communications
    a schema:Intangible ;
    schema:name "Computer communications"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/1807662828#Topic/computer_networks> # Computer networks
    a schema:Intangible ;
    schema:name "Computer networks"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/1807662828#Topic/computer_programming_and_software> # Computer Programming and Software
    a schema:Intangible ;
    schema:name "Computer Programming and Software"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/1807662828#Topic/distributed_data_processing> # Distributed data processing
    a schema:Intangible ;
    schema:name "Distributed data processing"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/1807662828#Topic/information_transfer> # Information transfer
    a schema:Intangible ;
    schema:name "Information transfer"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/1807662828#Topic/input_output_processing> # Input output processing
    a schema:Intangible ;
    schema:name "Input output processing"@en ;
    .

<http://viaf.org/viaf/117427528> # Jiri Sgall
    a schema:Person ;
    schema:familyName "Sgall" ;
    schema:givenName "Jiri" ;
    schema:name "Jiri Sgall" ;
    .

<http://viaf.org/viaf/18886472> # Bruce Maggs
    a schema:Person ;
    schema:familyName "Maggs" ;
    schema:givenName "Bruce" ;
    schema:name "Bruce Maggs" ;
    .

<http://viaf.org/viaf/31669454> # Anja Feldmann
    a schema:Person ;
    schema:familyName "Feldmann" ;
    schema:givenName "Anja" ;
    schema:name "Anja Feldmann" ;
    .

<http://viaf.org/viaf/43259878> # Andrew Tomkins
    a schema:Person ;
    schema:familyName "Tomkins" ;
    schema:givenName "Andrew" ;
    schema:name "Andrew Tomkins" ;
    .

<http://viaf.org/viaf/54241399> # Daniel D. Sleator
    a schema:Person ;
    schema:familyName "Sleator" ;
    schema:givenName "Daniel D." ;
    schema:name "Daniel D. Sleator" ;
    .


Content-negotiable representations

ウインドウを閉じる

WorldCatにログインしてください 

アカウントをお持ちではないですか?簡単に 無料アカウントを作成することができます。.