Cart (Loading....) | Create Account
Close category search window
 

Polynomial time optimal algorithms for time slot assignment of variable bandwidth systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Barcaccia, P. ; Dipartimento di Sci. dell'' Inf., Rome Univ., Italy ; Bonuccelli, M.A.

Considers the optimal (i.e., minimum length) time slot assignment problem for variable bandwidth switching systems. Existing algorithms for this problem are known to be pseudo-polynomial. The practical question of finding a fast optimal algorithm, as well as the theoretical question of whether the above problem is NP-complete were left open. The authors present a technique to show polynomial time complexity of some time slot assignment algorithms. Such a technique applies to an algorithm proposed by Chalasani and Varma in 1991 (called the CV algorithm), as well as to a network flow based optimal algorithm, proposed in the present paper for the first time. The CV algorithm and the one proposed are slightly different. Thus, the authors give an answer to both the above questions, by establishing that the problem is in P, and by showing effective algorithms for it

Published in:

Networking, IEEE/ACM Transactions on  (Volume:2 ,  Issue: 3 )

Date of Publication:

Jun 1994

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.