Auction-Based Effective Bandwidth Allocation Mechanism

Several auctions have been proposed and applied to perform contract negotiation and resource allocation in reservation-based networks. The methods proposed by these works perceive resources as single items with multiple units and place importance on a limited efficiency inside each node. However, as a user evaluates resources not individually, but rather as a whole set of required resources, the economical efficiency of the overall network cannot be achieved by these methods. To solve this problem, we propose a bandwidth allocation system using GVA (Generalised Vickrey Auction). Network resources, which are composed of many links at various bandwidths, are regarded by the proposed method as multiple items with multiple units. We describe how to apply GVA protocol to bandwidth allocations among multiple users. We investigate algorithmic and accounting problems inside multiple nodes using an end-to-end approach. We evaluate the proposed method's performance from various viewpoints: the utilisation of resources, profits of the telecommunications carriers, users' utility and users' satisfaction. We show that, by adopting GVA, the total utility of users can be maximised and the revenues of networks can also be improved.     

Optimal Bandwidth Allocation in a Delay Channel

In this paper, we consider the problem of allocating bandwidth to two queues with arbitrary arrival processes, so as to minimize the total expected packet holding cost over a finite or infinite horizon. Bandwidth is in the form of time slots in a time-division multiple-access schedule. Allocation decisions are made based on one-step delayed queue backlog information. In addition, the allocation is done in batches, in that a queue can be assigned any number of slots not exceeding the total number in a batch. We show for a two queue system that if the holding cost as a function of the packet backlog in the system is nondecreasing, supermodular, and superconvex, then: 1) the value function at each slot will also satisfy these properties; 2) the optimal policy for assigning a single slot is of the threshold type; and 3) optimally allocating$M$slots at a time can be achieved by repeatedly using a policy that assigns each slot optimally given the previous allocations. Thus, the problem of finding the optimal allocation strategy for a batch of slots reduces to that of optimally allocating a single slot, which is conceptually much easier to obtain. These results are applied to the case of linear and equal holding costs, and we also present a special case where the above results extend to more than two queues.     

Bandwidth Allocation Strategies in Wide-Band Integrated Networks

A common digital transmission facility in a wide-band integrated service digital network (ISDN) provides shared access to a community of heterogeneous users. Traffic demands from these users vary in their arrival rate, their service time, and their bit rate. In order for this type of communication system to handle its traffic demands with high efficiency and flexibility, a close control of access to the shared bandwidth is required. We model the system by a general multiserver queueing system where customers demand service from a random number of servers. If no waiting is allowed, this queueing model is readily analyzed, and various server allocation strategies can be studied. If the various access requests are queued for service, then the system calls for efficient strategies for allocating servers to waiting customers. In this case, exact analysis of the underlying queueing model becomes quite difficult. For this case, we present some analytic and simulation results of the performance of the system under several server allocation policies.     

一种改进的业务带宽分配算法

根据虚信元丢失率和等效带宽分配的概念，提出了一种用于ＡＴＭ风格中的呼叫允许接入控制的虚拟等效带宽分配算法。该方法明显提高了链路带宽的利用率，同时在业务种类较多，呼叫数量较大的情况下，比理论计算方法在计算复杂度上有很大的改善，因而便于实时控制。     

关于LMDS系统动态带宽分配问题

本文对LMDS系统的两种可选协议进行分析,比较了其中竞争信道的处理方式,并基于业务端口最低保证速率,给出一种业务信道的动态带宽分配算法,分析结果表明了该算法的公平性.     

Fair Bandwidth Allocation in Optical Burst Switching Networks

Optical burst switching (OBS) is a promising switching technology for next-generation Internet backbone networks. One of the design challenges is how to provide fair bandwidth allocation in OBS networks; the schemes proposed for general store-and-forward IP switching networks can not be used because of the non-buffering and un-fully utilized bandwidth characteristics of OBS networks. We propose a rate fairness preemption (RFP) scheme to achieve approximately weighted max-min fair bandwidth allocation in OBS networks. We present an analysis of the burst loss probability in RFP-based OBS networks. The analysis and simulation results show that the RFP scheme provides fair bandwidth allocation in OBS networks.      

Ad hoc网络基于公平的带宽分配机制研究

Ad hoc网络是一种没有固定基础设施,由多个带有无线收发装置的移动终端组成的多跳临时性自治系统。它独特的个性决定了各数据流之间要竞争共享的有限带宽资源。因此,为了保证Ad hoc网络业务的服务质量,合理的带宽分配机制至关重要。介绍了无线Ad hoc网络的网络模型,对带宽分配机制的定义及约束条件进行描述分析,然后从公平的角度详细地分析了目前Ad hoc网络的带宽分配机制,并总结了各种分配机制的优缺点。     

HSSI Facilitates Bandwidth Allocation among Broadband Applications

The High Speed Serial Interface (HSSI) is a standard recommended by the Electronic Industries Association — Telecommunications Industry Association. It is designed to meet the growing demands of high-speed data applications, eliminating the serial interface bottlenecks of V.35 and EIA-422/499 when running applications over highspeed WANs.     

一种基于区分服务的适应性带宽控制策略

