Scheduling in Communication Networks: Inherent Limitations and Analytical Tools, Ph.D. Dissertation Sharif University of Technology ; Golestani, Jamaloddin (Supervisor)
Abstract
Scheduling algorithms are responsible for allocation of various types of resources, interference management, and choosing the times and paths through which messages are to be delivered in a communication network. We consider certain fundamental problems in network scheduling. Any scheduling algorithm, to be practical, must have tractable computational complexity and tolerable delay. In the first part of the thesis, we address the following question: “for a given class of networks, does there exist a scheduling algorithm that performs polynomially many computations (in terms of the network dimensions), while keeping the expected delay of the network polynomially bounded (again in terms of the...
Cataloging briefScheduling in Communication Networks: Inherent Limitations and Analytical Tools, Ph.D. Dissertation Sharif University of Technology ; Golestani, Jamaloddin (Supervisor)
Abstract
Scheduling algorithms are responsible for allocation of various types of resources, interference management, and choosing the times and paths through which messages are to be delivered in a communication network. We consider certain fundamental problems in network scheduling. Any scheduling algorithm, to be practical, must have tractable computational complexity and tolerable delay. In the first part of the thesis, we address the following question: “for a given class of networks, does there exist a scheduling algorithm that performs polynomially many computations (in terms of the network dimensions), while keeping the expected delay of the network polynomially bounded (again in terms of the...
Find in contentBookmark
|
|