Abstract
We present several problems related to the traffic scheduling in computer networks and telecommunication systems, and show how network flow can be used to efficiently solve these problems. The problems consist in minimizing the time needed to transmit a set of information units (packets) from the sources to their destinations, in systems made of entities communicating by means of the so-called “interconnection networks”. The aim is to schedule the packets so to avoid communication conflicts (packet collisions), and minimize the schedule length. Several side-constraint s arise according to the technical features of the specific systems under consideration, and accordingly several different problems arise. Some of these problems can be represented (and solved) by a sequence of max flows in proper bipartite networks. Others are computationally intractable (i.e. NP-complete).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R.K. Ahuja, T.L. Magnanti, and J.B. Orlin: “Network flows: theory, algorithms and applications”, Prentice Hall, New York, 1992.
P. Barcaccia and M.A. Bonuccelli: “A polynomial time optimal algorithm for time slot assignment of variable bandwidth systems”, ACM-IEEE Trans. Networking., to appear.
A.A. Bertossi, G. Bongiovanni, and M.A. Bonuccelli: “Time slot assignment in SS/TDMA systems with intersatellite links”, IEEE Trans. Commun., 35, pp. 602–608, 1987.
G. Bongiovanni, D. Coppersmith, and C.K. Wong: “An optimal time slot assignment for an SS/TDMA system with variable number of transponders”, IEEE Trans. Commun., 29, pp.721–726, 1981.
G. Bongiovanni, D.T. Tang, and C.K. Wong: “A general multibeam satellite switching algorithm”, IEEE Trans. Commun., 29, pp.1025–1036, 1981.
M. A. Bonuccelli: “A fast time slot assignment algorithm for TDM hierarchical switching systems”, IEEE Trans. Commun., 37, pp. 870–874, 1989.
M.A. Bonuccelli: “A polynomial time optimal algorithm for satellite-switched time-division multiple access satellite communications with general switching modes”, SIAM Journal on Discrete Mathematics, 4, pp. 28–35, 1991.
M.A. Bonuccelli, I.S. Gopal, and C.K. Wong: “Incremental time slot assignment in SS/TDMA satellite systems”, IEEE Trans. Commun., 39, pp. 1147–1156, 1991.
S. Chalasani and A. Varma: “Efficient time slot assignment algorithms for SS/TDMA systems with variable bandwidth beams”, Proc. IEEE INFOCOM’ 91, Miami, pp. 658-667, April 1991.
K.Y. Eng and A.S. Acampora: “Fundamental conditions governing TDM switching assignments in terrestrial and satellite networks”, IEEE Trans. Commun., 35, pp. 755–761, 1987.
A. Ganz and Y. Gao: “SS/TDMA scheduling for satellite clusters”, IEEE Trans. Commun., 40, pp. 597–603, 1992.
M.R. Garey and D.S. Johnson: “Computers and intractability: a guide to the theory of NP-completeness”, Freeman, S. Francisco, 1979.
I.S. Gopal, G. Bongiovanni, M.A. Bonuccelli, D.T. Tang, and C.K. Wong: “An optimal switching algorithm for multibeam satellite systems with variable bandwidth”, IEEE Trans. Commun., 30, pp. 2475–2481, 1982.
I.S. Gopal, M.A. Bonuccelli, and C.K. Wong, “Scheduling in multibeam satellites with interfering zones”, IEEE Trans. Commun., 31, pp. 941–951, 1983.
I.S. Gopal, D. Coppersmith and C.K. Wong: “Minimizing packet waiting time in a multibeam satellite system”, IEEE Trans. Commun., 30, pp. 305–316, 1982.
I.S. Gopal and C.K. Wong, “Minimizing the number of switching in an SS/TDMA system”, IEEE Trans. Commun., 33, pp. 497–501, 1985.
T. Inukai: “An efficient SS/TDMA time slot assignment algorithm”, IEEE Trans. Commun., 27, pp. 1449–1455, 1979.
J.L. Lewandowski, J.W.S. Liu, and C.L. Liu: “SS/TDMA time slot assignment with restricted switching modes”, IEEE Trans. Commun., 31, pp.149–154, 1983.
Y.K. Tham, “Burst assignment for satellite-switched and earth-station frequency-hopping TDMA networks”, IEE Proceedings, 137, pp. 247–255, 1990.
W.W. Wu, “On the efficacy of traffic assignment in on Digital Satellite Communication, Montreal, P.Q., Canada, October 1978.
W.W. Wu, “Elements of digital satellite communication”, Computer Science Press, Rockville MD, 1985.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer Science+Business Media New York
About this chapter
Cite this chapter
Bonuccelli, M.A. (1995). Traffic Scheduling in Telecommunication Systems and Network Flow. In: Giannessi, F., Maugeri, A. (eds) Variational Inequalities and Network Equilibrium Problems. Springer, Boston, MA. https://doi.org/10.1007/978-1-4899-1358-6_2
Download citation
DOI: https://doi.org/10.1007/978-1-4899-1358-6_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4899-1360-9
Online ISBN: 978-1-4899-1358-6
eBook Packages: Springer Book Archive