Show simple item record

dc.contributor.authorDotsenko, Yuri
dc.date.accessioned 2017-08-02T22:02:55Z
dc.date.available 2017-08-02T22:02:55Z
dc.date.issued 2002-04-30
dc.identifier.urihttps://hdl.handle.net/1911/96301
dc.description.abstract This work presents the design, implementation, and evaluation of a simple programming language for expressing scheduling policies for transmission of multiple objects across a shared network connection. A key design component of the language is the ability to express constraints among the objects to be transmitted. Policies can: make ordering constraints, such as "all text objects are transmitted before any image objects''; express rules on the relative bandwidth allocations across objects of different types; reserve a certain amount of bandwidth or restrict transmission of a subset of objects. Because it is possible to express contradictory constraints, the system finds suitable approximate solutions when no precise solution is available.
dc.format.extent 58 pp
dc.language.iso eng
dc.rights You are granted permission for the noncommercial reproduction, distribution, display, and performance of this technical report in any format, but this permission is only for a period of forty-five (45) days from the most recent time that you verified that this technical report is still available from the Computer Science Department of Rice University under terms that include this permission. All other rights are reserved by the author(s).
dc.title Extensible Adaptation via Constraint Solving
dc.type Technical report
dc.date.note April 30, 2002
dc.identifier.digital TR02-396
dc.type.dcmi Text
dc.identifier.citation Dotsenko, Yuri. "Extensible Adaptation via Constraint Solving." (2002) https://hdl.handle.net/1911/96301.


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record