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机制开辟了新途径，并奠定了相应的理论基础。