SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Liberal Fidel) "

Sökning: WFRF:(Liberal Fidel)

  • Resultat 1-10 av 12
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Atxutegi, Eneko, et al. (författare)
  • On the move with TCP in current and future mobile networks
  • 2017
  • Ingår i: Proceedings of the 2017 8th International Conference on the Network of the Future (NOF).. - New York, USA : IEEE. - 9781538605547 ; , s. 66-72
  • Konferensbidrag (refereegranskat)abstract
    • Mobile wireless networks constitute an indispensable part of the global Internet, and with TCP the dominating transport protocol on the Internet, it is vital that TCP works equally well over these networks as over wired ones. This paper identifies the performance dependencies by analyzing the responsiveness of TCP NewReno and TCP CUBIC when subject to bandwidth variations related to movements in different directions. The presented evaluation complements previous studies on 4G mobile networks in two important ways: It primarily focuses on the behavior of the TCP congestion control in medium- to high-velocity mobility scenarios, and it not only considers the current 4G mobile networks, but also low latency configurations that move towards the overall potential delays in 5G networks. The paper suggests that while both CUBIC and NewReno give similar goodput in scenarios where the radio channel continuously degrades, CUBIC gives a significantly better goodput in scenarios where the radio channel quality continuously increases. This is due to CUBIC probing more aggressively for additional bandwidth. Important for the design of 5G networks, the obtained results also demonstrate that very low latencies are capable of equalizing the goodput performance of different congestion control algorithms. Only in low latency scenarios that combine both large fluctuations of available bandwidths and a mobility pattern in which the radio channel quality continuously increases can some performance differences be noticed.
  •  
2.
  • Atxutegi, Eneko, et al. (författare)
  • On the use of TCP BBR in cellular networks
  • 2018
  • Ingår i: IEEE Communications Magazine. - New York, USA : IEEE. - 0163-6804 .- 1558-1896. ; :3, s. 172-179
  • Tidskriftsartikel (refereegranskat)abstract
    • TCP BBR (Bottleneck Bandwidth and Round-trip propagation time) is a new TCP variant developed at Google, and which, as of this year, is fully deployed in Googles internal WANs and used by services such as Google.com and YouTube. In contrast to other commonly used TCP variants, TCP BBR is not loss-based but model-based: It builds a model of the network path between communicating nodes in terms of bottleneck bandwidth and minimum round-trip delay and tries to operate at the point where all available bandwidth is used and the round-trip delay is at minimum. Although, TCP BBR has indeed resulted in lower latency and a more efficient usage of bandwidth in fixed networks, its performance over cellular networks is less clear. This paper studies TCP BBR in live mobile networks and through emulations, and compares its performance with TCP NewReno and TCP CUBIC, two of the most commonly used TCP variants. The results from these studies suggest that in most cases TCP BBR outperforms both TCP NewReno and TCP CUBIC, however, not so when the available bandwidth is scarce. In these cases, TCP BBR provides longer file completion times than any of the other two studied TCP variants. Moreover, competing TCP BBR flows do not share the available bandwidth in a fair way, something which, for example, shows up when shorter TCP BBR flows struggle to get its fair share from longer ones. 
  •  
3.
  • Atxutegi, Eneko, et al. (författare)
  • TCP behaviour in LTE : impact of flow start-up and mobility
  • 2016
  • Ingår i: Wireless and Mobile Networking Conference (WMNC), 2016 9th IFIP. - : IEEE Communications Society. - 9781467387460 - 9781467387477 ; , s. 73-80
  • Konferensbidrag (refereegranskat)abstract
    • Mobile internet has been widely adopted and it is expected to rise to almost 4 billion users by 2020. Despite the research effort dedicated to the enhancement of its performance, there still exists a gap in the understanding of how TCP and its many variants work over LTE. To this end, this paper evaluates the extent to which five common TCP variants, CUBIC, NewReno,Westwood+, Illinois, and CAIA Delay Gradient (CDG), are able to utilise available radio resources under hard conditions, such as during start-up and in mobile scenarios at different speeds. The paper suggests that CUBIC, due to its Hybrid Slow-Start mechanism, enters congestion avoidance prematurely, and thus experiences a prolonged start-up phase. As a result, it is unable to efficiently utilise radio resources during shorter transmissionsessions. Besides, CUBIC, Illinois and NewReno, i.e., the loss-based TCP implementations, offer better throughput, and are able to better utilise available resources during mobility than Westwood+ and CDG - the delay-based variants do.
  •  
