A dynamic scheduling problem in packet switched satellite networks

Tassiulas, L; Papavassiliou, S

dc.contributor.author	Tassiulas, L	en
dc.contributor.author	Papavassiliou, S	en
dc.date.accessioned	2014-03-01T02:48:12Z
dc.date.available	2014-03-01T02:48:12Z
dc.date.issued	1994	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/33632
dc.subject	Dynamic Scheduling	en
dc.subject	Packet Switched	en
dc.subject	Queue Length	en
dc.subject	Queueing Model	en
dc.subject	Satellite Network	en
dc.subject	Cycle Length	en
dc.title	A dynamic scheduling problem in packet switched satellite networks	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1109/CDC.1994.411429	en
heal.identifier.secondary	http://dx.doi.org/10.1109/CDC.1994.411429	en
heal.publicationDate	1994	en
heal.abstract	A queueing model and scheduling methods that eliminate transmission overlaps in time and maximize the weighted throughput of satellite networks are considered. A single server provides service to a set of parallel queues. The service of different customers cannot overlap. The service of queue i may be initiated only at certain time instances {tni}n=1∞ that constitute the transmission opportunity instances	en
heal.journalName	Conference on Decision and Control	en
dc.identifier.doi	10.1109/CDC.1994.411429	en