ATM网络VP带宽动态管理策略的研究

文章介绍了一种适合于混合业务类型、非均匀业务流两步长VP动态带宽管理策略，分析了带宽管理策略的带宽利用率、连接阻塞概率和带宽分配处理负载，对其进行了计算机模拟仿真，并与固定步长动态带宽管理策略进行了分析比较。     

适用于混合业务类型的两步法ATM网络VP带宽动态管理策略的研究

介绍了一种适合于混合业务类型，非均匀业务流两步长ＶＰ动态带宽管理策略，分析了宽管理策略的带宽利用率，连接阻概率和带宽分配处理负荷。对其进行了计算机模拟仿真，并与固定步长动态带宽管理策略进行了分析比较。     

3G中增强的3层动态位置管理建模与分析

基于3G网络中由HLR(home location register)、GLR(gateway location register)、VLR(visitor location register)构成的3层数据库结构,提出了基于移动的增强动态位置管理策略,重点分析了该策略下位置更新和寻呼的代价模型。并使用该代价模型对3G网络中基于移动的增强动态位置管理策略、基于移动的基本动态位置管理策略和静态位置管理策略进行了评价,计算结果显示增强动态位置管理策略要优于基于移动的基本位置管理策略和静态位置管理策略。     

VBR视频流在MPLS网中的传输及其带宽分配算法研究

为宽带网络提供合理有效的QoS保证已成为当前网络界的研究热点之一。在DiffServ over MPLS方案的基础上，对PS业务的资源管理策略进行了研究，同时结合VBR视频流的流量特性和带宽需求，提出了一种新的基于管道的动态带宽分配算法，并对算法进行了仿真验证。     

GPON中一种二端动态带宽分配算法的设计与分析

首先对GPON中现有的动态带宽分配算法进行了阐述,然后提出了一种有效QoS保证的二端动态带宽分配算法,并给出了该算法的实现流程图.接着针对几种负载下的不同业务吞吐量情况对该算法进行了分析,最后得出了该算法可以满足动态带宽分配公平性的结论.     

基于动态资源分配的EPON接入网研究

本文对基于动态资源分配的EPON结构进行了研究.在下行方向讨论了一种新的动态波分复用技术,并与时分复用广播系统相比较进行了仿真性能分析;在上行方向,采用时分多址技术共享上行带宽,对带宽分配策略进行了较深入研究,并进行了仿真分析.     

EPON动态带宽分配算法及仿真

对当前EPON(Ethernet Passive Optical Network)系统中比较经典的动态带宽分配算法进行简要分析,提出了一种支持QoS(Quality of Service)的动态带宽分配算法.算法动态确定轮询周期,充分保证了高优先级业务所需的带宽,同时考虑到了剩余带宽的再分配.仿真结果表明,该算法提高了系统的带宽利用率,提供了更加稳定的QoS.     

一种基于无线多媒体业务的可升降级QoS动态带宽分配与优化策略

无线多媒体网络中的业务包括话音、流媒体、交互类和背景类业务4种,除话音业务外其余3种业务都是可变比特速率业务。对该网络用户资源分配(主要是带宽的分配)若采用传统的固定分配方法,必定陷入资源利用率低下和用户QoS得不到保障的两难境地。该文提出了一种基于无线多媒体业务的动态带宽分配与优化策略,在保证用户QoS的前提下,尽可能提高资源利用率。该文分别从网络和用户两个角度考虑,通过系统容量、业务阻塞率、数据延迟、流媒体的实际传输比和VBR业务综合服务等级等参数,对可升降级QoS无线多媒体网络进行了仿真分析,结果表明,对比传统的网络资源管理策略,该策略大大改善了系统的性能,提高了系统资源利用率。     

EPON中的一种新型动态带宽分配算法

动态带宽分配是以太网无源光网络(EPON)系统中的一个重要研究领域,提出了一种基于业务的两层三次带宽分配的DBA新型算法.该算法在兼顾动态带宽分配的带宽利用率和QOS保证方面进行了改进,通过研究分析给出了最优算法,并在模拟流量下进行了性能分析.通过与已有算法的对比,证明其有很好的性能.     

