Hop constraint-based capacity fairness control in IP-over-WDM networks

In this article, we consider the capacity fairness problem in IP-over-WDM networks. Since connections with different bandwidth granularities may be established over a shared lightpath, fairness in bandwidth allocation among different users becomes a crucial problem. A simple, yet efficient hop constraint-based admission control scheme is proposed to accommodate more high-bandwidth requests. Through rejecting some of the low-capacity requests that would go through alternative paths with more hops and thus would consume a larger amount of bandwidth, the blocking probability of high-capacity requests reduces notably. Numerical results show that this proposal achieves significant improvement in capacity fairness without raising the overall blocking probability. In addition, it achieves excellent fairness performance at both light and heavy loads by selecting the rejection probability dynamically.

Service-aware based fuzzy admission control scheme in multi-service networks

Multi-service aggregated transmission is the direction of IP network. Providing different Quality of Service (QoS) assurance for different services has become a crucial problem in future network. Admission control is a vital function for multi-service IP network. This paper proposes a novel fuzzy admission control scheme based on coarse granularity service-aware technique. Different service has discriminative sensitivity to the same QoS characteristic parameter in general. The traffic class can be perceived by the service request parameter and the proposed QoS function. And requirements of dif- ferent applications can be met by maintaining the life parameter. From simulation results, the proposed scheme shows a better QoS provisioning than those traditional fuzzy logic based methods under the same admission probability.     

传感器网络中基于事件信息量的公平性控制

在分析无线传感器网络现有公平性控制方法的基础上,依照新的公平性控制的基本原则实施带宽分配,即事件信息量是节点传输的有效信息量,公平性带宽分配是按事件信息量的比例来分配,如何计算带宽竞争节点所传的事件信息量是实现该基本原则的关键.针对事件信息均匀分布的情况,提出了以事件信息量为基础的公平性控制(EFFRC,event faith based fair rate control)算法,该算法将事件信息量的计算转换为事件区域大小的计算,并通过区域细分,将任意形状的事件区域大小的计算转换为若干四边形区域大小的求和,从而达到信息量计算的目的.实验表明,EFFRC算法能够有效计算事件信息量,实现公平的带宽分配.     

A new admission control approach based on prediction

Admission control plays an important role in providing QoS to network users.Mo-tivated by the measurement-based admission control algorithm,this letter proposed a new ad-mission control approach for integrated service packet network based on traffic prediction .In the letter ,FARIMA(p,d,q,)models in the admission control algorithm is deployed.A method to simplify the FARIMA model fitting procedure and hence to reduce the time of traffic modeling and prediction is suggested.The feasibility-study experiments show that FARIMA models which have less number of parameters can be used to model and predict actual traffic on quite a large time scale.Simulation results validate the promising approach.     

Survivable routing in IP-over-WDM networks: An efficient and scalable local search algorithm

In IP-over-WDM networks, a logical IP network is routed on top of a physical optical fiber network. An important challenge here is to make the routing survivable. We call a routing survivable if the connectivity of the logical network is guaranteed in the case of a failure in the physical network. In this paper we describe FastSurv, a local search algorithm for survivable routing. The algorithm works in an iterative manner: after each iteration it learns more about the structure of the logical graph and in the next iteration it uses this information to improve its solution. The algorithm can take link capacity constraints into account and can be extended to deal with multiple simultaneous link failures and node failures. In a large series of tests we compare FastSurv with current state-of-the-art algorithms for this problem. We show that it can provide better solutions in much shorter time, and that it is more scalable with respect to the number of nodes, both in terms of solution quality and run time.     

Utility‐based probabilistic call admission control for complete fairness in wireless networks

Resource reservation or the other prioritization strategies adopted by Call Admission Control (CAC) schemes in wireless networks lead to unfair resource allocation to users belonging to different service classes (SCs) due to high divergence among the respective call blocking probabilities (CBPs). In this paper, we propose dynamic optimization of probabilistic CAC (P‐CAC) schemes to assure CAC fairness among users of different SCs in wireless networks. The approach is based on users utility combined with fairness optimization, aiming at dynamically determining the probability value in the P‐CAC scheme. This optimal probability is adjusted to network ongoing traffic, CBPs of each SC, prioritization levels characterizing the SCs supported, and the users risk aversion, which reflects their behavior toward the perceived QoS. The existence and uniqueness of the optimal probability that leads to absolute fairness among the users of a wireless network are proven. Copyright © 2012 John Wiley & Sons, Ltd.     

