RT Generic
T1 Proportional switching in FIFO networks
A1 Bramson, Maury
A1 D'Auria, Bernardo
A1 Walton, Neil
A2 , 
AB We consider a family of discrete time multihop switched queueing networks where each packet movesalong a  xed route. In this setting, BackPressure is the canonical choice of scheduling policy; this policy hasthe virtues of possessing a maximal stability region and not requiring explicit knowledge of tra c arrival rates.BackPressure has certain structural weaknesses because implementation requires information about each route,and queueing delays can grow super-linearly with route length. For large networks, where packets over manyroutes are processed by a queue, or where packets over a route are processed by many queues, these limitationscan be prohibitive.In this article, we introduce a scheduling policy for FIFO networks, the Proportional Scheduler, which isbased on the proportional fairness criterion. We show that, like BackPressure, the Proportional Scheduler hasa maximal stability region and does not require explicit knowledge of tra c arrival rates. The ProportionalScheduler has the advantage that information about the network's route structure is not required for scheduling,which substantially improves the policy's performance for large networks. For instance, packets can be routedwith only next-hop information and new nodes can be added to the network with only knowledge of thescheduling constraints
SN 
YR 2015
FD 2015-09-01
LK https://hdl.handle.net/10016/21734
UL https://hdl.handle.net/10016/21734
LA eng
NO The research of the  rst author was partially supported by NSF grants DMS-1105668 and DMS-1203201.The research of the second author was partially supported by the Spanish Ministry of Economy and Competitiveness GrantsMTM2013-42104-P via FEDER funds; he thanks the ICMAT (Madrid, Spain) Research Institute that kindly hosted him whiledeveloping this project.
DS e-Archivo
RD 17 jul. 2024