4.
  • Atxutegi, Eneko, et al. (författare)
  • TCP behaviour in LTE : impact of flow start-up and mobility
  • 2016
  • Ingår i: Wireless and Mobile Networking Conference (WMNC), 2016 9th IFIP. - : IEEE. ; , s. 73-80
  • Konferensbidrag (refereegranskat)abstract
    • Nowadays, more than two billion people uses the mobile internet, and it is expected to rise to almost 4 billion by 2020. Still, there is a gap in the understanding of how TCP and its many variants work over LTE. To this end, this paper evaluates the extent to which five common TCP variants, CUBIC, NewReno, Westwood+, Illinois, and CAIA Delay Gradient (CDG), are able to utilise available radio resources under hard conditions, such as during start-up and in mobile scenarios at different speeds. The paper suggests that CUBIC, due to its Hybrid Slow- Start mechanism, enters congestion avoidance prematurely, and thus experiences a prolonged start-up phase, and is unable to efficiently utilise radio resources during shorter transmission sessions. Still, CUBIC, Illinois and NewReno, i.e., the loss-based TCP implementations, offer better throughput, and are able to better utilise available resources during mobility than Westwood+ and CDG – the delay-based variants do. 
  •  
5.
  • Atxutegi, Eneko, et al. (författare)
  • TCP Performance over Current Cellular Access : A Comprehensive Analysis
  • 2018
  • Ingår i: Autonomous Control for a Reliable Internet of Services. - Cham : Springer. - 9783319904146 ; , s. 371-400, s. 371-400
  • Bokkapitel (refereegranskat)abstract
    • Mobile internet usage has significantly raised over the last decade and it is expected to grow to almost 4 billion users by 2020. Even after the great effort dedicated to the improvement of the performance, there still exist unresolved questions and problems regarding the interaction between TCP and mobile broadband technologies such as LTE. This chapter collects the behavior of distinct TCP implementation under various network conditions in different LTE deployments including to which extent the performance of TCP is capable of adapting to the rapid variability of mobile networks under different network loads, with distinct flow types, during start-up phase and in mobile scenarios at different speeds. Loss-based algorithms tend to completely fill the queue, creating huge standing queues and inducing packet losses both under stillness and mobility circumstances. On the other side delay-based variants are capable of limiting the standing queue size and decreasing the amount of packets that are dropped in the eNodeB, but they are not able under some circumstances to reach the maximum capacity. Similarly, under mobility in which the radio conditions are more challenging for TCP, the loss-based TCP implementations offer better throughput and are able to better utilize available resources than the delay-based variants do. Finally, CUBIC under highly variable circumstances usually enters congestion avoidance phase prematurely, provoking a slower and longer start-up phase due to the use of Hybrid Slow-Start mechanism. Therefore, CUBIC is unable to efficiently utilize radio resources during shorter transmission sessions.
  •  
6.
  • Habtegebreil, Haile, et al. (författare)
  • Impact of TCP BBR on CUBIC traffic : a mixed workload evaluation
  • 2018
  • Konferensbidrag (refereegranskat)abstract
    • A recently proposed congestion control algorithm (CCA) called BBR (Bottleneck Bandwidth and Round-trip propagation time) has shown a lot of promise in avoiding some of the problems that have plagued loss-based CCAs. Nevertheless, deployment of a new alternative algorithm requires a thorough evaluation of the effect of the proposed alternative on established transport protocols like TCP CUBIC. Furthermore, evaluations that consider the heterogeneity of Internet traffic sizes would provide a useful insight into the deployability of an algorithm that introduces sweeping changes across multiple algorithm components. Yet, most evaluations of BBR’s impact and competitive fairness have focused on the steady-state performance of large flows. This work expands on previous studies of BBR by evaluating BBR’s impact when the traffic consists of flows of different sizes. Our experiments show that under certain circumstances BBR’s startup phase can result in a significant reduction of the throughput of competing large CUBIC flows and the utilization of the bottleneck link. In addition, the steady-state operation of BBR can have negative impact on the performance of bursty flows using loss-based CCAs over bottlenecks with buffer sizes as high as two times the bandwidth-delay product.
  •  
