Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

CDC

2009

IEEE

2009

IEEE

—Designing efﬁcient scheduling algorithms is an important problem in a general class of networks with resourcesharing constraints, such as wireless networks and stochastic processing networks. In [4], we proposed a distributed scheduling algorithm that can achieve the maximal throughput in such networks under certain conditions. This algorithm was inspired by CSMA (Carrier Sense Multiple Access). In this paper, we prove the convergence and stability of the algorithm, with properly-chosen step sizes and update intervals. Convergence of the joint scheduling and congestion control algorithm for utility maximization in [4] can be proved similarly.

Related Content

Added |
21 Jul 2010 |

Updated |
21 Jul 2010 |

Type |
Conference |

Year |
2009 |

Where |
CDC |

Authors |
Libin Jiang, Jean C. Walrand |

Comments (0)