Loading...
Please wait, while we are loading the content...
Similar Documents
Optimal throughput-delay scaling in wireless networks—part I: the fluid model (2006)
| Content Provider | CiteSeerX |
|---|---|
| Author | Gamal, Abbas El Mammen, James Prabhakar, Balaji Shah, Devavrat |
| Abstract | Abstract — In previous work (2004), we characterized the optimal throughput-delay trade-off in static wireless networks as D(n) = Θ(nT (n)), where D(n) and T (n) are the average packet delay and throughput in a network of n nodes, respectively. While this trade-off captured the essential network dynamics, packets needed to scale down with the network size. In this “fluid model”, no buffers were required. Due to this packet scaling, D(n) did not correspond to the average delay per bit. That led to the question whether the trade-off remains the same when the packet size is kept constant, which necessitates buffers and packet scheduling in the network. In this paper, we answer this question in the affirmative by showing that the optimal throughput-delay trade-off is still D(n) = Θ(nT (n)), where now D(n) is the average delay per bit. Packets of constant size necessitate the use of buffers in the |
| File Format | |
| Journal | IEEE Trans. Inform. Theory |
| Language | English |
| Publisher Date | 2006-01-01 |
| Access Restriction | Open |
| Subject Keyword | Fluid Model Wireless Network Part Optimal Throughput-delay Scaling Optimal Throughput-delay Trade-off Average Delay Packet Scaling Network Size Static Wireless Network Constant Size Necessitate Essential Network Dynamic Average Packet Delay Previous Work Packet Size Packet Scheduling |
| Content Type | Text |
| Resource Type | Article |
