Dynamic Server Allocation over Time Varying Channels with Switchover Delay

We consider a dynamic server allocation problem over parallel queues with randomly varying connectivity and server switchover delay between the queues. At each time slot the server decides either to stay with the current queue or switch to another queue based on the current connectivity and the queue length information. Switchover delay occurs in many telecommunications applications and is a new modeling component of this problem that has not been previously addressed. We show that the simultaneous presence of randomly varying connectivity and switchover delay changes the system stability region and the structure of optimal policies. In the first part of the paper, we consider a system of two parallel queues, and develop a novel approach to explicitly characterize the stability region of the system using state-action frequencies which are stationary solutions to a Markov Decision Process (MDP) formulation. We then develop a frame-based dynamic control (FBDC) policy, based on the state-action frequencies, and show that it is throughput-optimal asymptotically in the frame length. The FBDC policy is applicable to a broad class of network control systems and provides a new framework for developing throughput-optimal network control policies using state-action frequencies. Furthermore, we develop simple Myopic policies that provably achieve more than 90% of the stability region. In the second part of the paper, we extend our results to systems with an arbitrary but finite number of queues.Comment: 38 Pages, 18 figures. arXiv admin note: substantial text overlap with arXiv:1008.234

Variable frame based Max-Weight algorithms for networks with switchover delay

