| Author(s): |
Fern Y. Hunt; Vladimir V. Marbukh; |
| Title: |
Dynamic Routing and Congestion Control Through Random Assignment of Routes |
| Published: |
July 15, 2008 |
| Abstract: |
We introduce an algorithm for maximizing utility through congestion control and random allocation of routes to users. The allocation is defined by a probability distribution whose degree of randomness as measured by its entropy, is controlled. We seek to use the entropy to modulate between the two extremes of path specification; minimum cost path selection on one end and equiprobable path allocation on the other. We explore the trade-off between stability and utility in two sample topologies. |
| Proceedings: |
Proceedings of the 5th International Conference on Cybernetics and Information Technologies, Systems and Applications: CITSA 2008 |
| Pages: |
pp. 161 - 164 |
| Location: |
Orlando, FL |
| Dates: |
June 29-July 2, 2008 |
| Keywords: |
cross-layer; TCP/IP algorithms |
| Research Areas: |
Cybersecurity |
| PDF version: |
 Click here to retrieve PDF version of paper (102KB) |
