Advance reservations for predictive service in the Internet

被引:0
|
作者
Mikael Degermark
Torsten Köhler
Stephen Pink
Olov Schelén
机构
[1] Department of Computer Science,
[2] Luleå University,undefined
[3] S-971 87 Luleå,undefined
[4] Sweden; {micke,undefined
[5] olov}@sm.luth.se,undefined
[6] Swedish Institute of Computer Science,undefined
[7] PO Box 1263,undefined
[8] S-164 28 Kista,undefined
[9] Sweden; {steve,undefined
[10] tk}@sics.se,undefined
来源
Multimedia Systems | 1997年 / 5卷
关键词
Control Algorithm; Attractive Feature; Admission Control; Network Load; Utilization Level;
D O I
暂无
中图分类号
学科分类号
摘要
We extend a measurement-based admission control algorithm suggested for predictive service to provide advance reservations for guaranteed and predictive service, while retaining the attractive features of predictive service. The admission decision for advance reservations is based on information about flows that overlap in time. For flows that have not yet started, the requested values are used, and for those that have already started measurements are used. This allows us to estimate the network load accurately for the near future. To provide advance reservations we ask users to include durations in their requests. We present simulation results to show that predictive service with advance reservations provides utilization levels significantly higher than those for guaranteed service, and comparable to those for predicted service without advance reservations. Those utilization levels are reached without any preemption of other admitted flows. Finally, we discuss how to setup advance reservations over multiple hops in the Internet using resource reservation setup protocols.
引用
收藏
页码:177 / 186
页数:9
相关论文
共 50 条
  • [11] Online algorithms for advance resource reservations
    Castillo, C.
    Rouskas, G. N.
    Harfoush, K.
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2011, 71 (07) : 963 - 973
  • [12] Admission Control in Networks with Advance Reservations
    Liane Lewin-Eytan
    Joseph (Seffi) Naor
    Ariel Orda
    [J]. Algorithmica , 2004, 40 : 293 - 304
  • [13] Rerouting strategies for networks with advance reservations
    Burchard, LO
    Linnert, B
    Schneider, J
    [J]. FIRST INTERNATIONAL CONFERENCE ON E-SCIENCE AND GRID COMPUTING, PROCEEDINGS, 2005, : 446 - 453
  • [14] Admission control in networks with advance reservations
    Lewin-Eytan, L
    Naor, JS
    Orda, A
    [J]. ALGORITHMICA, 2004, 40 (04) : 293 - 304
  • [15] Temporal Routing Metrics for Networks with Advance Reservations
    Barz, Christoph
    Pilz, Markus
    Wichmann, Andre
    [J]. CCGRID 2008: EIGHTH IEEE INTERNATIONAL SYMPOSIUM ON CLUSTER COMPUTING AND THE GRID, VOLS 1 AND 2, PROCEEDINGS, 2008, : 710 - 715
  • [16] An effective flow aggregation algorithm for advance reservations
    Lee, KH
    Chen, YT
    [J]. IEICE TRANSACTIONS ON COMMUNICATIONS, 2001, E84B (06) : 1532 - 1540
  • [17] Routing and admission control in networks with advance reservations
    Lewin-Eytan, L
    Naor, J
    Orda, A
    [J]. APPROXIMATION ALGORITHMS FOR COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2002, 2462 : 215 - 228
  • [18] Networks with advance reservations: Applications, architecture, and performance
    Burchard L.-O.
    [J]. Journal of Network and Systems Management, 2005, 13 (4) : 429 - 449
  • [19] Intelligent Taxi Dispatch System for Advance Reservations
    Wang, Hao
    Cheu, Ruey Long
    Lee, Der-Horng
    [J]. JOURNAL OF PUBLIC TRANSPORTATION, 2014, 17 (03) : 115 - 128
  • [20] Admission control with advance reservations in simple networks
    Rawitz, Dror
    [J]. JOURNAL OF DISCRETE ALGORITHMS, 2007, 5 (03) : 491 - 500