This paper considers the scheduling problem for networks with interference constraints and switchover delays, where it takes a nonzero time to reconfigure each service schedule. Switchover delay occurs in many telecommunication applications such as satellite, optical or delay tolerant networks (DTNs). Under zero switchover delay it is well known that the Max-Weight algorithm is throughput-optimal without requiring knowledge of the arrival rates. However, we show that this property of Max-Weight no longer holds when there is a nonzero switchover delay. We propose a class of variable frame based Max-Weight (VFMW) algorithms which employ the Max-Weight schedule corresponding to the beginning of the frame during an interval of duration dependent on the queue sizes. The VFMW algorithms dynamically adapt the frame sizes to the stochastic arrivals and provide throughput-optimality without requiring knowledge of the arrival rates. Numerical results regarding the application of the VFMW algorithms to DTN and optical networks demonstrate a good delay performance.National Science Foundation (U.S.) (NSF grant CNS-0626781)National Science Foundation (U.S.) (NSF grant CNS-0915988)United States. Army Research Office (ARO Muri grant number W911NF-08-1-0238

Scheduling algorithms for throughput maximization in time-varying networks with reconfiguration delays

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2012.Cataloged from PDF version of thesis.Includes bibliographical references (p. 247-258).We consider the control of possibly time-varying wireless networks under reconfiguration delays. Reconfiguration delay is the time it takes to switch network resources from one subset of nodes to another and it is a widespread phenomenon observed in many practical systems. Optimal control of networks has been studied to a great extent in the literature, however, the significant effects of reconfiguration delays received limited attention. Moreover, simultaneous presence of time-varying channels and reconfiguration delays has never been considered and we show that it impacts the system fundamentally. We first consider a Delay Tolerant Network model where data messages arriving randomly in time and space are collected by mobile collectors. In this setting reconfiguration delays correspond to travel times of collectors. We utilize a combination of wireless transmission and controlled mobility to improve the system delay scaling with load [rho] from [theta](1/(1-[rho])²) to [theta](1/1-[rho]), where the former is the delay for the corresponding system without wireless transmission. We propose control algorithms that stabilize the system whenever possible and have optimal delay scaling. Next, we consider a general queuing network model under reconfiguration delays and interference constraints which includes wireless, satellite and optical networks as special cases. We characterize the impacts of reconfiguration delays on system stability and delay, and propose scheduling algorithms that persist with service schedules for durations of time based on queue lengths to minimize negative impacts of reconfiguration delays. These algorithms provide throughput-optimality without requiring knowledge of arrival rates since they dynamically adapt inter-switching durations to stochastic arrivals. Finally, we present optimal scheduling under time-varying channels and reconfiguration delays, which is the main contribution of this thesis. We show that under the simultaneous presence of these two phenomenon network stability region shrinks, previously suggested policies are unstable, and new algorithmic approaches are necessary. We propose techniques based on state-action frequencies of Markov Decision Process theory to characterize the network stability region and propose throughput-optimal algorithms. The state-action frequency technique is applicable to a broad class of systems with or without reconfiguration delays, and provides a new framework for characterizing network stability region and developing throughput-optimal scheduling policies.by Güner Dinc̦er C̦elik.Ph.D

A Low-Delay MAC for IoT Applications: Decentralized Optimal Scheduling of Queues without Explicit State Information Sharing

We consider a system of several collocated nodes sharing a time slotted wireless channel, and seek a MAC (medium access control) that (i) provides low mean delay, (ii) has distributed control (i.e., there is no central scheduler), and (iii) does not require explicit exchange of state information or control signals. The design of such MAC protocols must keep in mind the need for contention access at light traffic, and scheduled access in heavy traffic, leading to the long-standing interest in hybrid, adaptive MACs. Working in the discrete time setting, for the distributed MAC design, we consider a practical information structure where each node has local information and some common information obtained from overhearing. In this setting, "ZMAC" is an existing protocol that is hybrid and adaptive. We approach the problem via two steps (1) We show that it is sufficient for the policy to be "greedy" and "exhaustive". Limiting the policy to this class reduces the problem to obtaining a queue switching policy at queue emptiness instants. (2) Formulating the delay optimal scheduling as a POMDP (partially observed Markov decision process), we show that the optimal switching rule is Stochastic Largest Queue (SLQ). Using this theory as the basis, we then develop a practical distributed scheduler, QZMAC, which is also tunable. We implement QZMAC on standard off-the-shelf TelosB motes and also use simulations to compare QZMAC with the full-knowledge centralized scheduler, and with ZMAC. We use our implementation to study the impact of false detection while overhearing the common information, and the efficiency of QZMAC. Our simulation results show that the mean delay with QZMAC is close that of the full-knowledge centralized scheduler.Comment: 28 pages, 19 figure

Optimal Scheduling Policy Determination for High Speed Downlink Packet Access

Abstract — In this paper, we present an analytic model and methodology to determine optimal scheduling policy that involves two dimension space allocation: time and code, in High Speed Downlink Packet Access (HSDPA) system. A discrete stochastic dynamic programming model for the HSDPA downlink scheduler is presented. Value iteration is then used to solve for optimal policy. This framework is used to find the optimal scheduling policy for the case of two users sharing the same cell. Simulation is used to study the performance of the resulted optimal policy using Round Robin (RR) scheduler as a baseline. The policy granularity is introduced to reduce the computational complexity by reducing the action space. The results showed that finer granularity (down to 5 codes) enhances the performance significantly. However, the enhancement gained when using even finer granularity was marginal and does not justify the added complexity. The behaviour of the value function was observed to characterize the optimal scheduling policy. These observations is then used to develop a heuristic scheduling policy. The devised heuristic policy has much less computational complexity which makes it easy to deploy and with only slight reduction in performance compared to the optimal policy according to the simulation results. I

On-board B-ISDN fast packet switching architectures. Phase 2: Development. Proof-of-concept architecture definition report

For the next-generation packet switched communications satellite system with onboard processing and spot-beam operation, a reliable onboard fast packet switch is essential to route packets from different uplink beams to different downlink beams. The rapid emergence of point-to-point services such as video distribution, and the large demand for video conference, distributed data processing, and network management makes the multicast function essential to a fast packet switch (FPS). The satellite's inherent broadcast features gives the satellite network an advantage over the terrestrial network in providing multicast services. This report evaluates alternate multicast FPS architectures for onboard baseband switching applications and selects a candidate for subsequent breadboard development. Architecture evaluation and selection will be based on the study performed in phase 1, 'Onboard B-ISDN Fast Packet Switching Architectures', and other switch architectures which have become commercially available as large scale integration (LSI) devices

Overview of UMTS network evolution through radio and transmission feature validation

This project is based on several UMTS network feature validation with the aim to provide an end-to-end in-depth knowledge overview gained in parallel in the areas of radio network mobility processes (cell camping and inter-system handover), Quality of Service improvement for HSPA data users and transport network evolution towards the All-IP era.Hardware and software validation is a key step in the relationship between the mobile network operator and the vendor. Through this verification process, while executing that functionality or testing a specific hardware, the difference between the actual result and expected result can be better understood and, in turn, this in-depth knowledge acquisition is translated into a tailored usage of the product in the operator’s live network. As a result, validation helps in building a better product as per the customer’s requirement and helps satisfying their needs, which positively impacts in the future evolution of the vendor product roadmap implementation process for a specific customer. This project is based on several Universal Mobile Telecommunication Services (UMTS) network feature validation with the aim to provide an end-to-end in-depth knowledge overview gained in parallel in the areas of radio network mobility processes (cell camping and inter-system handover), Quality of Service improvement for High Speed Downlink Packet Access (HSPA) data users and transport network evolution towards the All-IP era.Las campañas de validación hardware y software son un paso clave en las relaciones comerciales establecidas entre un operador de telecomunicaciones y su proveedor de equipos de red. Durante los procesos de certificación, mientras se ejecuta una funcionalidad software o se valida un determinado hardware, se obtiene un conocimiento profundo de la diferencia entre el resultado obtenido y el esperado, repercutiendo directamente en un uso a medida de dicha funcionalidad o hardware en la propia red del cliente. Como consecuencia de lo anterior, podemos aseverar que los procesos de validación permiten en gran medida al proveedor adaptarse mejor a los requerimientos del cliente, ayudando a satisfacer realmente sus necesidades. Esto implica directamente un impacto positivo en la futura evolución del portfolio que el fabricante ofrece a un determinado cliente. Este proyecto está basado en la validación de diferentes funcionalidades de red UMTS, cuyo objetivo es proporcionar un conocimiento global de distintos aspectos que conforman el funcionamiento de una red de telecomunicaciones 3G, como son los procesos de movilidad de acceso radio (acampado de red y handover inter-sistema), las mejoras en la calidad de servicio para usuarios de datos HSPA y la convergencia de la red de transporte hacia la era IP.Els processos de validació hardware i software són un punt clau en les relacions comercials establertes entre un operador de telecomunicaciones i el proveïdor d'equipament de la xarxa. En el transcurs dels processos de certificació, a la mateixa vegada que s'executa una funcionalitat software o es valida un determinat hardware, s'obtenen grans coneixements respecte la diferència entre el resultat obtingut i l'esperat, que són d'aplicació directa a l'hora d'establir un ús adpatat a la xarxa del client. En conseqüència, podem asseverar que les campanyes de validació permeten en gran mesura al proveïdor adaptar-se millor als requeriments del client, ajudant a satisfer realment les seves necessitats. Això implica directament un impacte positiu en la futura evol.lució del portfoli que el fabricant ofereix a un determinat client. Aquest projecte es basa en la presentació d'un procès de validació de diferents funcionalitats relacionades amb la xarxa UMTS, amb l'objectiu de proporcionar un coneixement global de la varietat d'aspectes que conformen el funcionament d'una xarxa de telecomunicacions 3G, com són els processos de mobilitat en accès radio (acampat de l'usuari i handover inter-sistema), millores en la qualitat de servei per a usuaris de dades HSPA i la convergència de la xarxa de transport cap a l'era IP

