Efficient token-based control in rings.

DOI10.1016/S0020-0190(98)00054-4zbMATH Open1078.68537OpenAlexW2045269845MaRDI QIDQ2583556FDOQ2583556

Authors: N. Santoro, E. Feuerstein, Stefano Leonardi, Alberto Marchetti-Spaccamela 

Publication date: 17 January 2006

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(98)00054-4

Recommendations

• scientific article; zbMATH DE number 5931451
• Separation of circulating tokens
• scientific article; zbMATH DE number 4053002
• Optimal Control of Arrivals to Token Ring Networks with Exhaustive Service Discipline
• Distributed Computing - IWDC 2003

zbMATH Keywords

Distributed computingAmortized analysis

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cites Work

• Title not available (Why is that?)
• Self-stabilizing systems in spite of distributed control
• Amortized Computational Complexity
• Title not available (Why is that?)
• A taxonomy of distributed mutual exclusion
• Data communications, computer networks, and open systems.

Cited In (4)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Distributed Computing - IWDC 2003
• Request-based token passing for self-stabilizing mutual exclusion

This page was built for publication: Efficient token-based control in rings.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583556)