Article

An optimal packet scheduling and load balancing algorithm for LEO/MEO satellite networks

Authors:

Maurizio A. Bonuccelli,

Francesca Martelli,

Susanna PelagattiAuthors Info & Claims

MSWiM '04: Proceedings of the 7th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems

Pages 47 - 51

https://doi.org/10.1145/1023663.1023674

Published: 04 October 2004 Publication History

MSWiM '04: Proceedings of the 7th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems

An optimal packet scheduling and load balancing algorithm for LEO/MEO satellite networks

Pages 47 - 51

Abstract
References

Abstract

LEO/MEO constellations of communication satellites have recently been proposed as a powerful tool for improving internet performance and for extending it beyond the earth (InterPlanetary Internet). Several aspects of such usage must still be investigated. Among them, proper routing and MAC protocols play a prominent role. In this paper,we assume that the MAC protocol is an MF/TDMA one (as usual in satellite communication), and we consider the problem of assigning packets to a set of shortest paths in a satellite constellation, with the goal of minimizing the overall packet scheduling problem. We present an optimal polynomial time algorithm which works offline and balances the load over all possible shortest paths, allowing a minimum schedule length for the entire constellation to be found in polynomial time.

References

[1]

P. Agrawal, J. C. Chen, and K. Sivalingam. Wireless Multimedia Network Technologies for the New Millennium, chapter 11. Kluwer Academic Press, 1999.

[2]

O. B. Akan, J. Fang, and I. F. Akyildiz. TP-Planet: A reliable transport protocol for interPlanetary internet. IEEE Journal on Selected Areas in Communications, 22(2):348--361, February 2004.

Digital Library

[3]

I. F. Akyildiz, O. B. Akan, C. Chen, J. Fang, and W. Su. InterPlaNetary Internet: state-of-the-art and research challenges. Computer Networks, 43(2):75--112, 2003.

Digital Library

[4]

P. Barcaccia and M. A. Bonuccelli. Polynomial time optimal algorithms for time slot assignment of variable bandwidth systems. IEEE/ACM Transactions on Networking, 2(3):247--251, June 1994.

Digital Library

[5]

P. Barcaccia, M. A. Bonuccelli, and M. Di Ianni. Complexity of minimum length scheduling for precedence constrained messages in distributed systems. IEEE Transactions on Parallel and Distributed Systems, 11:1090--1102, 2000.

Digital Library

[6]

A. A. Bertossi, G. Bongiovanni, and M. A. Bonuccelli. Time slot assignment in SS/TDMA systems with intersatellite links. IEEE Transactions on Communications, 35:602--608, 1987.

[7]

G. Bongiovanni, D. Coppersmith, and C. K. Wong. An optimal time slot assignment algorithm for a SS/TDMA system with variable number of transponders. IEEE Transactions on Communications, 29:721--726, 1981.

[8]

M. A. Bonuccelli, F. Martelli, and S. Pelagatti. Load balancing in LEO/MEO satellite IP networks. http://www.di.unipi.it/~f.martel/publications.html.

[9]

M. A. Bonuccelli, F. Martelli, and S. Pelagatti. Optimal packet scheduling in tree-structured LEO satellite clusters. Mobile Networks and Applications, 9(4):289--295, August 2004.

Digital Library

[10]

R. E. Burkard. Time-slot assignment for TDMA systems. Computing, 35:99--112, 1985.

Digital Library

[11]

C. S. Chang, W. J. Chen, and H. Y. Huang. Birkhoff-von Neumann input buffered crossbar switches. In INFOCOM 2000, Tel Aviv, Israel, March 26-30 2000.

[12]

C. Chen, E. Ekici, and I. F. Akyildiz. Satellite grouping and routing protocol for LEO/MEO satellite IP networks. In Proceedings of the 5th ACM International Workshop on Wireless Mobile Multimedia, pages 109--116. ACM Press, 2002.

Digital Library

[13]

H. Choi, H. A. Choi, and M. Azizoglu. Efficient scheduling of transmissions in optical broadcast networks. IEEE/ACM Transactions on Networking, 4:913--920, December 1996.

Digital Library

[14]

A. Ganz and Y. Gao. Efficient algorithms for SS/TDMA scheduling. IEEE Transactions on Communications, 8:1367--1374, 1992.

[15]

B. Gavish. LEO/MEO systems - global mobile communication systems. Telecommunication Systems, 8:99--141, 1997.

Digital Library

[16]

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 Transactions on Communications, 30:2475--2481, 1982.

[17]

T. Inukai. SS/TDMA networking via ISL. In ICC'81, pages 70.6.1--70.6.5, 1981.

[18]

F. Jia, B. Mukherjee, and J. Iness. Scheduling variable-length messages in single-hop multichannel local lightwave networks. IEEE/ACM Transactions on Networking, 3:477--489, August 1995.

Digital Library

[19]

J. Lee and S. Kang. Satellite over satellite (SOS) network: A novel architecture for satellite network. In Proceedings of IEEE INFOCOM 2000, pages 315--321, March 2000.

[20]

A. Mekkittikul and N. McKeown. A practical scheduling algorithm to achieve 100% throughput in input-queued switches. In INFOCOM 1998, S. Francisco, March 1998.

Cited By

Benita FMehlitz P(2019)Solving optimal control problems with terminal complementarity constraints via Scholtes' relaxation schemeComputational Optimization and Applications10.1007/s10589-018-0050-y72:2(413-430)Online publication date: 1-Mar-2019
https://dl.acm.org/doi/10.1007/s10589-018-0050-y

Index Terms

An optimal packet scheduling and load balancing algorithm for LEO/MEO satellite networks
1. Networks
  1. Network architectures

Recommendations

Optimal packet scheduling in tree-structured LEO satellite clusters

Clusters of mobile (LEO) satellites, flying at a non-geostationary orbit, have been recently proposed, designed and made operational for achieving a global coverage of roaming users. An example of these is Teledesic. The satellites of these clusters are ...
Satellite grouping and routing protocol for LEO/MEO satellite IP networks
WOWMOM '02: Proceedings of the 5th ACM international workshop on Wireless mobile multimedia

The rapid growth of Internet-based applications pushes broadband satellite networks to carry on IP traffic. In previously proposed connectionless routing schemes in satellite networks, the metrics used to calculate the paths do not reflect the total ...
A survivable routing protocol for two-layered LEO/MEO satellite networks

Due to the rapid development of space communication, satellite networks will be confronted with more complex space environment in future, which poses the important demand on the design of the survivable and efficient routing protocols. Among satellite ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

MSWiM '04: Proceedings of the 7th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems

October 2004

334 pages

ISBN:1581139535

DOI:10.1145/1023663

General Chair:
Simonetta Balsamo
Università Cà Foscari di Venezia
,
Program Chairs:
Carla-Fabiana Chiasserini
Politecnico di Torino
,
Lorenzo Donatiello
Università di Bologna

Copyright © 2004 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 04 October 2004

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

MSWiM04

Sponsor:

MSWiM04: 7th International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems 2004

October 4 - 6, 2004

Venice, Italy

Acceptance Rates

MSWiM '04 Paper Acceptance Rate 45 of 121 submissions, 37%;

Overall Acceptance Rate 398 of 1,577 submissions, 25%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
478
Total Downloads

Downloads (Last 12 months)5
Downloads (Last 6 weeks)1

Reflects downloads up to 08 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Benita FMehlitz P(2019)Solving optimal control problems with terminal complementarity constraints via Scholtes' relaxation schemeComputational Optimization and Applications10.1007/s10589-018-0050-y72:2(413-430)Online publication date: 1-Mar-2019
https://dl.acm.org/doi/10.1007/s10589-018-0050-y

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten