Abstract
AbstractThis article investigates a two‐user competitive scheduling problem. The problem arises in a Universal Mobile Telecommunication System (UMTS) developed within the European IST project FUTURE: given two mobile terminals, one wants to maximize the on‐time data packets transmitted to one user, while guaranteeing a certain amount of on‐time data packets to the other. We show that the problem is NP‐hard, despite peculiar properties of data and solutions. We propose a fast lagrangian heuristic able to cope with a severe real‐time requirement, and compare it to a greedy‐like heuristic on a set of practical instances. © 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 44(2), 132–141 2004
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.
