A Survey on Delay-Aware Resource Control for Wireless Systems --- Large Deviation Theory, Stochastic Lyapunov Drift and Distributed Stochastic Learning

In this tutorial paper, a comprehensive survey is given on several major systematic approaches in dealing with delay-aware control problems, namely the equivalent rate constraint approach, the Lyapunov stability drift approach and the approximate Markov Decision Process (MDP) approach using stochastic learning. These approaches essentially embrace most of the existing literature regarding delay-aware resource control in wireless systems. They have their relative pros and cons in terms of performance, complexity and implementation issues. For each of the approaches, the problem setup, the general solution and the design methodology are discussed. Applications of these approaches to delay-aware resource allocation are illustrated with examples in single-hop wireless networks. Furthermore, recent results regarding delay-aware multi-hop routing designs in general multi-hop networks are elaborated. Finally, the delay performance of the various approaches are compared through simulations using an example of the uplink OFDMA systems.Comment: 58 pages, 8 figures; IEEE Transactions on Information Theory, 201

Reduction of bandwidth requirement by traffic dispersion in ATM networks

The problem of bandwidth allocation and routing in Virtual Path (VP) based Asynchronous Transfer Mode (ATM) networks was studied. As an efficient way to facilitate the network management, VP concept has been proposed in the literature. Traffic control and resource management are simplified in VP based networks. However, a priori reservation of resources for VP\u27s also reduces the statistical multiplexing gain, resulting in increased Call Blocking Probability (CBP);The focus of this study is on how to reduce CBP (or equivalently, how to improve the bandwidth utilization for a given CBP requirement) by the effective bandwidth allocation and routing algorithms. Equivalent capacity concept was used to calculate the required bandwidth by the call. Each call was represented as a bursty and heterogeneous multimedia traffic;First, the effect of traffic dispersion was explored to achieve more statistical gain. Through this study, it was discovered how the effect of traffic dispersion varies with different traffic characteristics and the number of paths. An efficient routing algorithm, CED, was designed. Since traffic dispersion requires resequencing and extra signaling to set up multiple VC\u27s, it should be used only when it gives significant benefits. This was the basic idea in our design of CED. The algorithm finds an optimal dispersion factor for a call, where the gain balances the dispersion cost. Simulation study showed that the CBP can be significantly reduced by CED;Next, this study provides analysis of the statistical behavior of the traffic seen by individual VP, as a result of traffic dispersion. This analysis is essential in estimating the required capacity of a VP accurately when both multimedia traffic and traffic dispersion are taken into account. Then analytical models have been formulated. The cost effective design and engineering of VP networks requires accurate and tractable mathematical models which capture the important statistical properties of traffic. This study also revealed that the load distribution estimated by equivalent capacity follows Gaussian distribution which is the sum of two jointly Gaussian random variables. For the analysis of load distribution when CED is used, we simplified multiple paths as identical paths using the idea of Approximation by Single Abstract Path (ASAP), and approximated the characteristics of the traffic seen by individual VP. The developed analytical models and approximations were validated in the sense that they agreed with simulation results

Saturation routing for asynchronous transfer mode (ATM) networks

The main objective of this thesis is to show that saturation routing, often in the past considered inefficient, can in fact be a viable approach to use in many important applications and services over an Asynchronous Transfer Mode (ATM) network. For other applications and services, a hybrid approach (one that partially uses saturation routing) is presented. First, the minimum effects of saturation routing are demonstrated by showing that the ratio, defined as f, of routing overhead cells over information cells is small even for large networks. Second, modeling and simulation and M/D/l queuing analysis techniques are used to show that the overall effect on performance when using saturation routing is not significant over ATM networks. Then saturation routing ATM implementation is also provided, with important extensions to services such as multicast routing. After an analytical comparison, in terms of routing overhead, is made between Saturation Routing and the currently proposed Private Network-Network Interface (PNNI) procedure for ATM routing made by the ATM forum. This comparison is made for networks of different sizes (343node and 2401 -node networks) and different number of hierarchical levels (3 and 4 levels of hierarchy). The results show that the higher the number of levels of hierarchy and the farthest (in terms of hierarchical levels) the source and the destination nodes are from each other, the more advantageous saturation routing becomes. Finally, a set of measures of performance for use by saturation routing (or any routing algorithm), as metrics for routing path selection, is proposed. Among these measures, an innovative new measure of performance derived for measuring quality of service provided to Constant Bit Rate (CBR) users (e.g., such as voice and video users) called the Burst Voice Arrival Lag (BVAL) is described and derived