Introducing consciousness in UWB networks by hybrid modelling of admission control

We formalize a model for a self-organizing network of nodes that operate according to the UWB principle based on hybrid modelling formalism. We design the rules that lead to the formation of the network and in particular an admission control procedure that is capable to handle both continuous and discrete perturbations, while maintaining the network in a condition of stability. Cognition is introduced in the model by allowing nodes to adjust their rules of operation based on the perception of the environment by an elected node, serving as the observer, that is aware of context, evaluates, and selects one strategy of operation. Maria-Gabriella Di Benedetto obtained her Ph.D. in Telecommunications in 1987 from the University of Rome La Sapienza, Italy. In 1991, she joined the Faculty of Engineering of University of Rome La Sapienza, where currently she is a Full Professor of Telecommunications at the Infocom Department. She has held visiting positions at the Massachusetts Institute of Technology, the University of California, Berkeley, and the University of Paris XI, France. In 1994, she received the Mac Kay Professorship award from the University of California, Berkeley. Her research interests include wireless communication systems and speech science. From 1995 to 2000, she directed four European projects for the design of UMTS. Since 2000, she has been active in fostering the development of Ultra Wide Band (UWB) radio communications in Europe. Within the 5th framework, she directed for the Infocom Dept. two European projects (whyless.com and UCAN) aimed at the design and implementation of UWB ad-hoc networks. Currently, within the 6th EU Framework, her “Networking with UWB” research group participates in the PULSERS Integrated Project which will integrate UWB research and development in Europe for the next years, and in the LIAISON Integrated Project as regards the application of UWB to location-based services. She also participates in the HYCON network of excellence. Dr. Di Benedetto has co-edited several Special Issues on UWB communications and networks for several Journals including IEEE JSAC, Journal of Communications and Networks, Mobile Networks and Applications, Eurasip. In 2004, Dr. Di Benedetto co-authored with G. Giancola the first published book on UWB for communications titled “Understanding Ultra Wide Band Radio Fundamentals” and published by Prentice Hall. She recently completed the co-edition of two new books on UWB that will be published by 2005: UWB Communication Systems—A comprehensive overview, with T. Kaiser, D. Porcino, A. Molisch, and I. Oppermann, Hindawi Publishing Corporation, 2005, and Ultra Wideband Wireless Communications with H. Arslan and Z.N. Chen, John Wiley & Sons, Inc., 2005. Maria Domenica Di Benedetto obtained the “Dr. Ing.” degree (summa cum laude) of Electrical Engineering and Computer Science, University of Roma “La Sapienza” in 1976 (Mosè Ascoli Best Student Award). In 1981, she obtained the degree “Docteur-Ingénieur” and in 1987 the degree “Doctorat d’Etat ès Sciences”, Université de Paris-Sud, Orsay, France. From 1979 to 1983, she had been Research Engineer at the scientific centers of IBM in Paris and Rome. From 1983 to 1987, she had been Assistant Professor at the University of Roma “La Sapienza”. From 1987 to 1990, she had been Associate Professor at the Istituto Universitario Navale of Naples. From 1990 to 1993, had been Associate Professor at the University of Roma “La Sapienza”. Since 1994, she has been Professor of Control Theory at University of L’Aquila. From 1995 to 2002, she was Adjunct Professor, Department of EECS, University of California at Berkeley. In 1987, she was Visiting Scientist at MIT; in 1988, 1989 and 1992, Visiting Professor at the University of Michigan, Ann Arbor; in 1992, Chercheur Associé, C.N.R.S., Poste Rouge, Ecole Nationale Supérieure de Mécanique, Nantes, France; in 1990, 1992, 1994 and 1995, McKay Professor at the University of California at Berkeley. Her research interests revolve around nonlinear control and hybrid systems. She was Associate Editor of the IEEE Transactions of Automatic Control and has been Subject Editor of the International Journal of Robust and Nonlinear Control since 1995. Since 2005, she has been a member of the IFAC Technical Committee on Discrete Event and Hybrid Systems. Since 2000, she has been the Director of the Center of Excellence for Research DEWS on “Architectures and Design methodologies for Embedded controllers, Wireless interconnect and System-on-chip”, University of L’Aquila. She is IEEE Fellow and Chairperson of the Standing Committee on Fellow Nominations, IEEE Control Systems Society. Guerino Giancola received the “Laurea” degree (magna cum laude) in Telecommunications Engineering, and the Ph.D. degree in Information and Communication Engineering from University of Rome La Sapienza, in 2001 and 2005, respectively. He is currently a research affiliate at the INFOCOM Department at University of Rome La Sapienza, where is actually holding the course of “Electrical Communications” for the degree on Electronic Engineering. His research interests include the analysis and modelling of Multi User Interference in Impulse Radio systems, and the design of Medium Access Control functions and protocols for UWB ad-hoc networks. Guerino Giancola recently co-authored with Prof. Maria-Gabriella Di Benedetto a book on Ultra Wide Band from radio to the network, titled “Understanding Ultra Wide Band Radio Fundamentals” and published by Prentice Hall in June 2004. He is now involved in the European project “PULSERS—Pervasive Ultra wideband Low Spectral Energy Radio Systems” and in the European Network of Excellence “HYCON—Hybrid Control: Taming Heterogeneity and Complexity of Networked Embedded Systems”. Guerino Giancola is a member of the IEEE Communication Society.     

