Packet-mode policies for input-queued switches

This paper considers the problem of packet-mode scheduling of input queuedswitches. Packets have variable lengths, and are divided into cells of unit length. Each packet arrives to the switch with a given deadline by which it must traverse the switch. A packet successfully passes the switch if the sequence of cells comprising it is contiguously transmitted out of the switch before the packet’s deadline expires. A packet transmission may be preempted and restarted from the beginning later. The scheduling policy has to decide at each time step which packets to serve. The problem is online in nature, and thus we use competitive analysis to measure the performance of our scheduling policies. First we consider the case where the goal of the switch policy is to maximize the total number of successfully transmitted packets. We derive two algorithms achieving the competitive ratios of 22 plog L+1 and N+1, respectively, where Lis the ratio between the longest and the shortest packet length...

• Type: Conference
• Year: 2004
• Where: SPAA
• Authors: Dan Guez, Alexander Kesselman, Adi Rosén
• Keywords: Algorithm, Competitive Ratio, Deterministic Online Algorithm, Distributed And Parallel Computing, SPAA 2004