共查询到20条相似文献,搜索用时 62 毫秒
1.
2.
区分服务网络中确保业务端到端时延的接纳控制算法研究 总被引:1,自引:0,他引:1
该文提出了一种对区分服务网络中时延敏感业务进行接纳控制的SACiD(Service Admission Control in DiffServ)算法,它不仅保证用户业务的端到端时延不超过确定的上界,而且能比较充分利用网络资源。仿真结果表明,SACiD算法可以保证时延敏感业务的服务质量,而且其业务接纳率和带宽利用率接近综合服务网络中接纳控制算法的性能,但它的存储器需求却远小于它们。此外,SACiD算法运算简单,具有与区分服务一致的可扩展性,可以为区分服务网络的资源管理提供支持。 相似文献
3.
本文基于区分服务网络体系对访问控制方法进行了研究,提出了一种改进的访问控制体系。该体系以探测流和正常数据包附加测试标记的方式获取网络状况信息。据此适应性调整边界路由器的标记、资源分配等参数,使得语音数据在网络拥塞等状况下也能够获得有效服务,进一步提高网络的资源利用率。 相似文献
4.
5.
夏俊 《太赫兹科学与电子信息学报》2014,12(6):907-911
服务质量(QoS)是用来定义网络给不同形式的流量提供不同级别的服务保障的能力.当前服务质量的体系结构和模型有多种,本文参照RFC2474、RFC2475 标准,提出了一种新的服务质量-区分服务(Diffserv)应用模型,该模型包括:流量的分类器、计量器、标记(或重标记)器、丢弃器和调度器等模块, 其中对于核心模块-调度器, 提出基于最大延迟的加权轮转调度(WRR-MBD)算法,同时给出区分服务模型在3 层以太网交换机的实现方法.通过网络测试分析仪对3 层交换机QoS 性能进行测试,得出在WRR 调度策略下,不同优先级数据包的丢失率基本按所设置的权重比例进行分配,从而避免了严格优先级(SP)调度存在的低优先级队列“饥饿”的现象. 相似文献
6.
7.
介绍了Internet3组织建立的区分服务实验床--QBONE以及带代理(BandWidth Broker)。提出了一种应用带宽代理实现端到端的资源预留的模式。 相似文献
8.
9.
在多业务网络环境中,面对不同的QoS需求,为不同业务分配合理的带宽资源是提高网络效率的有效保障。探讨了多业务网络环境下的带宽资源管理办法。重点研究了区分业务模型Diffserv中相关队列调度算法的基本原理,并对加权循环算法WRR进行改进。在基于周期测量发送队列的基础上对队列分配权值进行动态调整,使高优先级业务能够得到充分带宽资源保证的同时,对低优先级业务也有最低的传输带宽保证,从而满足多个业务的共同需求。通过NS2仿真和分析表明,经过改进的算法能对多业务环境下的数据传输提供区分服务,并且使得高优先级业务在丢包数和数据延迟方面与低优先级业务相比有明显减少。 相似文献
10.
本文提出了一种新的动态带宽分配算法,该算法的实现将极大地提高系统的带宽利用。最后,给出了该算法的包延时和带宽利用的理论分析。 相似文献
11.
An Efficient and Adaptive Bandwidth Allocation Scheme for Mobile Wireless Networks Using an On-Line Local Estimation Technique 总被引:1,自引:0,他引:1
The next generation of mobile wireless networks has to provide the quality-of-service (QoS) for a variety of applications. One of the key generic QoS parameters is the call dropping probability, which has to be maintained at a predefined level independent of the traffic condition. In the presence of bursty data and the emerging multimedia traffic, an adaptive and dynamic bandwidth allocation is essential in ensuring this QoS. The paradox, however, is that all existing dynamic bandwidth allocation schemes require the prior knowledge of all traffic parameters or/and user mobility parameters. In addition, most proposals require extensive status information exchange among cells in order to dynamically readjust the control parameters, thus making them difficult to be used in actual deployment.In this paper, we introduce a novel adaptive bandwidth allocation scheme which estimates dynamically the changing traffic parameters through local on-line estimation. Such estimations are restricted to each individual cell, thus completely eliminating the signaling overhead for information exchange among cells. Furthermore, we propose the use of a probabilistic control policy, which achieves a high channel utilization, and leads to an effective and stable control. Through simulations, we show that our proposed adaptive bandwidth allocation scheme can guarantee the predetermined call dropping probability under changing traffic conditions while at the same time achieving a high channel utilization. 相似文献
12.
In this paper, an energy efficient bandwidth allocation scheme is proposed for wireless communication systems. An optimal bandwidth expansion (OBE) scheme is proposed to assign the available system bandwidth for users. When the system bandwidth does not reach the full load, the remaining bandwidth can be energy-efficiently assigned to the other users. Simulation results show that the energy efficiency of the proposed OBE scheme outperforms the traditional same bandwidth expansion (SBE) scheme. Thus, the proposed OBE can effectively assign the system bandwidth and improve energy efficiency. 相似文献
13.
The combination of broadcast and on-demand data delivery services is an economic way to build a highly scalable wireless information system with limited bandwidth. The use of data broadcasting should be adaptive so that the system response time can always be minimized. A traditional approach requires the development of a system response time equation in order to find the optimal solution. However, obtaining such an equation is not always possible. We observe that by maintaining a certain level of on-demand request arrival rate, a close approximation to the optimal solution can be obtained. Using this approach, a real-time adaptive data delivery algorithm is developed. Our algorithm does not require the access information of the data items to be known exactly, which is needed normally for this kind of optimization problems. A simple and low overhead bit vector mechanism is able to capture the relative popularities of the data items. With this information, our algorithm can give a performance comparable to the ideal case in which the access information for each data item is known exactly. 相似文献
14.
15.
研究了新一代网络中的网络带宽最优分配机制。应用经济学中的社会福利函数思想和根据流量的优先级构造了基于公平意识的流量效用函数,证明了网络带宽最优分配模型的纳什均衡解存在性,提出了一种基于优先级的网络带宽最优分配机制。仿真结果表明提出的带宽分配机制既能使得流量根据优先级获得区分服务又能保证带宽分配相对公平,从而保证网络中不同业务流的服务质量(QoS)。 相似文献
16.
17.
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. 相似文献
18.
提出一种新的基于国际标准和区分服务(Differentiated Service)的以太无源光网络(EPON)动态带宽分配(dynamic bandwidth allocation,DBA)方案,该方案不仅能够在上行方向为多个光网络单元(Optical Network Unit,ONU)高效并公平地分配有限的带宽,而且能够最大限度地保证不同ONU间及不同通信等级间的公平性以及高等级通信的服务质量(QoS)要求.仿真结果证明,与现有算法相比,本算法在延时和利用率方面均有改进,在重负荷情况下改进更明显. 相似文献
19.
一种部分信道响应环境中的多用户MIMO-OFDM自适应子载波分配优化算法 总被引:1,自引:0,他引:1
该文提出一种在部分信道响应环境中利用各个用户的信道反馈信息自适应调整多用户子载波分配的优化算法,该算法考虑到实际环境中反馈信息延迟和误差引起的部分信道响应情况,结合各用户的反馈信道信息和动态子载波组分配技术,可实现有效降低自适应子载波分配运算量同时又不明显弱化系统性能的目的。仿真结果表明,该算法可改善部分信道响应带来的负面影响,同时也使子载波分配算法获得较大的简化。 相似文献