Abstract
Cyclic-reservation multiple-access (CRMA) is an access scheme for high-speed local and metropolitan area networks based on a dual-bus configuration. In CRMA, the headend generates the reserve commands periodically. It is proved that the problem of finding a shortest cycle for a CRMA reservation (called a cycle compression problem) is NP-complete by showing that it is equivalent to the interval coloring problem. An O(n/sup 2/) approximation algorithm is proposed to solve this problem, where n is the number of stations in the network. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
