10 research outputs found
Constrained Network Slicing Games: Achieving service guarantees and network efficiency
Network slicing is a key capability for next generation mobile networks. It
enables one to cost effectively customize logical networks over a shared
infrastructure. A critical component of network slicing is resource allocation,
which needs to ensure that slices receive the resources needed to support their
mobiles/services while optimizing network efficiency. In this paper, we propose
a novel approach to slice-based resource allocation named Guaranteed seRvice
Efficient nETwork slicing (GREET). The underlying concept is to set up a
constrained resource allocation game, where (i) slices unilaterally optimize
their allocations to best meet their (dynamic) customer loads, while (ii)
constraints are imposed to guarantee that, if they wish so, slices receive a
pre-agreed share of the network resources. The resulting game is a variation of
the well-known Fisher market, where slices are provided a budget to contend for
network resources (as in a traditional Fisher market), but (unlike a Fisher
market) prices are constrained for some resources to provide the desired
guarantees. In this way, GREET combines the advantages of a share-based
approach (high efficiency by flexible sharing) and reservation-based ones
(which provide guarantees by assigning a fixed amount of resources). We
characterize the Nash equilibrium, best response dynamics, and propose a
practical slice strategy with provable convergence properties. Extensive
simulations exhibit substantial improvements over network slicing
state-of-the-art benchmarks
Adding edge dynamics to wireless random-access networks
We consider random-access networks with nodes representing
transmitter-receiver pairs whose signals interfere with each other depending on
their vicinity. Data packets arrive at the nodes over time and form queues. The
nodes can be either active or inactive: a node deactivates at unit rate, while
it activates at a rate that depends on its queue length, provided none of its
neighbors is active. In order to model the effects of user mobility in wireless
networks, we analyze dynamic interference graphs where the edges are allowed to
appear and disappear over time. We focus on bipartite graphs, and study the
transition time between the two states where one part of the network is active
and the other part is inactive, in the limit as the queue lengths become large.
Depending on the speed of the dynamics, we are able to obtain a rough
classification of the effects of the dynamics on the transition time.Comment: 31 pages, 1 figur
Mobility-aware Scheduler in CoMP Systems
International audienceThe main weakness of coordination techniques in LTE-Advanced networks is the extra resource consumption incurred by the joint transmission from several base stations. In this paper, we propose a new scheduling policy that performs coordination primarily for users staying at the cell edge, without mobility. Other cell-edge users are likely to move and to be served in better radio conditions where cell coordination is not required. We compare the performance of this algorithm to other usual scheduling policies in the presence of elastic traffic through the analysis of flow-level traffic models
Mobility can drastically improve the heavy traffic performance from 1/(1-rho) to log(1/(1-rho))
We study a model of wireless networks where users move at speed θ ≥ 0, which has the original feature of being defined through a fixed-point equation. Namely, we start from a two-class processor-sharing queue to model one representative cell of this network: class 1 users are patient (non-moving) and class 2 users are impatient (moving). This model has five parameters, and we study the case where one of these parameters is set as a function of the other four through a fixed-point equation. This fixed-point equation captures the fact that the considered cell is in balance with the rest of the network. This modeling approach allows us to alleviate some drawbacks of earlier models of mobile networks. Our main and surprising finding is that for this model, mobility drastically improves the heavy traffic behavior, going from the usual
1 scaling without mobility (i.e., when θ = 0) to a logarithmic scaling log(1/(1−ρ)) 1−ρ
as soon as θ > 0. In the high load regime, this confirms that the performance of mobile systems benefits from the spatial mobility of users. Finally, other model extensions and complementary methodological approaches to this heavy traffic analysis are discussed
Recommended from our members
Resource Allocation for the Internet of Everything: From Energy Harvesting Tags to Cellular Networks
In the near future, objects equipped with heterogeneous devices such as sensors, actuators, and tags, will be able to interact with each other and cooperate to achieve common goals. These networks are termed the Internet of Things (IoT) and have applications in healthcare, smart buildings, assisted living, manufacturing, supply chain management, and intelligent transportation. The IoT vision is enabled by ubiquitous wireless communications and there are numerous resource allocation challenges to efficiently connect each device to the network. In this thesis, we study wireless resource allocation problems that arise in the IoT, namely in the areas of the energy harvesting tags, termed the Internet of Tags (IoTags), and in cellular networks (mobile and cognitive).
First, we present our experience designing and developing Energy Harvesting Active Networked Tags (EnHANTs). The prototypes harvest indoor light energy using custom organic solar cells, communicate and form multihop networks using ultra-low-power Ultra- Wideband Impulse Radio (UWB-IR) transceivers, and dynamically adapt their communications and networking patterns to the energy harvesting and battery states. Using our custom designed small scale testbed, we evaluate energy-adaptive networking algorithms spanning the protocol stack (link, network, and flow control). Throughout the evaluation of experiments, we highlight numerous phenomena which are typically difficult to capture in simulations and nearly impossible to model in analytical work. We believe that these lessons would be useful for the designers of many different types of energy harvesters and energy harvesting adaptive networks.
Based on the lessons learned from EnHANTs, we present Power Aware Neighbor Discovery Asynchronously (Panda), a Neighbor Discovery (ND) protocol optimized for networks of energy harvesting nodes. To enable object tracking and monitoring applications for IoTags, Panda is designed to efficiently identify nodes which are within wireless communication range of one another. By accounting for numerous hardware constraints which are typically ignored (i.e., energy costs for transmission/reception, and transceiver state switching times/costs), we formulate a power budget to guarantee perpetual ND. Finally, via testbed evaluation utilizing Commercial Off-The-Shelf (COTS) energy harvesting nodes, we demonstrate experimentally that Panda outperforms existing protocols by a factor of 2-3x.
We then consider Proportional Fair (PF) cellular scheduling algorithms for mobile users, These users experience slow-fading wireless channels while traversing roads, train tracks, bus routes, etc. We leverage the predicable mobility on these routes and present the Predictive Finite-horizon PF Scheduling ((PF)2S) Framework. We collect extensive channel measurement results from a 3G network and characterize mobility-induced channel state trends. We show that a user’s channel state is highly reproducible and leverage that to develop a data rate prediction mechanism. Our trace-based simulations of the (PF)2S Framework indicate that the framework can increase the throughput by 15%–55% compared to traditional PF schedulers, while improving fairness.
Finally, we study fragmentation within a probability model of combinatorial structures. Our model does not refer to any particular application. Yet, it is applicable to dynamic spectrum access networks which can be used as the wireless access technology for numerous IoT applications. In dynamic spectrum access networks, users share the wireless resource and compete to transmit and receive data, and accordingly have specific bandwidth and residence-time requirements. We prove that the spectrum tends towards states of complete fragmentation. That is, for every request for j > 1 sub-channels, nearly all size-j requests are allocated j mutually disjoint sub-channels. In a suite of four theorems, we show how this result specializes for certain classes of request-size distributions. We also show that the delays in reaching the inefficient states of complete fragmentation can be surprisingly long. The results of this chapter provide insights into the fragmentation process and, in turn, into those circumstances where defragmentation is worth the cost it incurs
Performance analysis of redundancy and mobility in multi-server systems
In this thesis, we studied how both redundancy and mobility impact the performance of computer systems and cellular networks, respectively. The general notion of redundancy is that upon arrival each job dispatches copies into multiple servers. This allows exploiting the variability of the queue lengths and server capacities in the system. We consider redundancy models with both identical and i.i.d. copies. When copies are i.i.d., we show that with PS and ROS, redundancy does not reduce the stability region. When copies are identical, we characterize the stability condition for systems where either FCFS, PS, or ROS is implemented in the servers. We observe that this condition strongly depends on the scheduling policy implemented in the system. We then investigate how redundancy impacts the performance by comparing it to a non-redundant system. We observe that both the stability and performance improve considerably under redundancy as the heterogeneity of the server capacities increases. Furthermore, for both i.i.d. and identical copies, we characterize redundancy-aware scheduling policies that improve both the stability and performance. Finally, we identify several open problems that might be of interest to the community. User mobility in wireless networks addresses the fact that users in a cellular network switch from cell to cell when geographically moving in the system. We control the mobility speed of the users among the servers and analyze how mobility impacts the performance at a user level. We observe that the performance of the system under fixed mobility speed strongly depends on the inherent parameters of the system
Mobility-driven Scheduling in Wireless Networks
Abstract—The design of scheduling policies for wireless data systems has been driven by a compromise between the objectives of high overall system throughput and the degree of fairness among users, while exploiting multi-user diversity, i.e., fast-fading variations. These policies have been thoroughly investigated in the absence of user mobility, i.e., without slow fading variations. In the present paper, we examine the impact of intra- and inter-cell user mobility on the trade-off between throughput and fairness, and on the suitable choice of α-fair scheduling policies. We consider a dynamic setting where users come and go over time as governed by random finite-size data transfers, and explicitly allow for users to roam around. It is demonstrated that the overall performance improves as the fairness parameter α is reduced, and in particular, that proportional fair scheduling may yield relatively poor performance, in sharp contrast to the standard scenario with only fast fading. Since a lower α tends to affect short-term fairness, we explore how to set the fairness parameter so as to strike the right balance between overall performance and short-term fairness. It is further established that mobility tends to improve the performance, even when the network operates under a local fair scheduling policy as opposed to a globally optimal strategy. We present extensive simulation results to confirm and illustrate the analytical findings. I