Decentralized control in packet switched satellite communication

Schoute, F.C.

doi:10.1109/tac.1978.1101729

Cited by 36 publications

(11 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Schoute [1] and Varaiya and Walrand [2] investigated MABC under the assumptions that packet collision incurs a cost rather than retransmission and that the queue states are shared between the users with a delay. Grizzle et.…”

Section: B Literature Overviewmentioning

confidence: 99%

“…So, if we could establish this property beforehand, we could use the dynamic programming decomposition for delayed state sharing information structure [16]. In fact, Schoute [1] and Varaiya and Walrand [2] assumed this property while deriving structural properties for their model. However, we could find a direct way of proving this property.…”

Section: B Qualitative Propertiesmentioning

confidence: 99%

See 1 more Smart Citation

Optimal transmission policies for two-user multiple access broadcast using dynamic team theory

Mahajan

2010

2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

View full text Add to dashboard Cite

Optimal transmission policies for a two-user multiple access broadcast channel with binary feedback are investigated. The system is modeled as a dynamic team. Conditioned on the channel feedback, the past history of buffer states is redundant to each user. Once this redundant data is removed, the information structure, although non-classical, satisfies the sufficient conditions of Mahajan, Nayyar, and Teneketzis, 2008 for a dynamic team problem to be tractable. Using the idea of a virtual coordinator of Mahajan, Nayyar, and Teneketzis, a dynamic programming decomposition is presented. This dynamic program is defined over a countable state space and a finite action space. When the arrival rates of both users are symmetric, an optimal policy is identified by solving the dynamic program analytically. This policy matches the optimal window protocol proposed by Hluchyj and Gallager, 1981. Thus, this paper presents the an example of a non-trivial dynamic team with nonlinear dynamics where an exact analytic solution is obtained.

show abstract

Section: B Literature Overviewmentioning

confidence: 99%

Section: B Qualitative Propertiesmentioning

confidence: 99%

Optimal transmission policies for two-user multiple access broadcast using dynamic team theory

Mahajan

2010

2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

View full text Add to dashboard Cite

show abstract

“…This situation arises in team problems with special information structure (see [16,22]), and in control problems with a random environment [4, 14, 151. (iii) Coupling of the dp equation with other linear equations. This occurred in equations describing the time evolution of free choice Petri-nets (which are useful for the modeling of parallel computing), see [7].…”

Section: Altman and Koolementioning

confidence: 99%

On submodular value functions and complex dynamic programming

Altman

Koole

1998

Communications in Statistics. Stochastic Models

View full text Add to dashboard Cite

We investigate in this paper submodular value functions using complex dynamic programming. In complex dynamic programming (dp) we consider concatenations and linear combinations of standard dp operators, as well as combinations of maximizations and minimizations. These value functions have many applications and interpretations, both in stochastic control (and stochastic zero-sum games) as well as in the analysis of (noncontrolled) discrete-event dynamic systems. The submodularity implies the monotonicity of the selectors appearing in the dp equations, which translates, in the context of stochastic control and stochastic games, to monotone optimal policies. Our work is based on the score-space approach of Glasserman and Yao.

show abstract

“…Similar problems have also been treated in control theory journals [6], [7], [8], indeed such systems are nice examples of distributed control. Algorithms similar to the ones presented here have also been derived independently by Tsybakov and Mikhailov [9].…”

mentioning

confidence: 93%

A Class of Efficient Contention Resolution Algorithms for Multiple Access Channels

Mosely

Humblet

1985

IEEE Trans. Commun.

105

View full text Add to dashboard Cite

A discrete time multiaccess channel is considered where the outcome of a transmission is either "idle", "success" or "collision", depending on the number of users transmitting simultaneously. Messages involved in a "collision" must be retransmitted. An efficient access allocation policy is developed for the case where infinitely many sources generate traffic in aPoisson manner and can all observe the outcomes of the previous transmissions.Its rate of successs is 0.48776. Modifications are presented for the cases where the transmission times depend on the transmission outcomes and where observations are noisy.

show abstract

Decentralized control in packet switched satellite communication

Cited by 36 publications

References 6 publications

Optimal transmission policies for two-user multiple access broadcast using dynamic team theory

Optimal transmission policies for two-user multiple access broadcast using dynamic team theory

On submodular value functions and complex dynamic programming

A Class of Efficient Contention Resolution Algorithms for Multiple Access Channels

Contact Info

Product

Resources

About