๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Stability and delay of distributed scheduling algorithms for networks of conflicting queues

โœ Scribed by Libin Jiang, Jean Walrand


Book ID
118808990
Publisher
Springer US
Year
2012
Tongue
English
Weight
841 KB
Volume
72
Category
Article
ISSN
0257-0130

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A delay analysis of FDQ (Fair Distribute
โœ Mete Kabatepe; Kenneth S. Vastola ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 301 KB

## ลฝ . ลฝ . A delay analysis of FDQ Fair Distributed Queue and DQDB with and without the BWB mechanism is presented. A network of two active nodes with a large separation of nodes is considered in each case. Under the common set of assumptions of single buffer nodes, geometric arrivals and the pack

Clustering-based scheduling: A new class
โœ Sophia G. Petridou; Panagiotis G. Sarigiannidis; Georgios I. Papadimitriou; Andr ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 279 KB

## Abstract In wavelength division multiplexing (WDM) star networks, the construction of the transmission schedule is a key issue, which essentially affects the network performance. Up to now, classic scheduling techniques consider the nodes' requests in a sequential service order. However, these a

Distributed algorithms for connectivity
โœ Koichi Wada; Yukio Moritani; Kimio Kawaguchi; Masahiro Morishita ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 919 KB

## Abstract Distributed algorithms for computing the connectivity of an asynchronous computer network with faulty computers and links are investigated. Computers which are adjacent to faulty computers and links are assumed to be capable of detecting the faults. The existence and efficiency of distr