Dynamic Packet Scheduler Optimization in Wireless Relay Networks

Details Dynamic Packet Scheduler Optimization in Wireless Relay Networks Dynamic Packet Scheduler Optimization in Wireless Relay Networks

2011-04-15

arxiv.org/abs/1104.3165v1

Computer Science

Networking and Internet Architecture

30 pages, one figure, submitted to JSAC

Scientific paper

In this work, we investigate the optimal dynamic packet scheduling policy in a wireless relay network (WRN). We model this network by two sets of parallel queues, that represent the subscriber stations (SS) and the relay stations (RS), with random link connectivity. An optimal policy minimizes, in stochastic ordering sense, the process of cost function of the SS and RS queue sizes. We prove that, in a system with symmetrical connectivity and arrival distributions, a policy that tries to balance the lengths of all the system queues, at every time slot, is optimal. We use stochastic dominance and coupling arguments in our proof. We also provide a low-overhead algorithm for optimal policy implementation.

Affiliated with

Also associated with

No associations

Rating

Dynamic Packet Scheduler Optimization in Wireless Relay Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Dynamic Packet Scheduler Optimization in Wireless Relay Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic Packet Scheduler Optimization in Wireless Relay Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-346333