一种新的基于GPON的动态带宽分配算法

为了实现吉比特无源光网络(GPON)带宽分配的公平性,降低网络的丢包率及传输延时,文章研究了GPON系统传输汇聚层的帧结构及动态带宽分配的实现方法,提出了一种新的动态带宽分配(DBA)算法--基于QoS的二层动态带宽分配算法.基本思路是根据不同等级业务的带宽需求,在PON层和ONU层分别进行带宽的合理分配.理论分析和仿真试验证明,这种算法可以提高带宽的利用率,保证不同业务的不同时延要求,并且对不同用户和不同等级的业务都具有很好的公平性.     

Performance analysis for the dynamic virtual path bandwidth control method in ATM networks

Broadband ISDN (integrated services digital network) should provide various kinds of communication services for multimedia traffic, including voice, computer data, still picture and motion video, and an ATM (asynchronous transfer mode) technology is expected to satisfy those demands. In ATM networks, a VP (virtual path) concept is introduced for simplifying the network resource management. However, if the bandwidth of each VP is fixed, it cannot absorb traffic load fluctuation. In this case, it is likely to happen that one VP has no remaining bandwidth while other VPs on the same physical link have free capacities. Another extremity is that a VP is not introduced, and that all VCs along the same physical link share the whole bandwidth of the link. This can achieve an efficient use of the link, but it apparently requires complicated call set-up procedures. In this paper, we propose a new dynamic VP bandwidth control method, in which the bandwidth allocated to each VP is dynamically changed according to traffic fluctuation. More specifically, in the case that multiple VPs are multiplexed on the same link between two nodes, when the utilization of some VP is increased, that VP requests an additional bandwidth. When the traffic load becomes low and the utilization of a VP is decreased, a part of the assigned bandwidth is released. We consider two methods for this purpose; one is the basic method in which the bandwidth increase request is issued after the VP bandwidth is exhausted. The other is the look-ahead method where the bandwidth increase is requested in advance before the bandwidth starvation. An approximate analysis for the above methods is provided, and the validation of its accuracy is assessed by comparing with simulation results. Through numerical examples, we show that our methods can provide performance improvement in terms of call loss probabilities of each VP.     

Design and analysis of a bandwidth management framework forATM-based broadband ISDN

When designing and configuring an ATM-based B-ISDN, it remains difficult to guarantee the quality of service (QoS) for different service classes, while still allowing enough statistical sharing of bandwidth so that the network is efficiently utilized. These two goals are often conflicting. Guaranteeing QoS requires traffic isolation, as well as allocation of enough network resources (e.g., buffer space and bandwidth) to each call. However, statistical bandwidth sharing means the network resources should be occupied on demand, leading to less traffic isolation and minimal resource allocation. The authors address this problem by proposing and evaluating a network-wide bandwidth management framework in which an appropriate compromise between the two conflicting goals is achieved. Specifically, the bandwidth management framework consists of a network model and a network-wide bandwidth allocation and sharing strategy. Implementation issues related to the framework are discussed. For real-time applications the authors obtain maximum queuing delay and queue length, which are important in buffer design and VP (virtual path) routing     

Dynamic resource allocation in ATM networks

This article investigates resource allocation in ATM networks and emphasizes bandwidth allocation. Resource allocation methods are categorized, and static and dynamic allocation strategies are compared. Dynamic allocation uses actual traffic behavior, while static allocation uses only the reference traffic condition given a priori. Examples of dynamic allocation strategies are available bit rate flow control, dynamic connection admission control, and dynamic VP bandwidth control. Dynamic resource allocation is shown to be promising for situations where the a priori reference model is unclear     

Internetting LAN's and MAN's to B-ISDN's for connectionless trafficsupport

