By Topic

An improved time-slot assignment algorithm for TDM hierarchical switching 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)
Chalasani, S. ; Dept. of Comput. Eng., Wisconsin Univ., Madison, WI, USA ; Varma, A.

It is shown that any hierarchical switching system can be modeled by a special class of flow networks called unit networks. Using the results available for finding maximum flow through a unit network, a time-slot assignment (TSA) algorithm that runs in O(min(L ,M2)×min(N, √MM2) time is presented. This is an O(max(M/N, √M)) improvement over the TSA algorithm proposed by M.A. Bonucelli (1989)

Published in:

Communications, IEEE Transactions on  (Volume:41 ,  Issue: 2 )