Resource allocation and performance analysis problems in optical networks

Optical networks pose a rich variety of new design and performance analysis problems. Typically, the static design problems belong to the field of combinatorial optimisation, whereas decision-making and performance analysis problems are best treated using appropriate stochastic models. This dissertation focuses on certain issues in resource allocation and performance evaluation of backbone wavelength-routed (WR) networks and metropolitan area optical burst switching (OBS) networks. The first two parts of the thesis consider heuristic algorithms for the static routing and wavelength assignment (RWA) and logical topology design (LTD) problems that arise in the context of WR networks. In a static RWA problem, one is asked to establish a given set of lightpaths (or light trees) in an optical WR network with given constraints, where the objective often is to minimise the number of wavelength channels required. In LTD problem, the number of wavelength channels is given and one is asked to decide on the set of lightpaths so that, for instance, the mean sojourn time of packets travelling at the logical layer is minimised. In the thesis, several heuristic algorithms for both the RWA and LTD problems are described and numerical results are presented. The third part of the thesis studies the dynamic control problem where connection requests, i.e. lightpath requests, arrive according to a certain traffic pattern and the task is to establish one lightpath at a time in the WR optical network so that the expected revenue is maximised or the expected cost is minimised. Typically, the goal of optimisation is to minimise some infinite time horizon cost function, such as the blocking probability. In this thesis, the dynamic RWA problem is studied in the framework of Markov decision processes (MDP). An algorithmic approach is proposed by which any given heuristic algorithm can be improved by applying the so-called first policy iteration (FPI) step of the MDP theory. Relative costs of states needed in FPI are estimated by on-the-fly simulations. The computational burden of the approach is alleviated by introducing the importance sampling (IS) technique with FPI, for which an adaptive algorithm is proposed for adjusting the optimal IS parameters at the same time as data are collected for the decision-making analysis. The last part of the thesis considers OBS networks, which represent an intermediate step towards full optical packet switching networks. In OBS networks, the data are transferred using optical bursts consisting of several IP packets going to the same destination. On the route of the burst, temporary reservations are made only for the time during which the burst is transmitted. This thesis focuses on fairness issues in OBS networks. It is demonstrated that fairness can be improved by using fibre delay lines together with Just-Enough-Time protocol (JET). Furthermore, by choosing the routes in an appropriate way one can also reach a satisfactory level of fairness and, at the same time, lower the overall blocking probability. Possible scheduling policies for metropolitan area OBS ring networks are also studied.reviewe

Call admission and routing in telecommunication networks.

by Kit-man Chan.Thesis (M.Phil.)--Chinese University of Hong Kong, 1994.Includes bibliographical references (leaves 82-86).Chapter 1 --- Introduction --- p.1Chapter 1.1 --- Overview of Integrated Service Digital Networks --- p.1Chapter 1.2 --- Multirate Loss Networks --- p.5Chapter 1.3 --- Previous Work --- p.7Chapter 1.4 --- Organization --- p.11Chapter 1.5 --- Publications --- p.12Chapter 2 --- Call Admission in Multirate Loss Networks --- p.13Chapter 2.1 --- Introduction --- p.13Chapter 2.2 --- Two Adaptive Routing Rules --- p.15Chapter 2.3 --- Call Admission Policies --- p.17Chapter 2.4 --- Analysis of Call Admission Policies --- p.25Chapter 2.4.1 --- "The CS, LO, GB and the EB Policies" --- p.25Chapter 2.4.2 --- The DP Policy --- p.29Chapter 2.5 --- Performance Comparisons --- p.32Chapter 2.6 --- Concluding Remarks --- p.35Chapter 3 --- Least Congestion Routing in Multirate Loss Networks --- p.41Chapter 3.1 --- Introduction --- p.41Chapter 3.2 --- The M2 and MTB Routings --- p.42Chapter 3.2.1 --- M2 Routing --- p.43Chapter 3.2.2 --- MTB Routing --- p.43Chapter 3.3 --- Bandwidth Sharing Policies and State Aggregation --- p.45Chapter 3.4 --- Analysis of M2 Routing --- p.47Chapter 3.5 --- Analysis of MTB Routing --- p.50Chapter 3.6 --- Numerical Results and Discussions --- p.53Chapter 3.7 --- Concluding Remarks --- p.56Chapter 4 --- The Least Congestion Routing in WDM Lightwave Networks --- p.60Chapter 4.1 --- Introduction --- p.60Chapter 4.2 --- Architecture and Some Design Issues --- p.62Chapter 4.3 --- The Routing Rule --- p.66Chapter 4.4 --- Analysis of the LC Routing Rule --- p.67Chapter 4.4.1 --- Fixed Point Model --- p.67Chapter 4.4.2 --- Without Direct-link Priority --- p.68Chapter 4.4.3 --- With Direct-link Priority --- p.72Chapter 4.5 --- Performance Comparisons --- p.73Chapter 4.6 --- Concluding Remarks --- p.75Chapter 5 --- Conclusions and Future Work --- p.79Chapter 5.1 --- Future Work --- p.8