7.
  •  
8.
  • Hurtig, Per, 1980-, et al. (författare)
  • Impact of TCP BBR on CUBIC Traffic : A mixed workload evaluation
  • 2018
  • Ingår i: Proceedings of the 30th International Teletraffic Congress, ITC 2018. - : IEEE. - 9780988304550 ; , s. 218-226
  • Konferensbidrag (refereegranskat)abstract
    • A recently proposed congestion control algorithm (CCA) called BBR (Bottleneck Bandwidth and Round-trip propagation time) has shown a lot of promise in avoiding some of the problems that have plagued loss-based CCAs. Nevertheless, deployment of a new alternative algorithm requires a thorough evaluation of the effect of the proposed alternative on established transport protocols like TCP CUBIC. Furthermore, evaluations that consider the heterogeneity of Internet traffic sizes would provide a useful insight into the deployability of an algorithm that introduces sweeping changes across multiple algorithm components. Yet, most evaluations of BBR's impact and competitive fairness have focused on the steady-state performance of large flows. This work expands on previous studies of BBR by evaluating BBR's impact when the traffic consists of flows of different sizes. Our experiments show that under certain circumstances BBR's startup phase can result in a significant reduction of the throughput of competing large CUBIC flows and the utilization of the bottleneck link. In addition, the steady-state operation of BBR can have negative impact on the performance of bursty flows using loss-based CCAs over bottlenecks with buffer sizes as high as two times the bandwidth-delay product. 
  •  
9.
  • Robert, Rémi, et al. (författare)
  • Behaviour of common TCP variants over LTE
  • 2016
  • Ingår i: Global Communications Conference (GLOBECOM), 2016 IEEE. - : IEEE.
  • Konferensbidrag (refereegranskat)abstract
    • This paper aims at increasing our understanding of the behaviour of some of the major TCP variants in LTE networks. A simulation study on the behaviour of seven TCP variants is performed. The evolution of the throughput, congestion window and queuing delay are studied for four scenarios with different network loads and flow types. Our measurements show that, in average radio conditions, most variants are able to quickly reach full link utilisation. However, to achieve the same throughput, they create different amounts of queuing delay. On the one hand, loss-based algorithms tend to completely fill the queue, creating huge queuing delays and inducing packet losses. On the other hand, delay-based variants manage to limit the queue size and decrease the amount of packets dropped by the eNodeB, but struggle to reach the maximum throughput in some circumstances.
  •  
10.
  • Robert, Rèmi, et al. (författare)
  • Behaviour of Common TCP Variants over LTE
  • 2016
  • Konferensbidrag (refereegranskat)abstract
    • This paper presents our work regarding the comparison of the behaviour of some of the major TCP variants in a LTE network. Using the LENA LTE simulator and the DCE framework, the behaviour of the Linux implementations of seven TCP variants are compared. The evolution of the throughput, congestion window and queuing delay are studied for four scenarios with different network loads and flow types. Our measurements show that, in the situations we consider, most variants are able to quickly reach full link utilisation. However, to reach the same throughput, they create different amounts of queuing delay. On the one hand, loss based algorithms tend to totally fill the queue, creating huge queuing delays and inducing packet losses. On the other hand, delay based variants manage to limit the queue size and decrease the amount of packet dropped by the eNodeB but struggle to reach the maximum throughput in some circumstances.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-10 av 12

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy