Randomized adaptive video on demand

dc.contributor.author	Μπούρας, Χρήστος	el
dc.contributor.author	Καπούλας, Βαγγέλης	el
dc.contributor.author	Πάντζιου, Γραμματή Ε.	el
dc.contributor.author	Σπυράκης, Παύλος	el
dc.date.accessioned	2015-05-28T19:38:12Z
dc.date.issued	2015-05-28
dc.identifier.uri	http://hdl.handle.net/11400/11454
dc.rights	Αναφορά Δημιουργού-Μη Εμπορική Χρήση-Όχι Παράγωγα Έργα 3.0 Ηνωμένες Πολιτείες	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/us/	*
dc.source	http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.28.6368	en
dc.subject	βίντεο κατα παραγγελία
dc.subject	ερευνητικό σχέδιο
dc.subject	κανάλια
dc.subject	ταινίες
dc.subject	Video on Demand
dc.subject	Research project
dc.subject	channels
dc.subject	movies
dc.title	Randomized adaptive video on demand	en
heal.type	conferenceItem
heal.classification	Επιστήμες
heal.classification	Πληροφορική
heal.classification	Science
heal.classification	Computer science
heal.classificationURI	N/A-Επιστήμες
heal.classificationURI	N/A-Πληροφορική
heal.classificationURI	http://skos.um.es/unescothes/C03532
heal.classificationURI	http://skos.um.es/unescothes/C00750
heal.identifier.secondary	DOI: 10.1.1.28.6368
heal.dateAvailable	10000-01-01
heal.language	en
heal.access	forever
heal.recordProvider	Τεχνολογικό Εκπαιδευτικό Ίδρυμα Αθήνας. Σχολή Τεχνολογικών Εφαρμογών. Τμήμα Μηχανικών Πληροφορικής Τ.Ε.	el
heal.bibliographicCitation	Bouras, C., Kapoulas, V., Pantziou, G. and Spirakis, P. (1996) Randomized Adaptive Video on Demand. Proceedings of Principles of Distributed Computing - PODC'96.	en
heal.abstract	Necessary to be known by this variation of our method. We believe that the assumption on a skewed distribution of movie requests is a pragmatic one. The model considered here follows [AGH, 95], as far as the architecture is concerned. Assume, that the distribution p() of movie requests is known. Our scheduler S divides (initially) the channels according to p(), so that channels in partition C i will be used for movies to beseenby at least i users on average. The goal is to allocate channels in a way which optimizes channel revenue and reduces unused channels. S puts the arriving requests to the movie queues: When a request for movie m j is done, it is inserted into Q j . When 3 Work supported in part by the ESPRIT II Basic Research project GEPPCOM under contract No. 7141, and by the IT Long Term Research project ALCOM-IT under contract No.	en
heal.fullTextAvailability	true
heal.conferenceName	Proceedings of Principles of Distributed Computing - PODC'96	en
heal.conferenceItemType	short paper
heal.dateCreated	1996