Assembly admission control based on random packet selection at border nodes in Optical Burst-Switched networks

In Optical Burst-Switched (OBS) networks employing Just Enough Time (JET) signalling, Burst-Control Packets request resources at intermediate nodes following a one-way reservation protocol, that is, requested resources are not confirmed back to the source. Hence, data bursts are transmitted without any guarantees, and it sometimes occurs that these are dropped at a certain hop in the source–destination path, hence wasting resources at previous hops. This effect is specially harmful if some connections are abusing of the global shared resources, violating their respective Service Level Agreements, thus causing: (1) global performance degradation; and, (2) unfair service received by other connections. This article proposes “Random Packet Assembly Admission Control”, an admission control mechanism for OBS networks that moderates the two problems above. The mechanism monitors the network load status, detects which links are heavily loaded and decides which flows among the total traversing them require throughput decrease, on attempts to alleviate congestion and benefit other flows which are not abusing from the network. Such throughput decrease consists of preventive packet dropping during the assembly process at the ingress nodes of the OBS network, thus making no use of the network core. The numerical results show a substantial increase in the throughput experienced by well-behaved flows, and fundamental fairness achievement in the use of optical resources.

A call admission control for service differentiation and fairness management in WDM grooming networks

We investigate a call admission control (CAC) mechanism for providing fairness control and service differentiation in a WDM network with grooming capabilities. A WDM grooming network can handle different classes of traffic streams which differ in their bandwidth requirements. We assume that for each class, call interarrival and holding times are exponentially distributed. Using a Markov Decision Process approach, an optimal CAC policy is derived for providing fairness in the network. The Policy Iteration algorithm is used to numerically compute the optimal policy. Furthermore, we propose a heuristic decomposition algorithm with lower computational complexity and good performance. Simulation results compare the performance of our proposed policy with those of Complete Sharing and Complete Partitioning policies. Comparisons show that our proposed policy provides the best performance in most cases. Although this approach is motivated by WDM networks, it may be deployed to determine the optimal resource allocation in many problems in wireless and wired telecommunications systems.     

Opportunistic distributed power control with adaptive QoS and fairness for wireless networks

This paper presents a class of distributed power control algorithms for wireless networks which provides quality of service (QoS) fulfillment by exploiting the channel variability opportunistically. It is suitable for traffic sources requiring either a minimum or a prescribed QoS provision, and at the same time provides a fair resource allocation. Practical system constraints such as limitations on transmission power and modulation and coding schemes are considered in this framework. Moreover, it is analytically shown to be more energy efficient than the opportunistic power control. Two algorithms of this class are described and have their performance confronted with opportunistic algorithms. Copyright © 2009 John Wiley & Sons, Ltd.     

RPR环网中的一种带宽公平分配算法

