A Method for Estimating the Proportion of Nonresponsive Traffic at a Router

Zhao, Zhili; Darbha, Swaroop; Reddy, A. L. Narasimha

doi:10.1109/tnet.2004.833149

Cited by 24 publications

(9 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…TCP currently carries the great majority [50] of network traffic and it is therefore important to investigate the support of the AFR scheme for TCP traffic. Important features of TCP include the fact that traffic is i) elastic, and so achieved throughput is related to network capacity, and ii) two-way, and while TCP data packets are typically large, TCP ACKs are small packets, so it may be difficult to aggregate enough of them to form a large frame.…”

Section: B Tcp Trafficmentioning

confidence: 99%

Aggregation With Fragment Retransmission for Very High-Speed WLANs

Malone

et al. 2009

IEEE/ACM Trans. Networking

157

141

View full text Add to dashboard Cite

Abstract-In upcoming very high-speed wireless LANs (WLANs), the physical (PHY) layer rate may reach 600 Mbps. To achieve high efficiency at the medium access control (MAC) layer, we identify fundamental properties that must be satisfied by any CSMA-/CA-based MAC layers and develop a novel scheme called aggregation with fragment retransmission (AFR) that exhibits these properties. In the AFR scheme, multiple packets are aggregated into and transmitted in a single large frame. If errors happen during the transmission, only the corrupted fragments of the large frame are retransmitted. An analytic model is developed to evaluate the throughput and delay performance of AFR over noisy channels and to compare AFR with similar schemes in the literature. Optimal frame and fragment sizes are calculated using this model. Transmission delays are minimized by using a zero-waiting mechanism where frames are transmitted immediately once the MAC wins a transmission opportunity. We prove that zero-waiting can achieve maximum throughput. As a complement to the theoretical analysis, we investigate the impact of AFR on the performance of realistic application traffic with diverse requirements by simulations. We have implemented the AFR scheme in the NS-2 simulator and present detailed results for TCP, VoIP, and HDTV traffic.The AFR scheme described was developed as part of the IEEE 802.11n working group work. The analysis presented here is general enough to be extended to proposed schemes in the upcoming 802.11n standard. Trends indicated in this paper should extend to any well-designed aggregation schemes.Index Terms-IEEE 802.11, IEEE 802.11n, medium access control (MAC), wireless LAN (WLAN).

show abstract

Section: B Tcp Trafficmentioning

confidence: 99%

Aggregation With Fragment Retransmission for Very High-Speed WLANs

Malone

et al. 2009

IEEE/ACM Trans. Networking

157

141

View full text Add to dashboard Cite

show abstract

“…This is of key importance since the vast majority of network traffic is TCP (for both wired [36] and wireless networks [32]). …”

Section: Tcp Trafficmentioning

confidence: 99%

“…We demonstrate the efficacy of this approach with both NS simulations and test-bed implementation. Since TCP currently carries the vast majority of network traffic (in both wired [36] and wireless networks [32]) it is important to investigate the performance of the proposed scheme with TCP, we consider both CBR and TCP traffic in this paper.…”

Section: Introductionmentioning

confidence: 99%

Achieving End-to-end Fairness in 802.11e Based Wireless Multi-Hop Mesh Networks Without Coordination

Leith

Badarla

et al. 2009

Mobile Netw Appl

View full text Add to dashboard Cite

To mitigate the damaging impacts caused by interference and hidden terminals, it has been proposed to use orthogonal channels in wireless multi-hop mesh networks. We demonstrate however that even if these issues are completely eliminated with perfectly assigned channels, gross unfairness can still exist amongst competing flows which traverse multiple hops. We propose the use of 802.11e's TXOP mechanism to restore/enforce fairness. The proposed scheme is simple, implementable using off-the-shelf devices and fully decentralised (requires no message passing).

show abstract

“…Most traffic in communication networks is carried using the TCP protocol (85 -90% of all Internet traffic is TCP-traffic [11]). The standard TCP protocol (introduced by [12]) is a special case of additive-increase multiplicative decrease (AIMD) congestion control.…”

Section: Brief Description Of Aimd Congestion Control Algorithmsmentioning

confidence: 99%

Tools for the analysis and design of communication networks with Markovian dynamics

Leizarowitz

Stanojevic

Shorten

2006

IEE Proceedings - Control Theory and Applications

View full text Add to dashboard Cite

Abstract:The stochastic properties of a class of communication networks whose dynamics are Markovian are analysed. The asymptotic behaviour of such a network in terms of the first and second moments of a stochastic process that describes the network dynamics is characterised and tools for their calculation are provided. Specifically, computation techniques for the calculation of these statistics are provided and that these algorithms converge exponentially fast is shown. Finally, how the results may be used for the design of network routers to realise networks with desired statistical properties is suggested. Introduction General remarksThe study of communication networks that carry transmission control protocol (TCP) traffic has been subject of intense interest in the computer science, network engineering, and applied mathematics literature [1 -9]. The principal motivation for much of this work has been to understand network behaviour, and to characterise important network properties with a view to developing analytic tools for the design of such networks. In particular, much of this work has focussed on understanding the manner in which the network allocates available bandwidth among competing network flows (network fairness) and the speed at which this bandwidth allocation takes place (network convergence rate). Recently, a very accurate random matrix model of TCP network dynamics was proposed [10]. This model was shown to be capable of capturing many essential features of networks in which TCP-like network flows compete for bandwidth via a bottleneck router. By making some simplifying assumptions concerning stochastic behaviour of the network, the authors demonstrate that this model may also be used as a basis to design networks in which bandwidth can be allocated in an arbitrary manner among competing flows. This may be achieved by redesigning the manner in which individual sources respond to network congestion, or by redesigning the manner in which network routers respond to network congestion (or both).The objective of this paper is to pursue further this line of research. However, rather than using the model as a basis for adjusting the behaviour of the individual flows to achieve desired network behaviour, we concentrate here on using this model to redesign the manner in which the bottleneck router drops packets when the network is congested; in particular, we analyse the properties of such networks when the bottleneck router drops packets according to some Markovian rules. Redesigning the manner in which network routers operate to allocate bandwidth is very important for a number of reasons related to network quality of service issues. Whereas the results in [10] are interesting from a theoretical perspective, router redesign along the lines suggested by this work would place an impossible computational burden on the network routers; on the other hand, dropping packets according to some Markovian rule could possibly be implemented using far fewer computational resources. Our principal contribution in t...

show abstract

A Method for Estimating the Proportion of Nonresponsive Traffic at a Router

Cited by 24 publications

References 15 publications

Aggregation With Fragment Retransmission for Very High-Speed WLANs

Aggregation With Fragment Retransmission for Very High-Speed WLANs

Achieving End-to-end Fairness in 802.11e Based Wireless Multi-Hop Mesh Networks Without Coordination

Tools for the analysis and design of communication networks with Markovian dynamics

Contact Info

Product

Resources

About