Baked-Potato Routing

✍ Scribed by Shlomi Dolev; Evangelos Kranakis; Danny Krizanc

• Book ID: 102572732
• Publisher: Elsevier Science
• Year: 1999
• Tongue: English
• Weight: 157 KB
• Volume: 30
• Category: Article
• ISSN: 0196-6774
• DOI: 10.1006/jagm.1998.0981

✦ Synopsis

This paper presents scheduling of packet transmission schemes, called bakedpotato schemes, which are used to avoid simultaneous arrival of packets at a switch. We present scheduling schemes for any capacity of links and switches. The schemes are evaluated by the maximal length of time between two successive schedulings of a processor. For the case of a single-capacity link and switch, our scheme is proved optimal by presenting a matching lower bound. Our baked-potato scheme does not assume any prior knowledge on the source᎐destination demands and can be used for sending control packets and broadcasting.