首先讨论了RPR网络中的公平性原则,然后结合该原则引入了一种适合于RPR网络的公平分配方案,基于该方案提出了一种能满足RPR环网性能要求的公平分配算法。该算法通过采用控制的方法为共享某链路的各数据流合理地分配带宽资源,从而达到:(1)各流的速率达到稳定;(2)链路缓存的占有量稳定到一个目标值;(3)链路带宽得到充分利用且实现公平分配。同时该算法能顺次协同地处理完网络中的各个链路,从而能够实现整个RPR环网的公平性与高的链路带宽利用率,达到RPR协议所要求的目标。给出了该算法的代码描述并对其作出稳定性分析,然后通过仿真对其性能进行了验证。     

A combined admission control algorithm with DA protocol for satellite ATM networks

Admission control is an important strategy for Quality of Service （QoS） provisioning in Asynchronous Transfer Mode （ATM） networks. Based on a control-theory model of resources on-Demand Allocation （DA） protocol, the paper studies the effect of the protocol on the statistical characteristics of network traffic, and proposes a combined connection admission control algorithm with the DA protocol to achieve full utilization of link resources in satellite communication systems. The proposed algorithm is based on the cross-layer-design approach. Theoretical analysis and system simulation results show that the proposed algorithm can admit more connections within certain admission thresholds than one that does not take into account the DA protocol. Thus, the proposed algorithm can increase admission ratio of traffic sources for satellite ATM networks and improve satellite link utilization.     

Efficient delay based scheduling with fairness in multi-hop wireless mesh networks

Some scheduling algorithms have been designed to improve the performance of multi-hop wireless mesh networks (WMNs) recently. However the end-to-end delay is seldom considered as the complexity of multi-hop topology and open wireless shared channel. This article proposes an efficient delay based scheduling algorithm with the concept of buffer-data- hops. Considering the demand satisfaction factor (DSF), the proposed algorithm can also achieve a good fairness performance. Moreover, with the interference-based network model, the scheduling algorithm can maximize the spatial reuse, compared to those graph-based scheduling algorithms. Detailed theoretical analysis shows that the algorithm can minimize the end-to-end delay and make a fair scheduling to all the links.     

Design of Logical Topology with Effective Waveband Usage in IP-over-WDM Networks

We deal with the problem of designing the logical topology in IP-over-WDM networks. Many conventional methods for designing the logical topology assume that a constant number of wavelengths will be available on each fiber. But it is not necessary to utilize all wavelengths on each fiber in building an effective logical topology on a WDM network. Instead, several wave-bands may be considered for introduction while deploying additional wave-bands and their corresponding optical amplifiers when additional wavelengths are actually required. In this case, the number of wavelengths available on the respective fibers depends on the number of optical fiber amplifiers deployed on each fiber. In this paper, we propose a heuristic algorithm for the design of a logical topology with as few optical fiber amplifiers as possible. Our results indicate that our algorithm reduces the number of optical fiber amplifiers with a slight increase of average packet delays.     

On the Maximum Protection Problem in IP-over-WDM Networks Using IP LSP Protection

In dynamic IP-over-WDM networks efficient fault-management techniques become more difficult since as demands change with time the optimal logical topology varies as well. Changes in the virtual topology should be done with care because working IP LSPs routed on top of a virtual topology should not be interrupted. Reconfiguration of the virtual topology may also affect precomputed backup IP LSPs to be activated in case of failure meaning that backup IP LSPs would need to be recomputed after any change in the virtual topology. A good sense solution can be the dimensioning of the virtual topology for a worst case traffic scenario, having as goal the minimization of the network cost, for example, and then route dynamic IP LSPs on this virtual topology. The virtual topology would remain unchanged as long as possible, that is, until changes in the virtual topology are considered to bring considerable benefits. Since data services over IP are essentially of a best-effort nature, protection could be provided, using IP LSP protection, only when bandwidth is available in the virtual topology. The computation of backup IP LSPs does not interfere with working IP LSPs meaning that no service interruption will exist. Such a strategy, considered in this paper, allows resources to be used efficiently, since free bandwidth is used for backup purposes, while the normal delivery of traffic is guaranteed in peak traffic situations although having no protection guarantees. Our main objective is to quantify the spare capacity, which can be used for restoration (backup) purposes, over a virtual topology designed and optimized to carry a traffic scenario with no survivability and QoS requirements. We analyse the maximum protection (MP) problem in such IP-over-WDM network environment. Protection is provided to IP LSP requests whenever possible through bandwidth reservation in a backup IP LSP on the virtual topology. Besides the mathematical formalization of the MP problem, an upper bound and heuristic algorithms are proposed and evaluated. The traffic considered includes IP LSPs of different granularities and is the worst case traffic scenario for which the network should be dimensioned.     

