By Topic

Throughput evaluation of a satellite-switched CDMA (SS/CDMA) demand assignment system

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

3 Author(s)
Gerakoulis, D.P. ; Adv. Commun. Lab., AT&T Bell Labs., Whippany, NJ, USA ; Wai-Chung Chan ; Gerantiotis, E.

This paper presents throughput evaluation of a satellite-switched code-division multiple-access (SS/CDMA) system which operates under demand assignment control. SS/CDMA provides both multiple access and switching to a geostationary multibeam satellite. Multiple access is resolved by space, frequency, and code division. Space division is introduced by the multibeam antennas that provide frequency reuse in each beam. The spectrum is then channelized into frequency bands where each band is accessed by code division for both the uplink and downlink. The satellite on-board performs the switching function, which is also based on compatible code-multiplexed switching. The switch may route both circuit calls and data packets which are assigned upon request. The on-board code-division switch operates under the control of a channel assignment algorithm. We provide channel assignment algorithms for optimum, suboptimum, and random switch operation. The system throughput has been evaluated for each case and compared. Performance analysis has been carried out for the case of the optimum switch scheduling. The analysis is based on a discrete-time Markovian model, and provides the call-blocking probabilities and data packet delays. Computer simulations have been used to evaluate the performance of the optimum, suboptimum, and random cases. It is shown that the circuit call-blocking probabilities achieved for these cases are almost the same. The optimum algorithm achieves the minimum data packet delay, while the performance of the suboptimum algorithm is slightly better than the random one. Furthermore, data packets may be routed via the switch with limited delays, even with a heavy load of circuit calls

Published in:

Selected Areas in Communications, IEEE Journal on  (Volume:17 ,  Issue: 2 )