Results 1  10
of
69
Resource allocation and crosslayer control in wireless networks
 Foundations and Trends in Networking
, 2006
"... Information flow in a telecommunication network is accomplished through the interaction of mechanisms at various design layers with the end goal of supporting the information exchange needs of the applications. In wireless networks in particular, the different layers interact in a nontrivial manner ..."
Abstract

Cited by 276 (59 self)
 Add to MetaCart
(Show Context)
Information flow in a telecommunication network is accomplished through the interaction of mechanisms at various design layers with the end goal of supporting the information exchange needs of the applications. In wireless networks in particular, the different layers interact in a nontrivial manner in order to support information transfer. In this text we will present abstract models that capture the crosslayer interaction from the physical to transport layer in wireless network architectures including cellular, adhoc and sensor networks as well as hybrid wirelesswireline. The model allows for arbitrary network topologies as well as traffic forwarding modes, including datagrams and virtual circuits. Furthermore the time varying nature of a wireless network, due either to fading channels or to changing connectivity due to mobility, is adequately captured in our model to allow for state dependent network control policies. Quantitative performance measures that capture the quality of service requirements in these systems depending on the supported applications are discussed, including throughput maximization, energy consumption minimization, rate utility function maximization as well as general performance functionals. Crosslayer control algorithms with optimal or suboptimal performance with respect to the above measures are presented and analyzed. A detailed exposition of the related analysis and design techniques is provided. 1
Quality of Service Guarantees in Virtual Circuit Switched Networks
 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
, 1995
"... We review some recent results regarding the problem of providing deterministic quality of service guarantees in slotbased virtual circuit switched networks. The concept of a service curve is used to partially characterize the service that virtual circuit connections receive. We find that service cu ..."
Abstract

Cited by 255 (10 self)
 Add to MetaCart
We review some recent results regarding the problem of providing deterministic quality of service guarantees in slotbased virtual circuit switched networks. The concept of a service curve is used to partially characterize the service that virtual circuit connections receive. We find that service curves provide a convenient framework for managing the allocation of performance guarantees. In particular, bounds on endtoend performance measures can be simply obtained in terms of service curves and burstiness constraints on arriving traffic. Service curves can be allocated to the connections, and we consider scheduling algorithms that can support the allocated service curves. Such an approach provides the required degree of isolation between the connections in order to support performance guarantees, without precluding statistical multiplexing. Finally, we examine the problem of enforcing burstiness constraints in slotbased networks.
A tutorial on crosslayer optimization in wireless networks
 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
, 2006
"... This tutorial paper overviews recent developments in optimization based approaches for resource allocation problems in wireless systems. We begin by overviewing important results in the area of opportunistic (channelaware) scheduling for cellular (singlehop) networks, where easily implementable my ..."
Abstract

Cited by 248 (29 self)
 Add to MetaCart
(Show Context)
This tutorial paper overviews recent developments in optimization based approaches for resource allocation problems in wireless systems. We begin by overviewing important results in the area of opportunistic (channelaware) scheduling for cellular (singlehop) networks, where easily implementable myopic policies are shown to optimize system performance. We then describe key lessons learned and the main obstacles in extending the work to general resource allocation problems for multihop wireless networks. Towards this end, we show that a cleanslate optimization based approach to the multihop resource allocation problem naturally results in a “loosely coupled” crosslayer solution. That is, the algorithms obtained map to different layers (transport, network, and MAC/PHY) of the protocol stack are coupled through a limited amount of information being passed back and forth. It turns out that the optimal scheduling component at the MAC layer is very complex and thus needs simpler (potentially imperfect) distributed solutions. We demonstrate how to use imperfect scheduling in the crosslayer framework and describe recently developed distributed algorithms along these lines. We conclude by describing a set of open research problems.
Information Theory and Communication Networks: An Unconsummated Union
 IEEE Trans. Inform. Theory
, 1998
"... Information theory has not yet had a direct impact on networking, although there are similarities in concepts and methodologies that have consistently attracted the attention of researchers from both fields. In this paper, we review several topics that are related to communication networks and that ..."
Abstract

