Access

You are not currently logged in.

Access JSTOR through your library or other institution:

login

Log in through your institution.

If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Journal Article

STATE SPACE COLLAPSE AND DIFFUSION APPROXIMATION FOR A NETWORK OPERATING UNDER A FAIR BANDWIDTH SHARING POLICY

W. N. Kang, F. P. Kelly, N. H. Lee and R. J. Williams
The Annals of Applied Probability
Vol. 19, No. 5 (October 2009), pp. 1719-1780
Stable URL: http://www.jstor.org/stable/25662521
Page Count: 62
Were these topics helpful?
See somethings inaccurate? Let us know!

Select the topics that are inaccurate.

Cancel
  • Read Online (Free)
  • Download ($19.00)
  • Subscribe ($19.50)
  • Add to My Lists
  • Cite this Item
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
STATE SPACE COLLAPSE AND DIFFUSION APPROXIMATION FOR A NETWORK OPERATING UNDER A FAIR BANDWIDTH SHARING POLICY
Preview not available

Abstract

We consider a connection-level model of Internet congestion control, introduced by Massoulié and Roberts [Telecommunication Systems 15 (2000) 185–201], that represents the randomly varying number of flows present in a network. Here, bandwidth is shared fairly among elastic document transfers according to a weighted α-fair bandwidth sharing policy introduced by Mo and Walrand [IEEE/ACM Transactions on Networking 8 (2000) 556–567] [α ϵ (0, ∞)]. Assuming Poisson arrivals and exponentially distributed document sizes, we focus on the heavy traffic regime in which the average load placed on each resource is approximately equal to its capacity. A fluid model (or functional law of large numbers approximation) for this stochastic model was derived and analyzed in a prior work [Ann. Appl. Probab. 14 (2004) 1055–1083] by two of the authors. Here, we use the long-time behavior of the solutions of the fluid model established in that paper to derive a property called multiplicative state space collapse, which, loosely speaking, shows that in diffusion scale, the flow count process for the stochastic model can be approximately recovered as a continuous lifting of the workload process. Under weighted proportional fair sharing of bandwidth (α = 1) and a mild local traffic condition, we show how multiplicative state space collapse can be combined with uniqueness in law and an invariance principle for the diffusion [Theory Probab. Appl. 40 (1995) 1–40], [Ann. Appl. Probab. 17 (2007) 741–779] to establish a diffusion approximation for the workload process and hence to yield an approximation for the flow count process. In this case, the workload diffusion behaves like Brownian motion in the interior of a polyhedral cone and is confined to the cone by reflection at the boundary, where the direction of reflection is constant on any given boundary face. When all of the weights are equal (proportional fair sharing), this diffusion has a product form invariant measure. If the latter is integrable, it yields the unique stationary distribution for the diffusion which has a strikingly simple interpretation in terms of independent dual random variables, one for each of the resources of the network. We are able to extend this product form result to the case where document sizes are distributed as finite mixtures of exponentials and to models that include multi-path routing. We indicate some diffuculties related to extending the diffusion approximation result to values of α ≠ 1. We illustrate our approximation results for a few simple networks. In particular, for a two-resource linear network, the diffusion lives in a wedge that is a strict subset of the positive quadrant. This geometrically illustrates the entrainment of resources, whereby congestion at one resource may prevent another resource from working at full capacity. For a four-resource network with multi-path routing, the product form result under proportional fair sharing is expressed in terms of independent dual random variables, one for each of a set of generalized cut constraints.

Page Thumbnails

  • Thumbnail: Page 
1719
    1719
  • Thumbnail: Page 
1720
    1720
  • Thumbnail: Page 
1721
    1721
  • Thumbnail: Page 
1722
    1722
  • Thumbnail: Page 
1723
    1723
  • Thumbnail: Page 
1724
    1724
  • Thumbnail: Page 
1725
    1725
  • Thumbnail: Page 
1726
    1726
  • Thumbnail: Page 
1727
    1727
  • Thumbnail: Page 
1728
    1728
  • Thumbnail: Page 
1729
    1729
  • Thumbnail: Page 
1730
    1730
  • Thumbnail: Page 
1731
    1731
  • Thumbnail: Page 
1732
    1732
  • Thumbnail: Page 
1733
    1733
  • Thumbnail: Page 
1734
    1734
  • Thumbnail: Page 
1735
    1735
  • Thumbnail: Page 
1736
    1736
  • Thumbnail: Page 
1737
    1737
  • Thumbnail: Page 
1738
    1738
  • Thumbnail: Page 
1739
    1739
  • Thumbnail: Page 
1740
    1740
  • Thumbnail: Page 
1741
    1741
  • Thumbnail: Page 
1742
    1742
  • Thumbnail: Page 
1743
    1743
  • Thumbnail: Page 
1744
    1744
  • Thumbnail: Page 
1745
    1745
  • Thumbnail: Page 
1746
    1746
  • Thumbnail: Page 
1747
    1747
  • Thumbnail: Page 
1748
    1748
  • Thumbnail: Page 
1749
    1749
  • Thumbnail: Page 
1750
    1750
  • Thumbnail: Page 
1751
    1751
  • Thumbnail: Page 
1752
    1752
  • Thumbnail: Page 
1753
    1753
  • Thumbnail: Page 
1754
    1754
  • Thumbnail: Page 
1755
    1755
  • Thumbnail: Page 
1756
    1756
  • Thumbnail: Page 
1757
    1757
  • Thumbnail: Page 
1758
    1758
  • Thumbnail: Page 
1759
    1759
  • Thumbnail: Page 
1760
    1760
  • Thumbnail: Page 
1761
    1761
  • Thumbnail: Page 
1762
    1762
  • Thumbnail: Page 
1763
    1763
  • Thumbnail: Page 
1764
    1764
  • Thumbnail: Page 
1765
    1765
  • Thumbnail: Page 
1766
    1766
  • Thumbnail: Page 
1767
    1767
  • Thumbnail: Page 
1768
    1768
  • Thumbnail: Page 
1769
    1769
  • Thumbnail: Page 
1770
    1770
  • Thumbnail: Page 
1771
    1771
  • Thumbnail: Page 
1772
    1772
  • Thumbnail: Page 
1773
    1773
  • Thumbnail: Page 
1774
    1774
  • Thumbnail: Page 
1775
    1775
  • Thumbnail: Page 
1776
    1776
  • Thumbnail: Page 
1777
    1777
  • Thumbnail: Page 
1778
    1778
  • Thumbnail: Page 
1779
    1779
  • Thumbnail: Page 
1780
    1780