On delay stable communications in asynchronous networks

This dissertation defines a frame forwarding technique offering a fixed delay to a subclass of traffic in closed industrial control networks. In these networks bandwidth is dedicated to periodic traffic supporting tight inter-process control and control loop communication. Ideally periodic traffic arrival will have minimal delay-jitter with constant realized delays. This simplifies the implementation of connected control devices. Furthermore networks are simplified with asynchronous node and switch operation. Switch designs are simplified as there is no dependence on adjacent switch clock operation. Correct network function only relies on switches directly traversed by each flow and is not dependent on complex clock synchronization mechanisms. Existing packet scheduling schemes that attempt to minimize delay-jitter, suffer from either requiring inter-switch clock coordination (i.e. RCSP-DJ), or maintain a fixed priority so that the highest priority flows must contend without regard to past frame arrival treatment (i.e. RCSP-RJ). In this dissertation the FlexTDMA protocol is defined which supports closed network communication. FlexTDMA will be enhanced to accommodate real-world networking conditions (FlexTDMA+) and will be enhanced to support simultaneous multicast (FlexTDMA++). The FlexTDMA scheduling algorithm delivers frame data on each flow nearly at the maximal delay bound with minimal delay-jitter in an asynchronous network. Industrial control switching network systems will benefit from FlexTDMA when the complexity of system level synchronization is unacceptable, but the component switches must operate independently. FlexTDMA does not require synchronous network clock coordination and preserves the data content of frames. FlexTDMA+ includes three improvements: baseline preemption, partial baselining and baseline deadline density control, which are used to support real-world conditions of node periodic on-off transmission, clock drift, frame loss and bandwidth load. FlexTDMA++ supports simultaneous multicast under real-world conditions of switch failures, node periodic on-off transmission, clock drift, frame loss and bandwidth load

Opportunistic cooperation in wireless networks

Ph.DDOCTOR OF PHILOSOPH

Scheduling for Proportional Differentiated Services on the Internet

Proportional Differentiated Services can be provisioned in terms of bandwidth, delay, or packet loss. Several studies contributed schedulers and packet droppers that achieved proportional bandwidth, delay, or loss differentiation. However, all these schemes differentiated in terms of only one of the three metrics. A simple, unified, scalable, and robust scheme to simultaneously control all three metrics was felt important. By controlling just delay and packet loss, proportional differentiation can be achieved in terms of all three metrics. A robust adaptive scheduler for proportional delay differentiation services is presented. Proportional services are further policed by a class based packet dropper. The combination of the adaptive scheduler and the packet dropper treats different traffic classes proportionally in terms of all three metrics. Simulation experiments show that regardless of the network traffic characteristics, our scheme can effectively differentiate services in terms of bandwidth, delay, and loss simultaneously

Adaptive scheduling in cellular access, wireless mesh and IP networks

Networking scenarios in the future will be complex and will include fixed networks and hybrid Fourth Generation (4G) networks, consisting of both infrastructure-based and infrastructureless, wireless parts. In such scenarios, adaptive provisioning and management of network resources becomes of critical importance. Adaptive mechanisms are desirable since they enable a self-configurable network that is able to adjust itself to varying traffic and channel conditions. The operation of adaptive mechanisms is heavily based on measurements. The aim of this thesis is to investigate how measurement based, adaptive packet scheduling algorithms can be utilized in different networking environments. The first part of this thesis is a proposal for a new delay-based scheduling algorithm, known as Delay-Bounded Hybrid Proportional Delay (DBHPD), for delay adaptive provisioning in DiffServ-based fixed IP networks. This DBHPD algorithm is thoroughly evaluated by ns2-simulations and measurements in a FreeBSD prototype router network. It is shown that DBHPD results in considerably more controllable differentiation than basic static bandwidth sharing algorithms. The prototype router measurements also prove that a DBHPD algorithm can be easily implemented in practice, causing less processing overheads than a well known CBQ algorithm. The second part of this thesis discusses specific scheduling requirements set by hybrid 4G networking scenarios. Firstly, methods for joint scheduling and transmit beamforming in 3.9G or 4G networks are described and quantitatively analyzed using statistical methods. The analysis reveals that the combined gain of channel-adaptive scheduling and transmit beamforming is substantial and that an On-off strategy can achieve the performance of an ideal Max SNR strategy if the feedback threshold is optimized. Finally, a novel cross-layer energy-adaptive scheduling and queue management framework EAED (Energy Aware Early Detection), for preserving delay bounds and minimizing energy consumption in WLAN mesh networks, is proposed and evaluated with simulations. The simulations show that our scheme can save considerable amounts of transmission energy without violating application level QoS requirements when traffic load and distances are reasonable

Delay analysis for wireless applications using a multiservice multiqueue processor sharing model

