Aiming at some problems existing in the current quality of service (QoS) mechanism of large-scale networks (i.e. poor scalability, coarse granularity for provided service levels, poor fairness between different service levels, and improving delay performance at the expense of sacrificing some resource utilization), the paper puts forward the idea and thoery of particle access. In the proposed particle access mechanism, the network first granulates the information flow (that is, the information flow is subdivided into information particles, each of which is given its corresponding attributes), and allocates access resources to the information particle group which is composed of all the information particles to be transmitted, so as to ensure that the occupied bandwidth resources is minimized on the premise of meeting the delay requirements of each information particle. Moreover, in the paper, the concepts of both information particle and information particle group are defined; Basic properties of the minimum reachable access bandwidth of an information particle group are analyzed; The influences of time attribute and attribute of bearing capacity of an information particle group on the minimum reachable access bandwidth are analyzed; Finally, an effective method for the calculation of the minimum reachable access bandwidth of an information particle group is given, and a particle access algorithm based on dynamically adjusting the minimum reachable access bandwidth is proposed. The research of the paper pave a new way for further improving QoS mechanisms of large-scale networks, and lay the corresponding theoretical foundation.
翻译:针对当前大规模网络的服务质量(QoS)机制存在的一些问题(即扩展性差、提供的服务级别粒度较粗、不同服务级别间公平性差、在牺牲一定资源利用率的情况下提高延迟性能),本文提出了粒子接入的思想和理论。在所提出的粒子接入机制中,网络首先对信息流进行粒度分割(即将信息流分成信息粒子,每个粒子赋予其对应属性),并为将要传输的所有信息粒子组成的信息粒子组分配接入资源,以确保在满足每个信息粒子的延迟要求的前提下尽量减少所占用的带宽资源。此外,本文中定义了信息粒子和信息粒子组的概念;分析了信息粒子组的可达最低接入带宽的基本性质;分析了时间属性和承载能力属性对信息粒子组可达最低接入带宽的影响;最后,给出了一种计算信息粒子组可达最低接入带宽的有效方法,并提出了一种基于动态调节可达最低接入带宽的粒子接入算法。本研究为进一步改进大规模网络的QoS机制铺平了一条新路,并奠定了相应的理论基础。