Two-way TCP traffic over rate controlled channels: effects and analysis

Kalampoukas, Lampros; Varma, A.; Ramakrishnan, K. K.

doi:10.1109/90.748085

Cited by 17 publications

(9 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Research has shown that local area network traffic is much better modeled by a self-similar process [38][39][40] rather than a Poisson distribution. Self-similar traffic pattern over a wide range of time scale has a similar form to that of the traffic pattern over a short time scale.…”

Section: Modeling Assumptions and Notationsmentioning

confidence: 99%

“…Here we assume that g(i) increases and decreases linearly [1] and periodically [40]. During this period, the change in average queue length must be large enough to capture the long-term behavior of network congestion.…”

Section: Upper Bound Of Wmentioning

confidence: 99%

“…As the short-term queue size variation can be described by an ON-OFF model [40], f (i) can be expressed as…”

Section: Lower Bound Of Wmentioning

confidence: 99%

See 2 more Smart Citations

A framework to determine the optimal weight parameter of RED in next‐generation Internet routers

Zheng¹,

Atiquzzaman²

2008

Int J Communication

View full text Add to dashboard Cite

SUMMARYActive buffer management can improve the performance of Transmission Control Protocol/Internet Protocol-based networks. Random early detection (RED), an active queue management scheme, has been proposed by the Internet Engineering Task Force for next-generation Internet routers. RED uses a number of parameters, such as buffer thresholds, a packet drop probability and a weight parameter. RED suffers from low throughput and large delay/jitter and induces instability in networks. Previous attempts to improve the performance of RED were based on modifying the thresholds and drop probabilities. In this paper, we show that an optimal value of the weight parameter can improve the performance of RED, and then develop a framework to determine the optimal value of the weight parameter. We show that the optimal weight parameter obtained from our framework improves the performance of RED.

show abstract

Section: Modeling Assumptions and Notationsmentioning

confidence: 99%

Section: Upper Bound Of Wmentioning

confidence: 99%

See 1 more Smart Citation

A framework to determine the optimal weight parameter of RED in next‐generation Internet routers

Zheng¹,

Atiquzzaman²

2008

Int J Communication

View full text Add to dashboard Cite

show abstract

“…Therefore, ACK packet and data packet are mixed in one link, which can result in the ACK compression [7]. Moreover, asymmetric link can affect TCP flow's performance [2].…”

Section: Introductionmentioning

confidence: 99%

Network utility maximization in two-way flow scenario

Tan

2014

SIGCOMM Comput. Commun. Rev.

View full text Add to dashboard Cite

A communication network usually has data packets and acknowledge (ACK) packets being transmitted in opposite directions. ACK packet flows may affect the performance of data packet flows, which is unfortunately not considered in the usual network utility maximization (NUM) model. This paper presents a NUM model in networks with two-way flows (NUMtw) by adding a routing matrix to cover ACK packet flows. The source rates are obtained by solving the dual model and the relation to the routing matrix of ACK packet flows is disclosed. Furthermore, the source rates in networks with one-way flows by the usual NUM model are compared to those in networks with two-way flows by the NUMtw model.

show abstract

“…7 also TCP acknowledgements acks are sent o ver loaded links, where they may be delayed or lost. This can also lead ack compression 14 . Furthermore a large number of TCP connections is considered.…”

Section: Introductionmentioning

confidence: 99%

<title>Influence of the ATM service category on TCP performance in large networks</title>

1999

View full text Add to dashboard Cite

Future high-speed networks will be very complex and use many sophisticated tra c control mechanisms. This paper investigates the performance of interactive TCP services over large scale ATM networks with many TCP connections by means of simulation. A simulation environment has been developed, which allows the automatic creation of large simulation scenarios on the basis of a tabular description. The network under study consists of 8 ATM switches, interconnected by a mesh of ATM links and attached Fast Ethernet LANs with TCP end systems. The switches allow CBR, VBR.1, VBR.3 and UBR tra c. To separate di erent tra c streams, Weighted Fair Queueing has been used. In the case of congestion Virtual Queue Discard allows to discard low priority cells. Furthermore the in uence of EPD and PPD has been investigated. All tra c control mechanisms are used in combination, which causes interactions between several algorithms. Data packets as well as TCP acknowledgements ow o ver congested links. The results showgoodoverall performance but unfairness for the service category UBR. For small bu er size the performance decreases and the unfairness increases. As CBR does not allow for multiplexing gain, VBR.1 is better suited than CBR for interactive TCP services. TCP cannot bene t from using VBR.3. For competing VBR.3 streams no guarantees can be given on frame level. Using PPD has a positive impact on performance, however additionally using EPD has only a small impact. In a tra c mix of VBR.3 and UBR tra c, VBR.3 tra c can be transported without QoS degradation. UBR is able to use the remaining bandwidth, but in an unfair manner.

show abstract

Two-way TCP traffic over rate controlled channels: effects and analysis

Cited by 17 publications

References 11 publications

A framework to determine the optimal weight parameter of RED in next‐generation Internet routers

A framework to determine the optimal weight parameter of RED in next‐generation Internet routers

Network utility maximization in two-way flow scenario

<title>Influence of the ATM service category on TCP performance in large networks</title>

Contact Info

Product

Resources

About