An Optimal Switching Algorithm for Multibeam Satellite Systems with Variable Bandwidth Beams

Gopal, I.; Bongiovanni, G.; Bonuccelli, Maurizio A.; Tang, Deng; Wong, Carmen

doi:10.1109/tcom.1982.1095433

Cited by 70 publications

(15 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…As this case is similar to, in fact much simpler than, the previous case and as, indeed, this is the case considered by Gopal et al [7] and Gopal [8], we begin with the statement of the algorithm. …”

Section: An Algorithm For Computing An Optimum Schedule Given That Tmentioning

confidence: 78%

“…As will be seen, our approach provides a unified method to attack the various cases of our scheduling problem even when t~ ~ 0. Furthermore, it leads to a polynomial time algorithm in which the upper bound on the number of communication modes is tighter than the case given in [7] and [8]. As a by-product of this work we state what seems to be a complete generalization of the Birkhott-von Neumann theorem.…”

Section: Digraph D(v' E') Edge E = (Xi Yj) Is In E(g) If and Only mentioning

confidence: 78%

“…Various special cases of this problem have been studied previously [2]- [6]. A general approach to the problem when speed-up is allowed is provided by Gopal et al [7] and Gopal [8]. The authors [3]- [8] were motivated by the application to the Satellite-Switched Time Division Multiple Access (SS/TDMA) data communication [9], [10].…”

Section: Digraph D(v' E') Edge E = (Xi Yj) Is In E(g) If and Only mentioning

confidence: 99%

See 2 more Smart Citations

Data transfers in networks

Choi

Hakimi

1988

Algorithmica

View full text Add to dashboard Cite

Abstract. The scheduling of the transfer of backlogged data in a network to minimize the finishing time is studied. The most complete treatment (of a version) of the problem is due to Gopal, Bongiovanni, Bonucelli, Tang, and Wong, who attacked the problem using the Birkhoff-von Neumann theorem. However, these authors do not provide a complexity analysis of their algorithm 9 9 In this paper we solve the version of these authors as well as a more difficult version of this scheduling problem by formulating them as a continuous form of the Hakimi-Kariv-de Werra generalization of the edge-coloring problem in bipartite graphs. This leads to polynomial time algorithms for these problems. Furthermore, our solution of the previously solved version has the desirable feature of having a tighter bound for the number of "communication modes" than the solution of the above authors.In the above scheduling problem, there may be a time associated with changing from one set of simultaneous data transfers (i.e., a communication mode) to another. It is shown that if the overall finishing time of our schedule includes these times, then even very simple instances of our problem become NP-hard. However, approximation algorithms are presented which produce solutions whose finishing times are at most twice the optimal.Finally, in the above scheduling problem the interruption (or pre-emption) of the performance of each task is permitted. Essentially, the same problem when pre-emption is not permitted was studied by Coffman, Garey, Johnson, and LaPaugh. The relation between the two problems are explored.

show abstract

Section: An Algorithm For Computing An Optimum Schedule Given That Tmentioning

confidence: 78%

Section: Digraph D(v' E') Edge E = (Xi Yj) Is In E(g) If and Only mentioning

confidence: 78%

Section: Digraph D(v' E') Edge E = (Xi Yj) Is In E(g) If and Only mentioning

confidence: 99%

See 1 more Smart Citation

Data transfers in networks

Choi

Hakimi

1988

Algorithmica

View full text Add to dashboard Cite

show abstract

“…Crescenzi et al demonstrate that it cannot be approximated by a polynomial algorithm within a factor less than 7 6 [19]. For small values of τ the problem can be closely approximated by the minimization of T x , which is solvable in polynomial time [20][21][22]. The minimum traffic transmission time is [23]:…”

Section: Problemmentioning

confidence: 99%

Minimum Rejection Scheduling in All-Photonic Networks

Saberi

Coates

2006

2006 3rd International Conference on Broadband Communications, Networks and Systems

View full text Add to dashboard Cite

Internal switches in all-photonic networks do not perform data conversion into the electronic domain, thereby eliminating a potential capacity bottleneck, but the inability to perform efficient optical buffering introduces network scheduling challenges. In this paper we focus on the problem of scheduling fixed-length frames in allphotonic star-topology networks with the goal of minimizing rejected demand. We formulate the task as an optimization problem and characterize its complexity. We describe the Minimum Rejection Algorithm (MRA), which minimizes total rejection, and demonstrate that the Fair Matching Algorithm (FMA) minimizes the maximum percentage rejection of any connection. We analyze through OPNET simulation the rejection and delay performance.

show abstract

“…(Additional overhead such as guard time and bit recovery time is associated with each burst [6], but in the literature this is assumed to be included in the demand traffic matrix entries.) The minimization of F has been the object of much research work ( [1,3,[7][8][9][10], among others). Depending on the given priorities, D may be minimized first and the number m of switching configurations subsequently, or vice versa (see [9] for the interrelationship).…”

Section: Introductionmentioning

confidence: 99%

Improved TDM switching assignments for variable and fixed burst length

Kagaris

2006

Satell Commun Network

View full text Add to dashboard Cite

SUMMARYIn this paper we present two algorithms for improved satellite-switched TDM slot assignments of N Â N traffic matrices under K transponders/carriers (simultaneous connections), 14K4N: The first algorithm applies to data switching with variable burst length and achieves optimum transmission time with a significantly lower number of switching configurations than a previously proposed algorithm, while still having the same time complexity ðOðN 4 ÞÞ: Experimental results demonstrate the advantage. The second algorithm applies to the case of fixed burst length and offers a faster complexity of OðL Á N 2 Þ; where L is the minimum transmission time, at the cost of occasionally missing the minimum. Extensive simulations indicate that the difference from the minimum is rare and is at most one. They also show that the presented algorithm even improves a previous one which was proposed for the fixed burst length case and has the same time complexity but uses K ¼ N:

show abstract

An Optimal Switching Algorithm for Multibeam Satellite Systems with Variable Bandwidth Beams

Cited by 70 publications

References 9 publications

Data transfers in networks

Data transfers in networks

Minimum Rejection Scheduling in All-Photonic Networks

Improved TDM switching assignments for variable and fixed burst length

Contact Info

Product

Resources

About