As an alternative solution to provide the quality of services (QoS) for broadband access over Ethernet Passive Optical Network (EPON), we present the usage of MAC control message for plural class queues and a traffic-class burst-polling based delta dynamic bandwidth allocation (DBA), referred to as TCBP-DDBA, scheme. For better QoS support, the TCBP-DDBA minimizes packet delays and delay variations for expedited forwarding packet and maximizes throughput for assured forwarding and best effort packets. The network resources are efficiently utilized and adaptively allocated to the three traffic classes for the given unbalanced traffic conditions by guaranteeing the requested QoS. Simulation results using OPNET show that the TCBP-DDBA scheme performs well in comparison to the conventional unit-based allocation scheme over the measurement parameters such as: packet delay, packet delay variation, and channel utilization.

The Generalized Max-Min Fairness policy (GMM) allocates in a fair way the available bandwidth among elastic calls by taking into account their minimum and maximum rate requirements. The GMM has been described in a five-step procedure, which has the advantage of an easy presentation, but does not come into details, as far as its computer implementation is concerned, and fails to describe the policy in a clear mathematical way. We propose a new algorithm for the GMM policy, in a clear mathematical way, based on Linear Programming (LP). The new algorithm is directly convertible into software. Numerical examples clarify our algorithm.

This paper proposes a bandwidth allocation algorithm and a demand accommodation algorithm guaranteeing utility max-min fairness under bandwidth constraints. We prove that the proposed algorithms can fairly split network resources among connections and achieve call admission control considering the fairness among different types of applications. We then formulate three different network design problems to maximize the total utility of all customers, the number of users accommodated in the network, and the average utility of the customers accommodated in the network. To solve the problems, we extend the conventional network design algorithms considering utility max-min fair share, and numerically evaluate and compare their performance. Finally, we summarize the best algorithms to design the utility max-min fair share networks considering the operation policy of network providers.

In finding the optimal solution of virtual-path bandwidth allocation for large-scale networks, existing searching algorithms frequently call the process which calculate the bandwidth for given call blocking probability (CBP) and traffic loads. This is an inverse process of calculating CBP for given traffic loads and bandwidth. Because there is no analytic expression of calculating CBP, the process of calculating bandwidth with given CBP and traffic adopts an iteration algorithm. It leads to a tedious computation process. In this letter, a fast bandwidth evaluation algorithm is proposed and applied to the field of virtual path bandwidth allocation that aims at minimizing the worst call blocking probabilities in the network. The algorithm is proved to be accurate and fast. Finally, we provide comparison curves for the exact optimal CBPs obtained in the case of using OPBM against that of DCLPBM aided by the fast bandwidth evaluation algorithm.

A decentralized estimation system usually contains a number of remotely located local sensors that can pre-process observed signal and convey the processed data to a fusion center that makes a final estimation. The local sensors are linked to the data fusion center by transmission channels. When the observation (or estimate of parameter) is quantized at the peripheral sensors and an assumption of conditionally independent sensor data is made, due to potential communication constraints on the channels, the problem of quantization design and bandwidth allocation among the channels linking local sensors to the fusion center is studied in this letter.

A broadband access network is required for supporting the increased Internet data traffic. One of the most cost-effective solutions is the Ethernet Passive Optical Networks (E-PONs) with the efficient bandwidth assignment function by which the upstream bandwidth can be shared among access users. To satisfy the services with heterogeneous QoS characteristics, it is very important to provide QoS guaranteed network access while utilize the bandwidth efficiently. In this paper, a dual DEB-GPS scheduler in E-PON is presented to provide delay-constraint and lossless QoS guarantee to QoS service and maximize the bandwidth to best-effort service. Simulation results show our scheme outperforms the conventional bandwidth allocation scheme in E-PON system.

A simple nation-wide core network architecture based on the optimized combination of WDM and OTDM technologies in a two-tier structure network is proposed. The dynamic timeslot allocation in a fixed length frame structure associated with the wavelength routing scheme creates a virtual path with variable bandwidth for edge-to-edge transport of any type of packet protocol without O-E-O conversion. The simulation results show that dynamic timeslot assignment with bandwidth reservation is the best alternative for the network bandwidth utilization efficiency. The influence of the delay caused by the physical size of the network during the request-acknowledgement process is also discussed.

The optimization of path bandwidth allocation in large-scale telecommunication networks is studied. By introducing a decomposition-coordination scheme to global optimization of the path bandwidth allocation which aims at minimizing the worst case call blocking probabilities in the network, the spatial and time complexities are both reduced, while the accuracy is almost the same as that given by direct optimization.

Carrying IP traffic over connection-oriented networks requires the use of bandwidth on demand schemes at gateways or network interfaces. A new virtual queue occupancy, which is more accurate than the classical one, is being proposed for IP/SONET bandwidth on demand. Based on the virtual queue occupancy, two enhanced periodic approaches for lossless services, LAVQ and LAVQL, are simulated and evaluated. Simulations show that LAVQ outperforms its counterpart LAQ in terms of bandwidth utilization. By curbing the queue occupancy fluctuation, LAVQL further promotes bandwidth utilization and conceals the influence of the system latency on delay jitter as well.

This paper presents an efficient scheme for access bandwidth control for VBR (Variable Bit Rate) traffic between radio mobile terminals and their base stations in a WATM (Wireless ATM) network. After introducing the wireless ATM system model, we describe a new algorithm that enables dynamic slot allocation under TDMA/TDD (Time Division Multiple Access/Time Division Duplex) Media Access Control, making use of UPC (Usage Parameter Control) parameters and traffic characteristics. We show more efficient bandwidth utilization with our proposed algorithm, compared to other conventional algorithms. Moreover, we reveal that our algorithm improves cell transmission delays.

In leased line services used by ISPs (Internet Service Providers) the bandwidth is fixed, but the traffic changes dynamically. Therefore, there is a necessity for ISPs to accommodate extra capacity to meet peak usage demands; many resources are not used in off-peak hours. To address this, we propose an auction method for the dynamic allocation of bandwidth to ISPs sharing backbone networks. By this method, backbone networks can be used effectively as each ISP is able to secure bandwidth according to its own policy. The Internet users can also be expected to receive good services, as it enables them to obtain information about all ISPs, such as the access fee and QoS (quality of service) provided, and to select congenial ISPs from among all ISPs according to this information. In this study, we compare a dynamic bandwidth allocation service with a leased line service (fixed allocation of bandwidth to ISPs) by using the users' utility to estimate the effectiveness of the proposed method.

Recently, demand on class-of-service (CoS) has known a great increase thanks to a set of real-time applications such as Internet Telephony service. Class-Based Queuing (CBQ) is considered as an efficient queuing mechanism to guarantee CoS. ALTQ is a widely used platform for realizing CBQ. In this paper, we verify through experiments that bandwidth control of CBQ/ALTQ contains overhead for fluctuating traffic. To avoid such an overhead, we introduce dynamic bandwidth allocation scheme for real-time traffic fluctuating within fixed ranges. In the light of the limited network resources, it quickly becomes obvious that when the traffic rate exceeds the maximum available bandwidth, arriving packets will be accumulated in the router queue. As a result, the traffic delay increases and the quality of real-time applications is degraded. To cope with such a problem, we revise the RED algorithm for a large amount of traffic and propose a new packet discard algorithm that uses bandwidth as a trigger. Experiment results show that our proposal outperforms the already existing packet discard algorithms (RED, DropTail) in providing lower delay/jitter services. We show the efficiency of our proposal using a real system.

A method is described that can allocate bandwidth to each user flow fairly in a scalable network architecture such as differentiated services architecture. As promising queueing techniques for providing differentiated services, class-based packet scheduling and selective packet discarding have been attracting attention. However, if we consider that bandwidth should be allocated to each flow in a weighted manner, the parameters used in these methods such as the weight assigned to each class queue should be pre-determined appropriately based on an assumption about the number of flows in each class. Thus, when the actual traffic pattern differs from the assumed one, they may not work well. Instead of assuming the traffic conditions, our method estimates the number of active flows in each class by simple traffic measurement and dynamically changes the weight assigned to each class queue based on the estimated number. Our method does not need to maintain the per-flow state, which gives it scalability. Simulation showed that this method is effective under various patterns of the number of active flows.

The differentiated services (diffserv) architecture has been proposed for implementing scalable service differentiation in the Internet. Expedited forwarding and assured forwarding have been standardized as Per-Hop Behaviors (PHB) in diffserv. Assured forwarding can be utilized to realize the service, which provides each user with a minimum guaranteed rate and a fair share of the residual bandwidth. We call it guaranteed rate (GR) service. With GR service, each packet for flow i is marked in or out based on comparison between the sending rate and the minimum guaranteed rate. When congestion occurs in networks, out packets are dropped more aggressively than in packets. Recently, several fair queuing schemes have been proposed for core stateless networks. They can achieve fairer bandwidth allocation than random early detection (RED). However, there have not been any studies that consider in/out bit usage to support GR service. This paper proposes how to extend the schemes that have been proposed for core stateless networks to allow the support of in/out bit usage. We present the performance of one of the extended schemes and compare the scheme to RED with in/out bit (RIO) in terms of fair bandwidth allocation.

