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.      

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

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

Auction-Based Bandwidth Allocation in Multi-Hop Wireless Ad Hoc Networks

In this paper, we propose a multi-hop auction-based bandwidth allocation mechanism to address the flow contention problem in wireless ad hoc networks. By modeling the problem as an iterative auction-based structure, it enables us to derive fair and efficient bandwidth allocation to each node on the basis of only local information. Further, a multi-hop flow coordination mechanism is then developed to optimize the network performance. Simulation results suggest that the proposed mechanism outperforms other approaches in terms of network throughput, bandwidth utilization, fairness, end-to-end delay, packet loss rate, and robustness.     

On Bandwidth Allocation for Data Dissemination in Cellular Mobile Networks

Wireless bandwidth is a scarce resource in a cellular mobile network. As such, it is important to effectively allocate bandwidth to each cell such that the overall system performance is optimized. Channel allocation strategies have been extensively studied for voice communications in cellular networks. However, for data dissemination applications, studies on bandwidth allocation have thus far been limited to a single-cell environment. This paper investigates the problem of bandwidth allocation for data dissemination in a multi-cell environment, which, to the best of our knowledge, has not been investigated before. The performance objective is to minimize the overall expected access latency given the workload for each cell in a data dissemination system. Two heuristic techniques, called compact allocation and cluster-step allocation, are proposed to effectively allocate bandwidth for a cellular network. Simulation experiments are conducted to evaluate the performance of the proposed bandwidth allocation schemes. Experimental results show that the proposed schemes substantially outperform the uniform allocation and proportional allocation schemes.     

An End-to-End Bandwidth Allocation Algorithm for Ad Hoc Networks

Bandwidth-guaranteed QoS service in ad hoc networks is a challenging task due to several factors such as the absence of the central control, the dynamic network topology, the hidden terminal problem and the multihop routing property. An end-to-end bandwidth allocation algorithm was proposed in [Lin and Liu, 15] to support the QoS service in ad hoc networks. However, without exploring the global resource information along the route, the performance of that algorithm is quite limited. In addition, it also incurs significant control overhead. We develop a new algorithm for end-to-end bandwidth calculation and assignment in ad hoc networks which utilizes the global resource information along the route to determine the available end-to-end bandwidth. Our method also employs the topology-transparent scheduling technology to reduce the control overhead. The proposed algorithm can be efficiently utilized in a distributed manner. Both theoretical analysis and simulation results show that our end-to-end bandwidth allocation scheme can significantly improve the network capacity compared with the existing method.     

ATM网络虚通道路由选择和带宽分配算法

ＡＴＭ网络中,虚通道路由选择和带宽分配问题是相互关联的,需要考虑虚通道路由布局和带宽大小,并且虚通道连接还是建立虚信道连接的基础,文章根据虚通道连接的特点,提出了将虚通道路由选择和带宽分配联合优化的方法,给出了应用进化规划方法的求解算法和仿真实例。     

Enhanced Dynamic Bandwidth Allocation Algorithm in Ethernet Passive Optical Networks

As broadband access is evolving from digital subscriber lines to optical access networks, Ethernet passive optical networks (EPONs) are considered a promising solution for next generation broadband access. The point‐to‐multipoint topology of EPONs requires a time‐division multiple access MAC protocol for upstream transmission. In this paper, we propose a new enhanced dynamic bandwidth allocation algorithm with fairness called EFDBA for multiple services over EPONs. The proposed algorithm is composed of a fairness counter controller and a fairness system buffer in the optical line terminal. The EFDBA algorithm with fairness can provide increased capability and efficient resource allocation in an EPON system. In the proposed EFDBA algorithm, the optical line termination allocates bandwidth to the optical network units in proportion to the fairness weighting counter number associated with their class and queue length. The proposed algorithm provides efficient resource utilization by reducing the unused remaining bandwidth made by idle state optical network units.     

A Scheduling Technique Wireless Personal for Bandwidth Communication Allocation in Networks