Information Switching Processor (ISP) contention analysis and control

Future satellite communications, as a viable means of communications and an alternative to terrestrial networks, demand flexibility and low end-user cost. On-board switching/processing satellites potentially provide these features, allowing flexible interconnection among multiple spot beams, direct to the user communications services using very small aperture terminals (VSAT's), independent uplink and downlink access/transmission system designs optimized to user's traffic requirements, efficient TDM downlink transmission, and better link performance. A flexible switching system on the satellite in conjunction with low-cost user terminals will likely benefit future satellite network users

Self-organized backpressure routing for the wireless mesh backhaul of small cells

The ever increasing demand for wireless data services has given a starring role to dense small cell (SC) deployments for mobile networks, as increasing frequency re-use by reducing cell size has historically been the most effective and simple way to increase capacity. Such densification entails challenges at the Transport Network Layer (TNL), which carries packets throughout the network, since hard-wired deployments of small cells prove to be cost-unfeasible and inflexible in some scenarios. The goal of this thesis is, precisely, to provide cost-effective and dynamic solutions for the TNL that drastically improve the performance of dense and semi-planned SC deployments. One approach to decrease costs and augment the dynamicity at the TNL is the creation of a wireless mesh backhaul amongst SCs to carry control and data plane traffic towards/from the core network. Unfortunately, these lowcost SC deployments preclude the use of current TNL routing approaches such as Multiprotocol Label Switching Traffic Profile (MPLS-TP), which was originally designed for hard-wired SC deployments. In particular, one of the main problems is that these schemes are unable to provide an even network resource consumption, which in wireless environments can lead to a substantial degradation of key network performance metrics for Mobile Network Operators. The equivalent of distributing load across resources in SC deployments is making better use of available paths, and so exploiting the capacity offered by the wireless mesh backhaul formed amongst SCs. To tackle such uneven consumption of network resources, this thesis presents the design, implementation, and extensive evaluation of a self-organized backpressure routing protocol explicitly designed for the wireless mesh backhaul formed amongst the wireless links of SCs. Whilst backpressure routing in theory promises throughput optimality, its implementation complexity introduces several concerns, such as scalability, large end-to-end latencies, and centralization of all the network state. To address these issues, we present a throughput suboptimal yet scalable, decentralized, low-overhead, and low-complexity backpressure routing scheme. More specifically, the contributions in this thesis can be summarized as follows: We formulate the routing problem for the wireless mesh backhaul from a stochastic network optimization perspective, and solve the network optimization problem using the Lyapunov-driftplus-penalty method. The Lyapunov drift refers to the difference of queue backlogs in the network between different time instants, whereas the penalty refers to the routing cost incurred by some network utility parameter to optimize. In our case, this parameter is based on minimizing the length of the path taken by packets to reach their intended destination. Rather than building routing tables, we leverage geolocation information as a key component to complement the minimization of the Lyapunov drift in a decentralized way. In fact, we observed that the combination of both components helps to mitigate backpressure limitations (e.g., scalability,centralization, and large end-to-end latencies). The drift-plus-penalty method uses a tunable optimization parameter that weight the relative importance of queue drift and routing cost. We find evidence that, in fact, this optimization parameter impacts the overall network performance. In light of this observation, we propose a self-organized controller based on locally available information and in the current packet being routed to tune such an optimization parameter under dynamic traffic demands. Thus, the goal of this heuristically built controller is to maintain the best trade-off between the Lyapunov drift and the penalty function to take into account the dynamic nature of semi-planned SC deployments. We propose low complexity heuristics to address problems that appear under different wireless mesh backhaul scenarios and conditions..

Ku-band signal design study

Analytical tools, methods and techniques for assessing the design and performance of the space shuttle orbiter data processing system (DPS) are provided. The computer data processing network is evaluated in the key areas of queueing behavior synchronization and network reliability. The structure of the data processing network is described as well as the system operation principles and the network configuration. The characteristics of the computer systems are indicated. System reliability measures are defined and studied. System and network invulnerability measures are computed. Communication path and network failure analysis techniques are included