A connection control strategy for bursty sources in broadband packet networks

This paper proposes an admission strategy for connection-oriented services at the access node of a broadband integrated packet network based on asynchronous transfer mode. Based on an estimate of the probability of cell loss and in the absence of buffering, we determine the number of sources from different classes of bursty traffic which can be accepted. The parameters which are used to describe the traffic sources are average bit rate and peak bit rate. We will evaluate the cell loss estimate for homogeneous and heterogeneous cases. Furthermore, we will examine the variation of this estimate as the average to peak ratio changes. The estimate is an upper bound for the probability of cell loss. Based on this upper bound simple and robust allocation of resources to bursty sources can be developed. The proposed strategy can be implemented using simple computations or via a look-up table to determine admission or denial of an incoming call and therefore allocating the required capacity. The procedure results in efficient use of the bandwidth, ensuring the desired service quality for connection-oriented services and results in proactive control of network congestion.     

A probabilistic approach for fair-efficient call admission control in wireless multiservice networks

The efficiency of call admission control (CAC) schemes in multiclass wireless networks should be evaluated not only with regard to the call blocking probability (CBP) achieved for every service class (SC) supported but also with regard to quality of service (QoS) and network efficiency criteria. In this article, four CAC schemes offering priority to SCs of advanced QoS requirements, based on guard channel policy, are studied and evaluated taking into account fairness and throughput criteria in addition to CBP. For the performance evaluation of the proposed CAC schemes and to examine fairness issues, two fairness indices are introduced along with a throughput metric. The analytical results, validated through extensive simulations, indicate that by appropriate selection of the CAC parameters satisfactory fairness and throughput are achieved while achieving low CBP.     

Comparison of admission control schemes in ATM networks

Asynchronous transfer mode (ATM) offers an efficient means of carrying a wide spectrum of BISDN traffic provided that network congestion is prevented. Unfortunately, efficient congestion control is difficult to achieve in integrated broadband networks, owing to the wide range of traffic characteristics and quality of service (QOS) requirements. We have implemented a network simulator that allows us to evaluate many proposed admission control schemes using many different traffic models. We present the results of several simulation studies, including one study of the performance of the admission control schemes in the presence of traffic sources that exhibit long-term dependence.     

Perceptive admission control for wireless network quality of service

As wireless networks become more widely used, there is a growing need to support advanced services, such as multimedia streaming and voice over IP. Traditional approaches to guarantee quality of service (QoS) work well only with predictable channel and network access. In wireless mobile networks, where conditions dynamically change as nodes move about the network, a stateless, high level approach is required. Since shared wireless resources are easily over-utilized, the load in the network must be controlled so that an acceptable QoS for real-time applications can be maintained. If minimum real-time requirements are not met, these unusable packets waste scarce bandwidth and hinder other traffic, compounding the problem. To enable high QoS for all admitted traffic, we propose the Perceptive Admission Control (PAC) protocol. PAC monitors the wireless channel and dynamically adapts admission control decisions to enable high network utilization while preventing congestion. Through discussion, simulations and testbed experiments, we demonstrate that PAC ensures low packet loss and delay for all admitted flows.     

Joint admission control algorithm based on load transfer in heterogeneous networks

A load-transfer-based joint admission control (LJAC) algorithm in heterogeneous networks was proposed.The access requirements of users were admitted based on load balancing,the dynamic load transfer of traffics in the overlapping coverage areas of heterogeneous networks were introduced,and the influence of such factors as the layout of heterogeneous networks and the vertical handoff was considered in the algorithm.The integrated system of heterogeneous networks was modeled as a multidimensional Markov chain,the steady-state probabilities were obtained and the quality of service (QoS) performance metrics were derived.Based on the Poisson point process theory,the upper bound of capacity of the heterogeneous networks satisfying QoS limitations was obtained.The admission control parameters of the integrated system of heterogeneous networks were optimized in order to maximize the resource utilization rate as well as guaranteeing the QoS of users.The simulation results demonstrate lower traffic blocking probability,lower failure probability of vertical handoff requirements,and larger system capacity gain can be achieved by using the proposed LJAC algorithm.