Running in circles : packet routing on ring networks
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2002.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | eng |
| Published: |
Massachusetts Institute of Technology
2005
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/8399 |
| _version_ | 1826207286487416832 |
|---|---|
| author | Bradley, William F. (William Francis), 1973- |
| author2 | F.T. Leighton. |
| author_facet | F.T. Leighton. Bradley, William F. (William Francis), 1973- |
| author_sort | Bradley, William F. (William Francis), 1973- |
| collection | MIT |
| description | Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2002. |
| first_indexed | 2024-09-23T13:46:57Z |
| format | Thesis |
| id | mit-1721.1/8399 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T13:46:57Z |
| publishDate | 2005 |
| publisher | Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/83992019-04-11T06:06:41Z Running in circles : packet routing on ring networks Bradley, William F. (William Francis), 1973- F.T. Leighton. Massachusetts Institute of Technology. Dept. of Mathematics. Massachusetts Institute of Technology. Dept. of Mathematics. Mathematics. Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2002. Includes bibliographical references (p. 151-154) and index. I analyze packet routing on unidirectional ring networks, with an eye towards establishing bounds on the expected length of the queues. Suppose we route packets by a greedy "hot potato" protocol. If packets are inserted by a Bernoulli process and have uniform destinations around the ring, and if the nominal load is kept fixed, then I can construct an upper bound on the expected queue length per node that is independent of the size of the ring. If the packets only travel one or two steps, I can calculate the exact expected queue length for rings of any size. I also show some stability results under more general circumstances. If the packets are inserted by any ergodic hidden Markov process with nominal loads less than one, and routed by any greedy protocol, I prove that the ring is ergodic. by William F. Bradley. Ph.D. 2005-08-23T19:53:17Z 2005-08-23T19:53:17Z 2002 2002 Thesis http://hdl.handle.net/1721.1/8399 50594848 eng M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582 156 p. 11749248 bytes 11749004 bytes application/pdf application/pdf application/pdf Massachusetts Institute of Technology |
| spellingShingle | Mathematics. Bradley, William F. (William Francis), 1973- Running in circles : packet routing on ring networks |
| title | Running in circles : packet routing on ring networks |
| title_full | Running in circles : packet routing on ring networks |
| title_fullStr | Running in circles : packet routing on ring networks |
| title_full_unstemmed | Running in circles : packet routing on ring networks |
| title_short | Running in circles : packet routing on ring networks |
| title_sort | running in circles packet routing on ring networks |
| topic | Mathematics. |
| url | http://hdl.handle.net/1721.1/8399 |
| work_keys_str_mv | AT bradleywilliamfwilliamfrancis1973 runningincirclespacketroutingonringnetworks |