Results 1 -
8 of
8
Scheduling algorithms for providing flexible, rate-based, quality of service guarantees for packet-switching in Banyan networks
- IN PROCEEDINGS OF THE 38TH ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS (CISS
, 2004
"... We consider the problem of providing flexible, ratebased, quality of service guarantees for a particular class of multistage switch networks that includes Banyan networks. We focus on solving a type of on-line, traffic scheduling problem, whose input at each time step is a set of desired traffic r ..."
Abstract
-
Cited by 11 (0 self)
- Add to MetaCart
We consider the problem of providing flexible, ratebased, quality of service guarantees for a particular class of multistage switch networks that includes Banyan networks. We focus on solving a type of on-line, traffic scheduling problem, whose input at each time step is a set of desired traffic rates through the switch network. These traffic rates in general cannot be exactly achieved since they treat the incoming data as fluid, that is, they assume arbitrarily small fractions of packets can be transmitted at each time step. The goal of the traffic scheduling problem is to closely approximate the given sequence of traffic rates by a sequence of switch uses throughout the network in which only whole packets are sent. The focus of this paper is bounding the costs incurred in using such an approximation, in terms of the additional buffer size, called backlog, required. Our contributions in this paper apply to a class of multistage
Universal Bounds on Buffer Size for Packetizing Fluid Policies in Input Queued, Crossbar Switches
, 2004
"... In this paper, we consider a type of online, traffic scheduling problem in input queued, crossbar switches. The input to a problem, at each time step, is a set of desired traffic rates. These traffic rates in general cannot be exactly achieved since they assume arbitrarily small fractions of packets ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
In this paper, we consider a type of online, traffic scheduling problem in input queued, crossbar switches. The input to a problem, at each time step, is a set of desired traffic rates. These traffic rates in general cannot be exactly achieved since they assume arbitrarily small fractions of packets can be transmitted at each time step. The goal of the traffic scheduling problem is to closely approximate the given sequence of traffic rates by a sequence of switch uses in which only whole packets are sent. The focus of this paper is bounding the costs incurred in using such an approximation, in terms of the additional buffer size required.
Time-Varying Fair Queuing Scheduling For Multicode Cdma Based On Dynamic Programming
"... Fair Queuing (FQ) algorithms, which have been proposed for QoS wireline-wireless networking, rely on the fundamental idea that the service rate allocated to user proportional to a positive weight . Targeting wireless data networks with a multicode CDMA-based physical layer, we develop FQ w ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Fair Queuing (FQ) algorithms, which have been proposed for QoS wireline-wireless networking, rely on the fundamental idea that the service rate allocated to user proportional to a positive weight . Targeting wireless data networks with a multicode CDMA-based physical layer, we develop FQ with time-varying weight assignments in order to minimize the queuing delays of mobile users. Applying dynamic programming, we design a computationally efficient algorithm which produces the optimal service rates while obeying i) constraints imposed by the underlying physical layer, and ii) QoS requirements.
Approximating fluid schedules in packet-switched networks
, 2004
"... Doctor of Philosophy We consider a problem motivated by the desire to provide
exible, rate-based, quality of service guarantees for packets sent over switches and switch networks. Our focus is solving a type of on-line, trac scheduling problem, whose input at each time step is a set of desired trac ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
(Show Context)
Doctor of Philosophy We consider a problem motivated by the desire to provide
exible, rate-based, quality of service guarantees for packets sent over switches and switch networks. Our focus is solving a type of on-line, trac scheduling problem, whose input at each time step is a set of desired trac rates through the switch network. These trac rates in general cannot be exactly achieved since they treat the incoming data as
uid, that is, they assume arbitrarily small fractions of packets can be transmitted at each time step. The goal of the trac scheduling problem is to closely approximate the given sequence of trac rates by a sequence of switch uses throughout the network in which
LIBRARIES Tracking Switch Fluid Policies: Bounding Lookahead
, 2002
"... Media-access arbitration policies capable of guaranteeing a wide range of qualities of service (QoSs) will play a vital role in future systems. Such systems include in-tegrated services networks and advanced wireless networks. A general approach for developing these policies begins by first consider ..."
Abstract
- Add to MetaCart
(Show Context)
Media-access arbitration policies capable of guaranteeing a wide range of qualities of service (QoSs) will play a vital role in future systems. Such systems include in-tegrated services networks and advanced wireless networks. A general approach for developing these policies begins by first considering media access as infinitesimally divisible, or fluid. Fluid policies are convenient for design and analysis but are often not realizable. The second step is to develop a granular, and therefore realizable, method of approximating the fluid policy. Approximating some fluid policies requires lookahead, knowledge of the policies ' future behavior. We prove a lower bound of order N on the lookahead required for granular policies to adequately approximate, or track, fluid policies. We also present preliminary results in our study of an upper bound on lookahead, above which all fluid policies can be tracked. We introduce a particular granular policy and conjecture that with N lookahead it tracks any fluid
Traffic Management
"... Abstract. Quality of service in network communication is mainly assured by traffic management consisting in a variety of protocols and mechanisms whose role is to prevent the network from being congested. Traffic management has been a very active area of research for two decades following the concep ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract. Quality of service in network communication is mainly assured by traffic management consisting in a variety of protocols and mechanisms whose role is to prevent the network from being congested. Traffic management has been a very active area of research for two decades following the conception of packetswitched integrated services networks, such as the Internet. This chapter provides samples of the state of the art in traffic management. It includes contributions on traffic theory, traffic and service models, quality monitoring, as well as traffic
unknown title
"... Ultra-wideband (UWB) radio is a fast emerging technology with uniquely attractive features inviting major advances in wireless communications, networking, radar, imaging, and positioning systems. By its rulemaking proposal in 2002, the Federal Communications Commission (FCC) in the United States ess ..."
Abstract
- Add to MetaCart
(Show Context)
Ultra-wideband (UWB) radio is a fast emerging technology with uniquely attractive features inviting major advances in wireless communications, networking, radar, imaging, and positioning systems. By its rulemaking proposal in 2002, the Federal Communications Commission (FCC) in the United States essentially unleashed huge “new bandwidth’ ’ (3.6–10.1 GHz) at the noise floor, where UWB radios overlaying coexistent RF systems can operate using low-power ultra-short information bearing pulses. With similar regulatory processes currently under way in many countries worldwide, industry, government agencies, and academic institutions responded to this FCC ruling with rapidly growing research efforts targeting a host of exciting UWB applications: short-range very high-speed broadband access to the Internet, covert communication links, localization at centimeter-level accuracy, high-resolution ground-penetrating radar, through-wall imaging, precision navigation and asset tracking, just to name a few. This tutorial focuses on UWB wireless communications at the physical layer. It overviews the state-of-the-art in channel modeling, transmitters, and receivers of UWB radios, and outlines research directions and challenges to be overcome. As signal processing expertise is expected to have major impact in research and development of UWB systems, emphasis is placed on DSP aspects.
Approximating Fluid Schedules in Crossbar Packet-Switches and Banyan Networks
, 2006
"... We consider a problem motivated by the desire to provide flexible, rate-based, quality of service guarantees for packets sent over input queued switches and switch networks. Our focus is solving a type of online traffic scheduling problem, whose input at each time step is a set of desired traffic ra ..."
Abstract
- Add to MetaCart
(Show Context)
We consider a problem motivated by the desire to provide flexible, rate-based, quality of service guarantees for packets sent over input queued switches and switch networks. Our focus is solving a type of online traffic scheduling problem, whose input at each time step is a set of desired traffic rates through the switch network. These traffic rates in general cannot be exactly achieved since they assume arbitrarily small fractions of packets can be transmitted at each time step. The goal of the traffic scheduling problem is to closely approximate the given sequence of traffic rates by a sequence of transmissions in which only whole packets are sent. We prove worst-case bounds on the additional buffer use, which we call backlog, that results from using such an approximation. We first consider the, input queued, crossbar switch. Our main result is an online packet-scheduling algorithm using no speedup that guarantees backlog at most @ CIA P R packets at each input port and each output port. Upper bounds on worst-case backlog have been proved for the case of constant fluid schedules, such as the P P CP bound of Chang, Chen, and Huang (INFOCOM, 2000). Our main result for the crossbar switch is the first, to our knowledge, to bound backlog in terms of switch size for arbitrary, time-varying fluid schedules, without using speedup. Our main result for Banyan networks is an exact characterization of the speedup required to maintain bounded backlog, in terms of polytopes derived from the network topology.