Future generation wireless personalcommunication networks (PCN) are expected to providemultimedia capable wireless extensions of fixedATM/B-ISDN. This paper presents a scheduling techniquefor PCN based on TDMA and the leaky bucket regulator, thewell known bandwidth enforcement mechanism for fixedATM. The main objective of the proposed technique is toensure fair and efficient treatment of various types oftraffic on the air interface, includingconstant-bit-rate (CBR) voice and variable-bit-rate(VBR) video. Two alternative priority mechanisms areintroduced and their performance is evaluated. Theperformance comparison of the alternatives reveals aninteresting tradeoff between fairness and quality ofservice (QoS).     

Dynamic Bandwidth Allocation in WDM Passive Star Networks with Asymmetric Traffic

When asymmetric traffic is offered to a WDM passive star network, the offered bandwidth must be allocated is such a way that each station takes a portion of the available bandwidth proportional to its needs. When the traffic characteristics are fixed and a priori known, then, the bandwidth allocation scheme can be based on these characteristics. Unfortunately, the traffic characteristics are often unknown and time-variable. In this paper, a dynamic bandwidth allocation scheme is presented, which is based on the network feedback information in order to be capable of adapting to the changing traffic characteristics. According to the proposed scheme, a set of learning automata processes the network feedback information and dynamically allocates the available bandwidth to the stations according to their needs.     

Optical Coding for Enhanced Real-Time Dynamic Bandwidth Allocation in Passive Optical Networks

In this paper, optical pulse encoding and decoding technology is proposed to enable real-time signaling in a passive optical network (PON) setting. Unique optical codes are assigned to selected optical network units (ONUs) equipped with the corresponding encoders. An out-of-band pulse train is broadcast from the optical line terminal (OLT) and is modulated by ONU-based switches. The encoded reflections of pulses are thus used to update the status of the OC-enabled queues at the OLT in real time. We explore the enhanced PON architecture and define its major design parameters. Through extensive simulations, we investigate the design principles and limits of our system parameters. Through a performance comparison of native interleaved polling with adaptive cycle time with its OC-enhanced counterpart, we show that our OC enhancement breaks the fundamental delay lower bound associated to the polling cycle. We propose and investigate new dynamic bandwidth allocation (DBA) algorithms that exploit real-time queue updates enabled through OC-enhanced polling. We also explore the pay-as-you-grow implementation of OC-enhanced polling to realize quality-of-service (QoS) differentiation, elaborate on possible migration paths from conventional PONs, and investigate absolute QoS performance guarantee improvements achieved through OC-enabled real-time DBA algorithms.     

A QoS Routing Protocol with Bandwidth Allocation in Multichannel Ad Hoc Networks

Mobile multimedia applications have recently generated much interest in mobile ad hoc networks (MANETs) supporting quality-of-service (QoS) communications. Multiple non-interfering channels are available in 802.11 and 802.15 based wireless networks. Capacity of such channels can be combined to achieve higher QoS performance than for single channel networks. The capacity of MANETs can be substantially increased by equipping each network node with multiple interfaces that can operate on multiple non-overlapping channels. However, new scheduling, channel assignment, and routing protocols are required to utilize the increased bandwidth in multichannel MANETs. In this paper, we propose an on-demand routing protocol M-QoS-AODV in multichannel MANETs that incorporates a distributed channel assignment scheme and routing discovery process to support multimedia communication and to satisfy QoS bandwidth requirement. The proposed channel assignment scheme can efficiently express the channel usage and interference information within a certain range, which reduces interference and enhances channel reuse rate. This cross-layer design approach can significantly improve the performance of multichannel MANETs over existing routing algorithms. Simulation results show that the proposed M-QoS-AODV protocol can effectively increase throughput and reduce delay, as compared to AODV and M-AODV-R protocols.     

Bandwidth Management and Switch Buffer Allocation in High-speed Networks with Bursty Traffic

This article proposes the bandwidth management algorithm that allows for packet transfer in the switch and admits packets based on the switch and network occupancy.     

Dynamic Bandwidth Allocation Algorithms for Ethernet Passive Optical Networks with Threshold Reporting