Recently, traffic of real-time communication such as video or IP telephony is increasing in Internet. Low delay and low jitter communication is required to perform these kinds of services smoothly. CoS (Class of Services) scheme which controls traffic by the class unit such as application is currently being paid attention. It is considered to be efficient control mechanism which utilizes characteristics of Internet traffic. One of effective methods for queueing control to realize CoS is CBQ (Class Based Queueing). Efficient and dynamic bandwidth allocation can be realized by using CBQ. However, CBQ mechanism is not necessarily efficient for real-time communication. In this paper, We clarify the effect of dynamic CBQ control scheme on real-time communication by experiment. In addition, we show that low delay and low jitter communication is possible by reducing unnecessary control overhead which is caused by traffic change. We propose new mechanism which changes bandwidth allocation of CBQ dynamically suppressing non real-time traffic and giving priority to real-time traffic on using bandwidth. We also show its efficiency by using real system.

This paper proposes a bandwidth allocation scheme which improves degradation of communication quality due to handoffs in mobile multimedia networks. In general, a multimedia call consists of several component calls. For example, a video phone call consists of a voice call and a video call. In realistic environments, each component call included in one multimedia call may have different requirements for quality-of-service (QoS) from each other, and priorities among these component calls often exist with respect to importance for communications. When the available bandwidth is not enough for a handoff call, the proposed scheme eliminates a low priority component call and defers bandwidth allocation for a component call whose delay related QoS is not strict. Moreover, in the allocation, the scheme gives priority to new calls and handoff calls over a deferred call and also performs bandwidth reallocation to eliminated component calls. By computer simulation, we evaluate the performance such as call dropping probability and show effectiveness of the proposed scheme.

In this paper, we investigate the performance of Fast Reservation Protocols (FRP) for burst-level bandwidth allocation in ATM networks. FRP schemes can be classified into delayed transmission (DT) and immediate transmission (IT) methods according to reservation procedure. Moreover, according to the responsibility for negative acknowledgment (NAK) cell generations when burst blocking occurs, FRP schemes can be further classified into blocking node NAK (BNAK) and destination node NAK (DNAK) schemes. We analize the FRP schemes with different reservation and NAK methods for single node and multihop network models, respectively. We then discuss the dependence of performance for each FRP scheme on propagation delay, peak rate, and the number of hops.

This paper presents a Path Bandwidth Management (PBM) model for large-scale networks that leads to an almost optimal PB allocation, under constraints posed by the installed bandwidth in the transmission links of the network. The PB allocation procedure is driven from a traffic demand matrix and consists of three phases. In the first phase, a suitable decomposition of the whole network takes place, where the large-scale network is split to a set of one-level sub-networks. In the second phase, the optimization algorithm developed for one-level telecommunication networks is applied to each sub-network in order to define the optimal PB allocation. The criterion for optimization is to minimize the worst Call Blocking Probability (CBP) of all switching pairs of the sub-network. In the third phase, composition of the sub-networks takes place in a successive way, which leads to the final PB allocation of the large-scale network. As the large-scale network is built up from optimized sub-networks, an almost optimal PB allocation is anticipated. For evaluation, the worst resultant CBP of the proposed scheme is compared with that obtained by the optimal PB allocation procedure in order to prove its optimality and efficiency. We choose a set of large-scale networks whose size is not very large so that we can apply the optimization algorithm developed for one-level telecom networks for defining its optimal bandwidth allocation. Extensive evaluation of the PBM model has showed that the worst resultant CBP is about 2% above the optimal value, which is a satisfactory result. The proposed PBM scheme is explained by means of an application example.

The Virtual Path (VP) concept in ATM networks simplifies network structure, traffic control and resource management. For VP formulation, a VP can carry traffic of the same type (the separate scheme) or of different types (the unified scheme). For VP adjustment, a certain amount of bandwidth can be dynamically assigned (reserved) to VPs, where the amount (the bandwidth incremental/decremental size) is a predetermined system parameter. In this paper, we study Least Loaded Path-based dynamic routing schemes with various residual bandwidth definitions under different bandwidth allocation (VP formulation and adjustment) schemes. In particular, we evaluate the call blocking probability and VP set-up processing load with varying (bandwidth) incremental sizes. Also, We investigate numerically how the use of VP trades the blocking probability with the processing load. It is found that the unified scheme could outperform the separate scheme in certain incremental sizes. Moreover, we propose two ways to reduce the processing load without increasing the blocking probability. Using these methods, the separate scheme always outperforms the unified scheme.

Even though information in ATM networks is handled as fixed-sized packets (cells), packet-based scheduling is still needed in ATM networks. This letter proposes a packet-based scheduling mechanism that is based on comparison between a packet-based queue and a virtual queue that represents the queue length provided by a cell-based scheduling mechanism. Simulation results showed that this proposed scheduling allocates the bandwidth fairly to each connection.