首页> 外文期刊>IEEE Transactions on Knowledge and Data Engineering >Analysis of data structures for admission control of advance reservation requests
【24h】

Analysis of data structures for admission control of advance reservation requests

机译:预先预订请求准入控制的数据结构分析

获取原文
获取原文并翻译 | 示例

摘要

Advance reservations are a useful method to allocate resources of various kinds in many different environments. Among others, a major advantage of this kind of reservation is the improved admission probability for requests that are made sufficiently early. In order to implement reliable admission control for these requests, it is important to store information in data structures about future allocations and to provide fast access to the available information. In this paper, two data structures are examined: a tree specially designed to support advance reservations is compared to arrays. Both structures are examined analytically and by measurements in a realistic network management system capable of advance reservations. It turns out that arrays are far better suited to support the required operations, in particular when large time intervals need to be scanned.
机译:预先预留是在许多不同环境中分配各种资源的有用方法。其中,这种保留的主要优点是可以提高对足够早提出的请求的接纳概率。为了对这些请求实施可靠的准入控制,将信息存储在有关将来分配的数据结构中并提供对可用信息的快速访问非常重要。本文研究了两种数据结构:将专门设计用于支持预先保留的树与数组进行比较。这两种结构均经过分析并通过实际的网络管理系统中的测量进行检查,该系统可以提前预订。事实证明,阵列更适合支持所需的操作,尤其是在需要扫描较大时间间隔的情况下。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号