One of the challenges in the interconnection of LANs and MANs to asynchronous transfer mode (ATM) networks is the support of connectionless traffic in the ATM network. A commonly proposed strategy consists of maintaining a thin, low bandwidth virtual path (VP) between each pair of gateways and requesting more bandwidth whenever a burst comes in from the LAN or MAN. Unfortunately, this strategy places a heavy burden on the ATM control processors; furthermore, it is overly conservative in the use of bandwidth. An alternative solution is proposed: on the-fly tranmission of bursts without prior bandwidth reservation. The key conditions for this scheme to work are the use of the cell loss priority (CLP) bit in the ATM cell header and the knowledge of available bandwidth on the path through bandwidth advertising. An on-the-fly strategy for connectionless traffic is described and is compared with a bandwidth renegotiation strategy     

Performance limitation of the leaky bucket algorithm for ATMnetworks

The performance limitation of the “leaky bucket algorithm” is analyzed for usage parameter control and traffic management in asynchronous transfer mode (ATM) networks. Simulation results show that the conventional statistical bandwidth allocation method, which uses “the worst pattern derived from the cell interarrival time moments” permitted by the leaky bucket algorithm, can not guarantee the quality of service (QOS). As a result, this paper proves that the VC/VP bandwidth allocation method based on the leaky bucket algorithm is unsatisfactory     

Self-sizing network—algorithmic aspects

This paper presents a bandwidth adjustment mechanism for a self-sizing network, which has been proposed as an operation concept for ATM networks and is based on the autonomous adjustment of virtual path (VP) bandwidth. Several simple algorithms for estimating the bandwidth demand—the minimum bandwidth needed to satisfy the quality-of-service (QoS) objectives—are proposed for the case where QoS-guaranteed virtual channels (VCs) and best-effort VCs are multiplexed in separate VPs. The proposed algorithms use only a few assumptions about traffic characteristics, making them applicable to a wide range of traffic types. In addition, errors in VP bandwidth estimation are corrected by adaptively adjusting the VP bandwidth using real-time traffic measurement. Numerical examples confirm that the proposed algorithms can quickly restore the QoSs of VPs from any initial conditions and keep them at an appropriate level. © 1998 John Wiley & Sons, Ltd.     

Multi-hour, multi-traffic class network design for virtualpath-based dynamically reconfigurable wide-area ATM networks

The virtual path (VP) concept has been gaining attention in terms of effective deployment of asynchronous transfer mode (ATM) networks in recent years. In a recent paper, we outlined a framework and models for network design and management of dynamically reconfigurable ATM networks based on the virtual path concept from a network planning and management perspective. Our approach has been based on statistical multiplexing of traffic within a traffic class by using a virtual path for the class and deterministic multiplexing of different virtual paths, and on providing dynamic bandwidth and reconfigurability through virtual path concept depending on traffic load during the course of the day. In this paper, we discuss in detail, a multi-hour, multi-traffic class network (capacity) design model for providing specified quality-of-service in such dynamically reconfigurable networks. This is done based on the observation that statistical multiplexing of virtual circuits for a traffic class in a virtual path, and the deterministic multiplexing of different virtual paths leads to decoupling of the network dimensioning problem into the bandwidth estimation problem and the combined virtual path routing and capacity design problem. We discuss how bandwidth estimation can be done, then how the design problem can be solved by a decomposition algorithm by looking at the dual problem and using subgradient optimization. We provide computational results for realistic network traffic data to show the effectiveness of our approach. We show for the test problems considered, our approach does between 6% to 20% better than a local shortest-path heuristic. We also show that considering network dynamism through variation of traffic during the course of a day by doing dynamic bandwidth and virtual path reconfiguration can save between 10% and 14% in network design costs compared to a static network based on maximum busy hour traffic     

Design of ATM Networks with Multiple Traffic Classes

In this paper, we propose a new heuristic design algorithm for the virtual path (VP)-based ATM network with multiple traffic classes, in which QoS constraints associated with traffic class are taken into account. The minimum bandwidth of VP required to carry given amount of traffic is obtained by utilizing an equivalent bandwidth concept, and the route of each VP is placed so that the network cost is minimized while the QoS requirement is fulfilled. To evaluate our design algorithm, we consider two kinds of traffic: voice traffic as low speed service and still picture traffic as high speed service. Through numerical examples, we demonstrate that our design method can achieve an efficient use of network resources, which results in providing a cost-effective VP-based ATM network.