Packet scheduling in networks with quality of service constraints has been extensively studied as a single criterion scheduling problem. The assumption underlying single criterion ...
— Most application data units are too large to be carried in a single packet (or cell) and must be segmented for network delivery. To an application, the end-to-end delays and lo...
—In 3G data networks, network operators would like to balance system throughput while serving users in a fair manner. This is achieved using the notion of proportional fairness. ...
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
We consider the energy consumed in radio transmission of a set of sensors forming a data gathering wireless network. Our objective is to enhance the lifetime of such networks by e...
Samar Agnihotri, Pavan Nuggehalli, H. S. Jamadagni