Dtn and non-dtn routing protocols for inter-cubesat communications: A comprehensive survey

CubeSats, which are limited by size and mass, have limited functionality. These miniaturised satellites suffer from a low power budget, short radio range, low transmission speeds, and limited data storage capacity. Regardless of these limitations, CubeSats have been deployed to carry out many research missions, such as gravity mapping and the tracking of forest fires. One method of increasing their functionality and reducing their limitations is to form CubeSat networks, or swarms, where many CubeSats work together to carry out a mission. Nevertheless, the network might have intermittent connectivity and, accordingly, data communication becomes challenging in such a disjointed network where there is no contemporaneous path between source and destination due to satellites’ mobility pattern and given the limitations of range. In this survey, various inter-satellite routing protocols that are Delay Tolerant (DTN) and Non Delay Tolerant (Non-DTN) are considered. DTN routing protocols are considered for the scenarios where the network is disjointed with no contemporaneous path between a source and a destination. We qualitatively compare all of the above routing protocols to highlight the positive and negative points under different network constraints. We conclude that the performance of routing protocols used in aerospace communications is highly dependent on the evolving topology of the network over time. Additionally, the Non-DTN routing protocols will work efficiently if the network is dense enough to establish reliable links between CubeSats. Emphasis is also given to network capacity in terms of how buffer, energy, bandwidth, and contact duration influence the performance of DTN routing protocols, where, for example, flooding-based DTN protocols can provide superior performance in terms of maximizing delivery ratio and minimizing a delivery delay. However, such protocols are not suitable for CubeSat networks, as they harvest the limited resources of these tiny satellites and they are contrasted with forwarding-based DTN routing protocols, which are resource-friendly and produce minimum overheads on the cost of degraded delivery probability. From the literature, we found that quota-based DTN routing protocols can provide the necessary balance between delivery delay and overhead costs in many CubeSat missions

A Scalable Virtual Circuit Routing Scheme for ATM Networks

High-speed networks, such as ATM networks, are expected to support diverse quality-of-service (QoS) requirements, including real-time QoS. Real-time QoS is required by many applications such as voice and video. To support such service, routing protocols based on the Virtual Circuit (VC) model have been proposed. However, these protocols do not scale well to large networks in terms of storage and communication overhead. In this paper, we present a scalable VC routing protocol. It is based on the recently proposed viewserver hierarchy, where each viewserver maintains a partial view of the network. By querying these viewservers, a source can obtain a merged view that contains a path to the destination. The source then sends a request packet over this path to setup a real-time VC through resource reservations. The request is blocked if the setup fails. We compare our protocol to a simple approach using simulation. Under this simple approach, a source maintains a full view of the network. In addition to the savings in storage, our results indicate that our protocol performs close to or better than the simple approach in terms of VC carried load and blocking probability over a wide range of real-time workload. (Also cross-referenced as UMIACS-TR-94-115

Mobile Networks

The growth in the use of mobile networks has come mainly with the third generation systems and voice traffic. With the current third generation and the arrival of the 4G, the number of mobile users in the world will exceed the number of landlines users. Audio and video streaming have had a significant increase, parallel to the requirements of bandwidth and quality of service demanded by those applications. Mobile networks require that the applications and protocols that have worked successfully in fixed networks can be used with the same level of quality in mobile scenarios. Until the third generation of mobile networks, the need to ensure reliable handovers was still an important issue. On the eve of a new generation of access networks (4G) and increased connectivity between networks of different characteristics commonly called hybrid (satellite, ad-hoc, sensors, wired, WIMAX, LAN, etc.), it is necessary to transfer mechanisms of mobility to future generations of networks. In order to achieve this, it is essential to carry out a comprehensive evaluation of the performance of current protocols and the diverse topologies to suit the new mobility conditions