跳至内容
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.
版本/格式:   電子書 : 英語所有版本和格式的總覽
提要:
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系統控制編碼: 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的評論

標籤

成爲第一個
確認申請

你可能已經申請過這份資料。若還是想申請,請選確認。

連結資料


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/476712276#Place/ft_belvoir> ; # Ft. Belvoir
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/vau> ;
   schema:about <http://experiment.worldcat.org/entity/work/data/476712276#Topic/linear_arrays> ; # Linear arrays
   schema:about <http://experiment.worldcat.org/entity/work/data/476712276#Topic/information_transfer> ; # Information transfer
   schema:about <http://experiment.worldcat.org/entity/work/data/476712276#Topic/computer_communications> ; # Computer communications
   schema:about <http://experiment.worldcat.org/entity/work/data/476712276#Topic/algorithms> ; # Algorithms
   schema:about <http://experiment.worldcat.org/entity/work/data/476712276#Topic/computer_systems> ; # Computer Systems
   schema:about <http://experiment.worldcat.org/entity/work/data/476712276#Topic/data_management> ; # Data management
   schema:about <http://experiment.worldcat.org/entity/work/data/476712276#Topic/distributed_data_processing> ; # Distributed data processing
   schema:about <http://experiment.worldcat.org/entity/work/data/476712276#Topic/requirements> ; # Requirements
   schema:about <http://experiment.worldcat.org/entity/work/data/476712276#Topic/computer_networks> ; # Computer networks
   schema:about <http://experiment.worldcat.org/entity/work/data/476712276#Topic/scheduling> ; # Scheduling
   schema:about <http://experiment.worldcat.org/entity/work/data/476712276#Topic/computer_programming_and_software> ; # Computer Programming and Software
   schema:about <http://experiment.worldcat.org/entity/work/data/476712276#Topic/reaction_time> ; # Reaction time
   schema:about <http://experiment.worldcat.org/entity/work/data/476712276#Topic/optimization> ; # Optimization
   schema:about <http://experiment.worldcat.org/entity/work/data/476712276#Topic/online_systems> ; # Online systems
   schema:about <http://experiment.worldcat.org/entity/work/data/476712276#Topic/bandwidth> ; # Bandwidth
   schema:about <http://experiment.worldcat.org/entity/work/data/476712276#Topic/competition> ; # Competition
   schema:about <http://experiment.worldcat.org/entity/work/data/476712276#Topic/input_output_processing> ; # Input output processing
   schema:bookFormat schema:EBook ;
   schema:contributor <http://experiment.worldcat.org/entity/work/data/476712276#Person/tomkins_andrew> ; # Andrew Tomkins
   schema:contributor <http://viaf.org/viaf/54241399> ; # Daniel D. Sleator
   schema:contributor <http://experiment.worldcat.org/entity/work/data/476712276#Person/maggs_bruce> ; # Bruce Maggs
   schema:contributor <http://experiment.worldcat.org/entity/work/data/476712276#Organization/carnegie_mellon_univ_pittsburgh_pa_dept_of_computer_science> ; # CARNEGIE-MELLON UNIV PITTSBURGH PA Dept. of COMPUTER SCIENCE.
   schema:contributor <http://experiment.worldcat.org/entity/work/data/476712276#Person/sgall_jiri> ; # Jiri Sgall
   schema:contributor <http://experiment.worldcat.org/entity/work/data/476712276#Person/feldmann_anja> ; # 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/476712276> ;
   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/476712276#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/476712276#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/476712276#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/476712276#Person/feldmann_anja> # Anja Feldmann
    a schema:Person ;
   schema:familyName "Feldmann" ;
   schema:givenName "Anja" ;
   schema:name "Anja Feldmann" ;
    .

<http://experiment.worldcat.org/entity/work/data/476712276#Person/maggs_bruce> # Bruce Maggs
    a schema:Person ;
   schema:familyName "Maggs" ;
   schema:givenName "Bruce" ;
   schema:name "Bruce Maggs" ;
    .

<http://experiment.worldcat.org/entity/work/data/476712276#Person/sgall_jiri> # Jiri Sgall
    a schema:Person ;
   schema:familyName "Sgall" ;
   schema:givenName "Jiri" ;
   schema:name "Jiri Sgall" ;
    .

<http://experiment.worldcat.org/entity/work/data/476712276#Person/tomkins_andrew> # Andrew Tomkins
    a schema:Person ;
   schema:familyName "Tomkins" ;
   schema:givenName "Andrew" ;
   schema:name "Andrew Tomkins" ;
    .

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

<http://experiment.worldcat.org/entity/work/data/476712276#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/476712276#Topic/distributed_data_processing> # Distributed data processing
    a schema:Intangible ;
   schema:name "Distributed data processing"@en ;
    .

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

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

<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 

没有帳號嗎?你可很容易的 建立免費的帳號.