基于区分服务(DiffServ)这种对各种IP业务,尤其是对QoS要求不断增长的实时通信量提出解决方案的模型,文章根据应用的不同将多种应用在中间节点上采用两种不同等级的策略进行带宽和缓冲区分配,并且进行自适应性调节,使得节点的资源利用率最大化。     

EPON系统的动态带宽分配算法

针对EPON系统上行链路多个ONU共享带宽的拓扑结构,分析了制定带宽分配策略所需考虑的基本因素,介绍了一种新的动态带宽分配算法,通过动态请求分配机制,实现上行链路的高效利用。     

基于QoS的EPON系统动态带宽分配机制

通过阐述以太网无源光网络（EPON）系统信道传输数据方式以及动态带宽分配的工作原理,进一步研究了动态带宽分配算法（DBA）在EPON系统中的应用。提出一种基于服务质量（QoS）的EPON系统动态带宽分配机制,该机制根据不同业务的优先级和动态带宽分配算法,灵活地分配上行带宽,提高了带宽利用率,改善了服务质量。     

无线视频通信中带宽分配策略

本文针对无线网络中多用户传输视频时带宽分配问题,提出了一种基于微观经济学中供需平衡的带宽分配策略。该方法充分考虑了运营商的收益,在运营商和用户收益同时最大且供需平衡时,所求得的频谱价格即为运营商的出售价格。同时给出了针对不同用户等级有不同的用户优先级因子,据运营商提出的带宽价格,彼此相互博弈,最终使得自身效用最大。仿真结果表明:本文提出的博弈论方法存在纳什均衡解和均衡单价;用户等级因子能按照用户的不同等级来分配带宽;系统传输质量相比以往方法有所提高。      

一种新型的网络带宽最优分配机制

研究了新一代网络中的网络带宽最优分配机制。应用经济学中的社会福利函数思想和根据流量的优先级构造了基于公平意识的流量效用函数,证明了网络带宽最优分配模型的纳什均衡解存在性,提出了一种基于优先级的网络带宽最优分配机制。仿真结果表明提出的带宽分配机制既能使得流量根据优先级获得区分服务又能保证带宽分配相对公平,从而保证网络中不同业务流的服务质量（QoS）。     

多业务网络动态带宽分配算法研究

在多业务网络环境中,面对不同的QoS需求,为不同业务分配合理的带宽资源是提高网络效率的有效保障。探讨了多业务网络环境下的带宽资源管理办法。重点研究了区分业务模型Diffserv中相关队列调度算法的基本原理,并对加权循环算法WRR进行改进。在基于周期测量发送队列的基础上对队列分配权值进行动态调整,使高优先级业务能够得到充分带宽资源保证的同时,对低优先级业务也有最低的传输带宽保证,从而满足多个业务的共同需求。通过NS2仿真和分析表明,经过改进的算法能对多业务环境下的数据传输提供区分服务,并且使得高优先级业务在丢包数和数据延迟方面与低优先级业务相比有明显减少。     

ATM网中图像分组的带宽分配算法

用两个节点各复用几个图像终端的ＡＴＭ网为例，研究五种图像源的带宽分配算法，静态时隙分配算法，缓冲区基础动态时隙分配算法，自适应时隙分配算法，先来先服务时隙分配算法和速度基础动态时隙分配算法，用计算机仿真和比较确定了五种算法的平均信元时延及时延偏差系数。     

Efficient Bandwidth Allocation and Computation Configuration in Industrial IoT

With the advancement of the Industrial Internet of Things(IoT), the rapidly growing demand for data collection and processing poses a huge challenge to the design of data transmission and computation resources in the industrial scenario. Taking advantage of improved model accuracy by machine learning algorithms, we investigate the inner relationship of system performance and data transmission and computation resources, and then analyze the impacts of bandwidth allocation and computation resource...     

ADSL宽带接入动态带宽分配技术

随着“三网融合”不断推进,互联网业务向多媒体方向发展,用户对宽带上网的带宽需求呈现出多样化的发展趋势,提供动态带宽的宽带接入业务将成为运营商差异化竞争的手段。文章论述了动态带宽实现的技术,带宽分配的主要形式和系统功能。通过动态带宽分配技术使电信运营商能够更灵活高效地满足用户需求,提升运营商的服务质量,使宽带资产创造更大的价值。关键词：BAS,ADSL,宽带接入     

基于收入值的IP网络带宽分配研究

现有IP网络采用尽力而为的方式传送数据,存在可运营性和可管理性差的问题.未来的IP网络必须能够对带宽进行有效的分配,保证对用户的服务质量,并实现运营商利益的最大化.本文提出一种基于收入值的通用带宽分配模型,将基于收入值的带宽分配问题分为完全满足带宽需求的严格带宽分配问题和部分满足带宽需求的灵活带宽分配问题,并证明其等效于背包问题.由于现有算法无法应用于实际的嵌入式系统,本文提出了一种改进贪婪算法(EGA)对基于收入值的带宽分配问题进行求解.在交换容量为128Gbps的分布式路由器上的实验结果表明,EGA是一种兼顾公平性和有效性的算法,能够在确定性时间内执行完毕.采用EGA的网络设备已运行于实际的运营商网络中.