Cycle Synchronization in Cyclone Networks
dc.contributor.author | Szajda, Doug | en_US |
dc.contributor.author | Hawkin, Simon | en_US |
dc.contributor.author | Agrawala, Ashok | en_US |
dc.date.accessioned | 2004-05-31T23:09:40Z | |
dc.date.available | 2004-05-31T23:09:40Z | |
dc.date.created | 2001-03 | en_US |
dc.date.issued | 2001-05-10 | en_US |
dc.description.abstract | Networks with time-cyclic allocation of node resources (e.g. SONET or a wireless network using TDMA media access scheduling) require a degree of synchronization in order to guarantee that cycle lengths and drifts remain within acceptable tolerances. Cyclone is a class of such networks. By requiring applications to reserve resources in both time and space, a balance is achieved between arriving and departing flows, ensuring a lack of congestion and eliminating the need for flow control. This paper presents a lightweight cycle synchronization algorithm for Cyclone networks, and shows through both theoretical analysis and simulation that even in the presence of timing errors, both cycle length jitter and cycle phase differences fall well within tolerable levels. (Cross-referenced as UMIACS-TR-2001-17) | en_US |
dc.format.extent | 951296 bytes | |
dc.format.mimetype | application/postscript | |
dc.identifier.uri | http://hdl.handle.net/1903/1124 | |
dc.language.iso | en_US | |
dc.relation.isAvailableAt | Digital Repository at the University of Maryland | en_US |
dc.relation.isAvailableAt | University of Maryland (College Park, Md.) | en_US |
dc.relation.isAvailableAt | Tech Reports in Computer Science and Engineering | en_US |
dc.relation.isAvailableAt | UMIACS Technical Reports | en_US |
dc.relation.ispartofseries | UM Computer Science Department; CS-TR-4228 | en_US |
dc.relation.ispartofseries | UMIACS; UMIACS-TR-2001-17 | en_US |
dc.title | Cycle Synchronization in Cyclone Networks | en_US |
dc.type | Technical Report | en_US |