ข้ามไปที่เนือ้หา
Competitive Analysis of Call Admission Algorithms that Allow Delay. แสดงตัวอย่างรายการนี้
ปิดแสดงตัวอย่างรายการนี้
Checking...

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 กับความคิดเห็น - เป็นคนแรก

หัวเรื่อง
เพิ่มเติมเช่นนี้

 

ค้นหาสำเนาออนไลน์

เชื่อมโยงไปยังรายการนี้

ค้นหาสำเนาในห้องสมุด

กำลังดึงข้อมูล… ค้นหาห้องสมุดที่มีรายการนี้

รายละเอียด

ขนิดวัสดุ: ทรัพยากรอินเตอร์เน็ต
ประเภทของเอกสาร: แหล่งข้อมูลอินเทอร์เน็ต
ผู้เขียนทั้งหมด : ผู้เขียนร่วม Anja Feldmann; Bruce Maggs; Jiri Sgall; Daniel D Sleator; Andrew Tomkins; CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE.
OCLC Number: 227828357
คำอธิบาย: 35 p.

บทคัดย่อ:

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…
Retrieving DOGObooks reviews...

แท็ก

เป็นคนแรก.
ยืนยันคำขอนี้

คุณอาจะร้องขอรายการนี้แล้. โปรดเลือก ตกลง ถ้าคุณต้องการดำเนินการคำขอนี้ต่อไป.

Linked Data


<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

ปิดหน้าต่าง

กรุณาลงชื่อเข้าสู่ระบบ WorldCat 

ยังไม่มีบัญชีผู้ใช้? คุณสามารถสร้างได้อย่างง่ายดาย สร้างบัญชีผู้ใช้ฟรี.