Dynamic bandwidth management with service differentiation over ethernet passive optical networks

Ethernet passive optical networks (EPONs) address the first mile of the communication infrastructure between the service provider central offices and the customer sites. As a low-cost, high speed technology, EPONs are deemed as the solution to the bottleneck problem of the broadband access network. A major feature of EPONs is the utility of a shared upstream channel among the end users. Only a single optical network unit (GNU) may transmit during a timeslot to avoid data collisions. In order to provide diverse quality of service (QoS), the bandwidth management of the upstream channel is essential for the successful implementation of EPONs, and thus, an efficient medium access control is required to facilitate statistical multiplexing among local traffics. This dissertation addresses the upstream bandwidth allocation over EPONs. An efficient mechanism, i.e., limited sharing with traffic prediction (LSTP), has been proposed to arbitrate the upstream bandwidth among ONUs. The MultiPoint Control Protocol (MPCP) messages, which are stipulated by the IEEE 802.3ah Ethernet in the First Mile (EFM) Task Force, are adopted by LSTP to facilitate the dynamic bandwidth negotiation between an GNU and the OLT. The bandwidth requirement of an ONU includes the already enqueued frames and the predicted incoming frames during the waiting time. The OLT arbitrates the bandwidth assignment based on the queue status report from an GNU, the traffic prediction, and the agreed service contract. With respect to the performance evaluation, theoretical analysis on the frame loss, the frame delay, and the queue length has been conducted. The quantitative results demonstrate that 1) the innovative LSTP mechanism dynamically allocates the upstream bandwidth among multiple ONUs; 2) the traffic predictor at the OLT delivers satisfactory prediction for the bursty self-similar traffic, and thereby, contributing to the reduction of frame loss, frame delay, and queue length; and 3) the bandwidth arbitration at the OLT effectively restricts the aggressive bandwidth competition among ONUs by adopting the service level agreement (SLA) parameter as the upper bound. Aside from analysis, the LSTP mechanism has been substantiated by experimental simulations. In order to differentiate the service provisioning among diverse users, LSTP is further enhanced with the support of dynamic bandwidth negotiation based on multiple queues. The incoming traffics are first classified into three classes, and then enqueued into the corresponding queues. A traffic predictor is dedicated to one class of traffic from an GNU. Service differentiation among classes are provided by the combination of queuing and scheduling at the GNU side. At the OLT side, the bandwidth allocation for each class of traffic is based on the reported queue status and the traffic prediction, and is upper-bounded by the SLA parameter. Experimental simulations have justified the feasibility of providing service differentiation over the broadband EPONs

Quality-of-service provisioning in high speed networks : routing perspectives

The continuous growth in both commercial and public network traffic with various quality-of-service (QoS) requirements is calling for better service than the current Internet\u27s best effort mechanism. One of the challenging issues is to select feasible paths that satisfy the different requirements of various applications. This problem is known as QoS routing. In general, two issues are related to QoS routing: state distribution and routing strategy. Routing strategy is used to find a feasible path that meets the QoS requirements. State distribution addresses the issue of exchanging the state information throughout the network, and can be further divided into two sub-problems: when to update and how to disseminate the state information. In this dissertation, the issue of when to update link state information from the perspective of information theory is addressed. Based on the rate-distortion analysis, an efficient scheme, which outperforms the state of the art in terms of both protocol overhead and accuracy of link state information, is presented. Second, a reliable scheme is proposed so that, when a link is broken, link state information is still reachable to all network nodes as long as the network is connected. Meanwhile, the protocol overhead is low enough to be implemented in real networks. Third, QoS routing is NP-complete. Hence, tackling this problem requires heuristics. A common approach is to convert this problem into a shortest path or k-shortest path problem and solve it by using existing algorithms such as Bellman-Ford and Dijkstra algorithms. However, this approach suffers from either high computational complexity or low success ratio in finding the feasible paths. Hence, a new problem, All Hops k-shortest Path (AHKP), is introduced and investigated. Based on the solution to AHKP, an efficient self-adaptive routing algorithm is presented, which can guarantee in finding feasible paths with fairly low average computational complexity. One of its most distinguished properties is its progressive property, which is very useful in practice: it can self-adaptively minimize its computational complexity without sacrificing its performance. In addition, routing without considering the staleness of link state information may generate a significant percentage of false routing. Our proposed routing algorithm is capable of minimizing the impact of stale link state information without stochastic link state knowledge. Fourth, the computational complexities of existing s-approximation algorithms are linearly proportional to the adopted linear scaling factors. Therefore, two efficient algorithms are proposed for finding the optimal (the smallest) linear scaling factor such that the computational complexities are reduced. Finally, an efficient algorithm is proposed for finding the least hop(s) multiple additive constrained path for the purpose of saving network resources