The ongoing development of wireless networks supporting multimedia applications requires service providers to efficiently deliver complex Quality of Service (QoS) requirements. The wide range of new applications in these networks significantly increases the difficulty of network design and dimensioning to meet QoS requirements. Medium Access Control (MAC) protocols affect QoS achieved by wireless networks. Research on analysis and performance evaluation is important for the efficient protocol design. As wireless networks feature scarce resources that are simultaneously shared by all users, processor sharing (PS) models were proposed for modelling resource sharing mechanisms in such systems. In this thesis, multi-priority MAC protocols are proposed for handling the various service traffic types. Then, an investigation of multiservice multiqueue PS models is undertaken to analyse the delay for some recently proposed wireless applications. We start with an introduction to MAC protocols for wireless networks which are specified in IEEE standards and then review scheduling algorithms which were proposed to work with the underlying MAC protocols to cooperatively achieve QoS goals. An overview of the relevant literature is given on PS models for performance analysis and evaluation of scheduling algorithms. We propose a multiservice multiqueue PS model using a scheduling scheme in multimedia wireless networks with a comprehensive description of the analytical solution. Firstly, we describe the existing multiqueue processor sharing (MPS) model, which uses a fixed service quantum at each queue, and correct a subtle incongruity in previous solutions presented in the literature. Secondly, a new scheduling framework is proposed to extend the previous MPS model to a general case. This newly proposed analytical approach is based on the idea that the service quantum arranged by a MAC scheduling controller to service data units can be priority-based. We obtain a closed-form expression for the mean delay of each service class in this model. In summary, our new approach simplifies MAC protocols for multimedia applications into an analytical model that includes more complex and realistic traffic models without compromising details of the protocol and significantly reduces the number of MAC headers, thus the overall average delay will be decreased. In response to using the studied multiservice multiqueue PS models, we apply the MPS model to two wireless applications: Push to Talk (PTT) service over GPRS/GSM networks and the Worldwide Interoperability for Microwave Access (WiMAX) networks. We investigate the uplink delay of PTT over traditional GPRS/GSM networks and the uplink delay for WiMAX Subscriber Station scheduler under a priority-based fair scheduling. MAC structures capable of supporting dynamically varying traffic are studied for the networks, especially, with the consideration of implementation issues. The model provides useful insights into the dynamic performance behaviours of GPRS/GSM and WiMAX networks with respect to various system parameters and comprehensive traffic conditions. We then evaluate the model under some different practical traffic scenarios. Through modelling of the operation of wireless access systems, under a variety of multimedia traffic, our analytical approaches provide practical analysis guidelines for wireless network dimensioning

Design and Development of a Framework for Traffic Management in a Global Manufacturing Enterprise: The American Standard Case Study

Managed Bandwidth Services (MBSs) use Quality of Service (QoS) guarantees to effectively control traffic flows and reduce network delay. In the past, the provision of MBS in a global manufacturing enterprise was a difficult task for network administrators. However, advances in recently emerging technologies, such as Multiprotocol Label Switching (MPLS), Generalized Multiprotocol Label Switching (GMPLS), Integrated Services (IntServ), Differentiated Services (DiffServ), and Constraint-based Routing (CBR), hold promise to make MBS implementation more manageable. QoS technologies, such as DiffServ and IntServ, offer the benefits of better application performance and delivery of reliable network service. As a consequence of network traffic loads, packet congestion and latency increases still exist and must be addressed by enterprises that intend to support an MBS solution. In this investigation, the author addressed an issue that is faced by many large manufacturing enterprises, i.e., the addition of latency and congestion sensitive traffic such as Voice-over-Internet Protocol (VoIP) to networks with limited bandwidth. The goal of this research was to provide global manufacturing enterprises with a model for bandwidth management in their offices and plants. This model was based on findings from a case study of traffic management at American Standard Companies

Resource Allocation in Relay-based Satellite and Wireless Communication Networks

A two-level bandwidth allocation scheme is proposed for a slotted Time-Division Multiple Access high data rate relay satellite communication link to provide efficient and fair channel utilization. The long-term allocation is implemented to provide per-flow/per-user Quality-of-Service guarantees and shape the average behavior. The time-varying short-term allocation is determined by solving an optimal timeslot scheduling problem based on the requests and other parameters. Through extensive simulations, the performance of a suitable MAC protocol with two-level bandwidth allocation is analyzed and compared with that of the existing static fixed-assignment scheme in terms of end-to-end delay and successful throughput. It is also shown that pseudo-proportional fairness is achieved for our hybrid protocol. We study rate control systems with heterogeneous time-varying propagation delays, based on analytic fluid flow models composed of first-order delay-differential equations. Both single-flow and multi-flow system models are analyzed, with special attention paid to the Mitra-Seery algorithm. The stationary solutions are investigated. For the fluctuating solutions, their dynamic behavior is analyzed in detail, analytically and numerically, in terms of amplitude, transient behavior, fairness and adaptability, etc.. Especially the effects of heterogeneous time-varying delays are investigated. It is shown that with proper parameter design the system can achieve stable behavior with close to pointwise proportional fairness among flows. Finally we investigate the resource allocation in 802.16j multi-hop relay systems with rate fairness constraints for two mutually exclusive options: transparent and non-transparent relay systems (T-RS and NT-RS). Single-Input Single-Output and Multi-Input Multi-Output antenna systems are considered in the links between the Base Station (BS) and Relay Stations (RS). 1 and 3 RSs per sector are considered. The Mobile Station (MS) association rule, which determines the access station (BS or RS) for each MS, is also studied. Two rules: Highest MCS scheme with the highest modulation and coding rate, and Highest (Mod) ESE scheme with the highest (modified) effective spectrum efficiency, are studied along with the optimal rule that maximizes system capacity with rate fairness constraints. Our simulation results show that the highest capacity is always achieved by NT-RS with 3 RSs per sector in distributed scheduling mode, and that the Highest (Mod) ESE scheme performs closely to the optimal rule in terms of system capacity