Cited by 187 (7 self)
 Add to MetaCart
(Show Context)
Information theory has not yet had a direct impact on networking, although there are similarities in concepts and methodologies that have consistently attracted the attention of researchers from both fields. In this paper, we review several topics that are related to communication networks and that have an information theoretic flavor, including multiaccess protocols, timing channels, effective bandwidth of bursty data sources, deterministic constraints on datastreams, queueing theory, and switching networks. Keywords Communication networks, multiaccess, effective bandwidth, switching I. INTRODUCTION Information theory is the conscience of the theory of communication; it has defined the "playing field" within which communication systems can be studied and understood. It has provided the spawning grounds for the fields of coding, compression, encryption, detection, and modulation and it has enabled the design and evaluation of systems whose performance is pushing the limits of wha...
Distributed link scheduling with constant overhead
 In Proceedings of ACM Sigmetrics
, 2007
"... This paper proposes a new class of simple, distributed algorithms for scheduling in wireless networks. The algorithms generate new schedules in a distributed manner via simple local changes to existing schedules. The class is parameterized by integers k ≥ 1. We show that algorithm k of our class ach ..."
Abstract

Cited by 102 (3 self)
 Add to MetaCart
(Show Context)
This paper proposes a new class of simple, distributed algorithms for scheduling in wireless networks. The algorithms generate new schedules in a distributed manner via simple local changes to existing schedules. The class is parameterized by integers k ≥ 1. We show that algorithm k of our class achieves k/(k +2) of the capacity region, for every k ≥ 1. The algorithms have small and constant worstcase overheads: in particular, algorithm k generates a new schedule using (a) time less than 4k + 2 roundtrip times between neighboring nodes in the network, and (b) at most three control transmissions by any given node, for any k. The control signals are explicitly specified, and face the same interference effects as normal data transmissions. Our class of distributed wireless scheduling algorithms are the first ones guaranteed to achieve any fixed fraction of the capacity region while using small and constant overheads that do not scale with network size. The parameter k explicitly captures the tradeoff between control overhead and scheduler throughput performance and provides a tuning knob protocol designers can use to harness this tradeoff in practice. 1.
Lowcomplexity distributed scheduling algorithms for wireless networks
 IEEE/ACM Trans. on Netw
"... Abstract — We consider the problem of distributed scheduling in wireless networks. We present two different algorithms whose performance is arbitrarily close to that of maximal schedules, but which require low complexity due to the fact that they do not necessarily attempt to find maximal schedules. ..."
Abstract

Cited by 81 (6 self)
 Add to MetaCart
(Show Context)
Abstract — We consider the problem of distributed scheduling in wireless networks. We present two different algorithms whose performance is arbitrarily close to that of maximal schedules, but which require low complexity due to the fact that they do not necessarily attempt to find maximal schedules. The first algorithm requires each link to collect local queuelength information in its neighborhood, and its complexity is independent of the size and topology of the network. The second algorithm is presented for the nodeexclusive interference model, does not require nodes to collect queuelength information even in their local neighborhoods, and its complexity depends only on the maximum node degree in the network. I.
Scheduling efficiency of distributed greedy scheduling algorithms in wireless networks
 in INFOCOM
, 2006
"... Abstract — We consider the problem of distributed scheduling in wireless networks subject to simple collision constraints. We define the efficiency of a distributed scheduling algorithm to be the largest number (fraction) such that the throughput under the distributed scheduling policy is at least e ..."
Abstract

Cited by 73 (1 self)
 Add to MetaCart
(Show Context)
Abstract — We consider the problem of distributed scheduling in wireless networks subject to simple collision constraints. We define the efficiency of a distributed scheduling algorithm to be the largest number (fraction) such that the throughput under the distributed scheduling policy is at least equal to the efficiency multiplied by the maximum throughput achievable under a centralized policy. For a general interference model, we prove a lower bound on the efficiency of a distributed scheduling algorithm by first assuming that all the traffic only uses onehop of the network. We also prove that the lower bound is tight in the sense that for any fraction larger than the lower bound, we can find a topology and an arrival rate vector within the fraction of the capacity region, such that the network is unstable under a greedy scheduling policy. We then extend our results to a more general multihop traffic scenario and show that similar scheduling efficiency results can be established by introducing prioritization or regulators to the basic greedy scheduling algorithm. Index Terms — Multihop wireless networks, scheduling, greedy algorithms, resource allocation
Efficient Scheduling of Nonuniform Packet Traffic in a WDM/TDM Local Lightwave Network with Arbitrary Tranceiver Tuning Latencies
, 1996
"... A passivestarbased, broadcastandselect, local lightwave network which can support a limited number of WDM channels (on the order of ten), but serve a much larger number of nodes (a few tens or hundreds), is considered. Each node is equipped with one tunable transmitter and one fixed receiver, an ..."
Abstract

Cited by 58 (3 self)
 Add to MetaCart
A passivestarbased, broadcastandselect, local lightwave network which can support a limited number of WDM channels (on the order of ten), but serve a much larger number of nodes (a few tens or hundreds), is considered. Each node is equipped with one tunable transmitter and one fixed receiver, and each WDM channel is operated in a TDM fashion for carrying packet traffic. An important challenge is to allocate bandwidth to the node pairs when traffic flow between them is nonuniform, while also accommodating an important device constraint, viz. large transceiver tuning latency. Under such a scenario, this paper addresses the problem of determining optimum transmission schedules which can, in turn, minimize the networkwide mean packet delay. Specifically, a novel suite of algorithms for load balancing on a WDM/TDM local lightwave network are developed. Our approach exploits wellknown results from scheduling theory to create good transmission schedules on such a network. The algorithm...
Queue length stability of maximal greedy schedules in wireless networks
 in Proc. Information Theory and Applications Inaugural Workshop
, 2006
"... Abstract — We consider wireless networks with interference constraints. The network consists of a set of links and a set of users who generate packets that traverse these links. Each user is associated with a route consisting of a sequence of links. The links are subject to the usual interference co ..."
Abstract

Cited by 31 (6 self)
 Add to MetaCart
(Show Context)
Abstract — We consider wireless networks with interference constraints. The network consists of a set of links and a set of users who generate packets that traverse these links. Each user is associated with a route consisting of a sequence of links. The links are subject to the usual interference constraints: (i) if link l interferes with link k, then link k also interferes with link l, and (ii) two links that interfere with each other cannot transmit simultaneously. The interference set of a link is defined to be the set of links that interfere with the link, along with the link itself. A greedy scheduler is one which selects an arbitrary set of links to transmit subject only to the interference constraint. We use a traffic regulator at each link along the route of each flow which shapes the traffic of the flow. We prove that the network is queuelength stable under any maximal greedy scheduling policy provided that the total arrival rate in the interference set of each link is less than one. I.
Media Access Protocols for WDM Networks with OnLine Scheduling
 IEEE/OSA Journal of Lightwave Technology
, 1999
"... This paper studies media access protocols which support collisionfree broadcast/multicast communication for optically connected starcoupled systems with Wavelength Division Multiple Access channels. An early hybrid access protocol, consisting of reservation and of receiver channels preallocation ..."
Abstract

Cited by 25 (7 self)
 Add to MetaCart
(Show Context)
This paper studies media access protocols which support collisionfree broadcast/multicast communication for optically connected starcoupled systems with Wavelength Division Multiple Access channels. An early hybrid access protocol, consisting of reservation and of receiver channels preallocation, allows reservation for exactly one WDM channel per node during the reservation phase. We extend this protocol by allowing reservations on multiple channels and applying scheduling algorithms to improve network performance. Existing scheduling algorithms for similar reservation problems, although providing optimal scheduling for network utilization, have unacceptable computational cost and high implementation complexity. We propose two online scheduling algorithms which run in linear time and are simple, making them amenable for hardware implementation. Performance of the protocol using scheduling with varying system parameters is evaluated through discreteevent simulation under both uniform and nonuniform traffic patterns. Our simulation results show that our approach achieves lower average packet latency and higher network utilization compared to the early hybrid access protocol with single channel, especially in the clientserver environment.