arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv cs/0308041cs.DS
收藏

因特网上离散提前带宽预定的静态数据结构

Static Data Structure for Discrete Advance Bandwidth Reservations on the Internet

Andrej Brodnik, Andreas Nilsson

摘要:

在本文中,我们提出了一个离散数据结构的保留有限的资源。预留被定义为一个元组,该元组由应该预留资源的时间间隔$I_R$和预留的资源量$B_R$(正式名称为$R=\{I_R,B_R\}$)组成。数据结构类似于段树。数据结构的最大跨越间隔是固定的,并且是预先定义的。叶的间隔的粒度和大小也被预先定义。数据结构只构建一次。节点和叶子都不会被插入、删除或移动。因此,操作的运行时间不取决于先前进行的保留的数量。运行时间也不取决于预订间隔的大小。令$n$为数据结构中叶的数目。在最坏的情况下,在任何操作$O(\log n)$中被触摸(即被遍历)的节点的数量,因此任何操作的运行时间也是$O(\log n)$。

英文摘要:

In this paper we present a discrete data structure for reservations of limited resources. A reservation is defined as a tuple consisting of the time interval of when the resource should be reserved, $I_R$, and the amount of the resource that is reserved, $B_R$, formally $R=\{I_R,B_R\}$. The data structure is similar to a segment tree. The maximum spanning interval of the data structure is fixed and defined in advance. The granularity and thereby the size of the intervals of the leaves is also defined in advance. The data structure is built only once. Neither nodes nor leaves are ever inserted, deleted or moved. Hence, the running time of the operations does not depend on the number of reservations previously made. The running time does not depend on the size of the interval of the reservation either. Let $n$ be the number of leaves in the data structure. In the worst case, the number of touched (i.e. traversed) nodes is in any operation $O(\log n)$, hence the running time of any operation is also $O(\log n)$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