Router response to traffic at a bottleneck link

Paredes-Farrera, M.; Fleury, Martin; Ghanbari, M.

doi:10.1109/tridnt.2006.1649125

Cited by 6 publications

(5 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The latter concern is described in [12], and it happens because the CPU load of the network device depends on the number of TCP packets to process but not on packet size. Such condition is more frequently observed on high-speed networks [11], since the increase of data throughput increases the number of the TCP ACK packets on the network [13].…”

Section: Related Workmentioning

confidence: 99%

TCP Acknowledgment Optimization in Low Power and Embedded Devices

2021

View full text Add to dashboard Cite

Paper investigates transport control protocol (TCP) acknowledgment (ACK) optimization in low power or embedded devices to improve their performance on high-speed links by limiting the ACK rate. Today the dominant protocol for interconnecting network devices is the TCP and it has a great influence on the entire network operation if the processing power of network devices is exhausted to the processing data from the TCP stack. Therefore, on high-speed not congested networks the bottleneck is no longer the network link but low-processing power network devices. A new ACK optimization algorithm has been developed and implemented in the Linux kernel. Proposed TCP stack modification minimizes the unneeded technical expenditure from TCP flow by reducing the number of ACKs. The results of performed experiments show that TCP ACK rate limiting leads to the noticeable decrease of CPU utilization on low power devices and an increase of TCP session throughput but does not impact other TCP QoS parameters, such as session stability, flow control, connection management, congestion control or compromises link security. Therefore, more resources of the low-power network devices could be allocated for high-speed data transfer.

show abstract

Section: Related Workmentioning

confidence: 99%

TCP Acknowledgment Optimization in Low Power and Embedded Devices

2021

View full text Add to dashboard Cite

show abstract

“…Basically there are two network streams which compete for network capacity you create heterogeneous network environment. Reduction of the TCP overhead not only reduce the load to network nodes and channels but also decrease electronic system utilization of network nodes (Paredes-Farrera et al 2006). In some cases the reduction of TCP overhead can reduce the load off all network and even eliminate the CPU bottleneck in some network devices or end systems.…”

Section: Heterogeneous Networkmentioning

confidence: 99%

Performance Investigation of Data Packets Transport Control Protocol in Heterogeneous Networks

Statkus¹

2017

View full text Add to dashboard Cite

Disertacija rengta 2010-2017 metais Vilniaus Gedimino technikos universitete. Vadovas prof. dr. Šarūnas PAULIKAS (Vilniaus Gedimino technikos universitetas, elektros ir elektronikos inžinerija-01T). Vilniaus Gedimino technikos universiteto Elektros ir elektronikos inžinerijos mokslo krypties disertacijos gynimo taryba: Pirmininkas prof. dr. Dalius NAVAKAUSKAS (Vilniaus Gedimino technikos universitetas, elektros ir elektronikos inžinerija-01T). Nariai: doc. dr. Lina NARBUTAITĖ (Kauno technologijos universitetas, elektros ir elektronikos inžinerija-01T), doc. dr. Nerijus PAULAUSKAS (Vilniaus Gedimino technikos universitetas, elektros ir elektronikos inžinerija-01T), prof. habil. dr. Valeri SKLIAROV (Aveiro universitetas, Portugalija, elektros ir elektronikos inžinerija-01T), prof. dr. Vytautas URBANAVIČIUS (Vilniaus Gedimino technikos universitetas, elektros ir elektronikos inžinerija-01T). Disertacija bus ginama viešame Elektros ir elektronikos inžinerijos mokslo krypties disertacijos gynimo tarybos posėdyje 2017 m. rugpjūčio 29 d. 10 val. Vilniaus Gedimino technikos universiteto senato posėdžių salėje.

show abstract

“…Especially in the wide-area network, but also in data centers, link capacities are a scarce resource: indeed, widearea traffic is one of the fastest growing traffic aggregates [17]. However, also the routers themselves come with capacity constraints, both in terms of memory (size of TCAM) as well as CPU: for example, the CPU utilization has been shown to depend on the packet rate [30]. Accordingly, a natural question to ask is: Can A communicate at rate at least r to B?…”

Section: Capacitated Reachabilitymentioning

confidence: 99%

WNetKAT: A Weighted SDN Programming and Verification Language

Larsen,

Schmid,

Xue

2016

Preprint

View full text Add to dashboard Cite

Programmability and verifiability lie at the heart of the software-defined networking paradigm. While Open-Flow and its match-action concept provide primitive operations to manipulate hardware configurations, over the last years, several more expressive network programming languages have been developed. This paper presents WNetKAT, the first network programming language accounting for the fact that networks are inherently weighted, and communications subject to capacity constraints (e.g., in terms of bandwidth) and costs (e.g., latency or monetary costs). WNetKAT is based on a syntactic and semantic extension of the NetKAT algebra. We demonstrate several relevant applications for WNetKAT, including cost-and capacity-aware reachability, as well as quality-of-service and fairness aspects. These applications do not only apply to classic, splittable and unsplittable (s, t)-flows, but also generalize to more complex network functions and service chains. For example, WNetKAT allows to model flows which need to traverse certain waypoint functions, which may change the traffic rate. This paper also shows the relation between the equivalence problem of WNetKAT and the equivalence problem of the weighted finite automata, which implies undecidability of the former. However, this paper also succeeds to prove the decidability of another useful problem, which is sufficient in many practical scnearios: whether an expression equals to 0. Moreover, we initiate the discussion of decidable subsets of the whole language.

show abstract

Router response to traffic at a bottleneck link

Cited by 6 publications

References 5 publications

TCP Acknowledgment Optimization in Low Power and Embedded Devices

TCP Acknowledgment Optimization in Low Power and Embedded Devices

Performance Investigation of Data Packets Transport Control Protocol in Heterogeneous Networks

WNetKAT: A Weighted SDN Programming and Verification Language

Contact Info

Product

Resources

About