In this paper we present a dynamic bandwidth allocation algorithm for Ethernet Passive Optical Networks (EPON), which makes use of the Multipoint Control Protocol (MPCP) with threshold reporting and with inter- and intra-ONU priority scheduling. Three varieties of this algorithm are compared under both symmetric and asymmetric traffic conditions, by means of a detailed simulation program, regarding average packet delay for several priorities, delay variation for constant bit rate (CBR) traffic and bandwidth utilization. Two types of intra-ONU priority scheduling algorithms are considered, being full and interval priority scheduling, called FPS and IPS, respectively. It is shown that by combining IPS with the threshold reporting mechanism one can achieve a nearly optimal bandwidth utilization (by avoiding nearly all fragmentation losses). IPS, however, causes an increased packet delay and delay variation for CBR traffic in comparison with FPS. In order to eliminate this drawback, we combine the IPS scheduling algorithm with a rate-based scheme for the highest priority (CBR) traffic. The combined IPSA algorithm provides an interesting trade-off between the efficiency, which is still near to the optimal, and the delay characteristics of time critical applications. Finally, we also demonstrate that unfairness arises with FPS under asymmetric traffic conditions, that is, ONUs with more best effort traffic are favored by FPS. Whereas asymmetric traffic conditions only slightly affect the fairness of IPS under low load conditions.     

A Bandwidth Guaranteed Integrated Routing Algorithm in IP over WDM Optical Networks

In this paper, we have developed an integrated online algorithm for dynamic routing of bandwidth guaranteed label switched paths (LSPs) in IP-over-WDM optical networks. Traditionally, routing at an upper layer (e.g., IP layer) is independent of wavelength routing at the optical layer. Wavelength routing at the optical layer sets up a quasi-static logical topology which is then used at the IP layer for IP routing. The coarse-grain wavelength channels and the pre-determined virtual topologies with respect to some a priori assumed traffic distribution are barriers to efficient resource use and inflexible to changing traffic. We take into account the combined knowledge of resource and topology information at both IP and optical layers. With this added knowledge, an integrated routing approach may extract better network efficiencies, be more robust to changing traffic patterns at the IP layer than schemes that either use dynamic routing information at the IP layer or use a static wavelength topology only. LSP set-up requests are represented in terms of a pair of ingress and egress routers as well as its bandwidth requirement, and arrive one-by-one. There is no a priori knowledge regarding the arrivals and characteristics of future LSP set-up requests. Our proposed algorithm considers not only the importance of critical links, but also their relative importance to routing potential future LSP set-up requests by characterizing their normalized bandwidth contribution to routing future LSP requests with bandwidth requirements. Moreover, link residual bandwidth information that captures the link's capability of routing future LSPs is also incorporated into route calculation. Extensive simulation was conducted to study the performance of our proposed algorithm and to compare it with some existing ones, such as the integrated minimum hop routing algorithm and the maximum open capacity routing algorithm. Simulation results show that our proposed algorithm performs better than both routing algorithms in terms of the number of LSP set-up requests rejected and the total available bandwidth between router pairs.     

QoS-aware Two-level Dynamic Uplink Bandwidth Allocation Algorithms in IEEE 802.16j Based Vehicular Networks

Wireless communications play an important role in improving transportation environment safety and providing Internet access for vehicles. This paper proposes a QoS-aware two-level uplink dynamic bandwidth allocation (DBA) algorithm for IEEE 802.16j-based vehicular networks. IEEE 802.16j is an extension of standard IEEE 802.16 to support relay mode operation where traffics from/to subscriber stations (SS) are relayed to/from a base station (BS) via a relay station (RS). In such a vehicular network, the IEEE 802.16j BSs are installed along a highway, RSs are installed in large vehicles such as coaches, and the 802.16j interface is equipped on SSs such as individual passengers’ mobile devices within a moving coach. In the proposed DBA algorithm, a utility function, which considers characteristics of different types of services, is designed. The objective of the proposed two-level DBA algorithm is to allocate bandwidth to different types of services from BS to RSs and then from a RS to SSs with given quality of service (QoS) requirements. It aims at maximizing the utility of the overall network and minimizing the average queuing delay of the overall network. The simulation results show the effectiveness and efficiency of the proposed DBA algorithm.