| dc.contributor |
Draper, Stark Christiaan. |
|
| dc.date |
2004-03-02T18:26:15Z |
|
| dc.date |
2004-03-02T18:26:15Z |
|
| dc.date |
2002 |
|
| dc.date |
2002 |
|
| dc.date.accessioned |
2013-10-09T02:34:01Z |
|
| dc.date.available |
2013-10-09T02:34:01Z |
|
| dc.date.issued |
2013-10-09 |
|
| dc.identifier |
http://hdl.handle.net/1721.1/4107 |
|
| dc.identifier.uri |
http://koha.mediu.edu.my:8181/xmlui/handle/1721 |
|
| dc.description |
(cont.) We also explore the interactions between source coding and queue management in problems of buffering and distributing distortion-tolerant data. We formulate a general queuing model relevant to numerous communication scenarios, and develop a bound on the performance of any algorithm. We design an adaptive buffer-control algorithm for use in dynamic environments and under finite memory limitations; its performance closely approximates the bound. Our design uses multiresolution source codes that exploit the data's distortion-tolerance in minimizing end-to-end distortion. Compared to traditional approaches, the performance gains of the adaptive algorithm are significant - improving distortion, delay, and overall system robustness. |
|
| dc.description |
by Stark Christiaan Draper. |
|
| dc.description |
Supervised by Gregory W. Wornell. |
|
| dc.description |
Also issued as Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2002. |
|
| dc.description |
Includes bibliographical references (p. 159-165). |
|
| dc.format |
165 p. |
|
| dc.format |
10665234 bytes |
|
| dc.format |
application/pdf |
|
| dc.language |
eng |
|
| dc.relation |
Technical report (Massachusetts Institute of Technology. Research Laboratory of Electronics) ; 661. |
|
| dc.title |
Successive structuring of source coding algorithms for data fusion, buffering, and distribution in networks |
|