Pub Date : 2018-09-01DOI: 10.1109/ITC30.2018.00021
J. Heyse, M. T. Vega, T. Wauters, F. D. Backere, F. Turck
As the demand of Virtual Reality (VR) video streaming to mobile devices increases, novel optimization transport techniques need to be designed to cope with these ultra-high-bandwidth video services. One approach currently attracting attention is the application of adaptive tile-based streaming solutions to the VR video arena. The VR videos are encoded at different quality levels, temporally divided into segments and spatially split into tiles. During the streaming, each of these tiles can be transmitted independently according to its location within the frame (i.e., within or outside of the user's field of view). These methods open a new venue for bandwidth and latency optimization for the streaming of VR videos. However, the effect of the different adaptive streaming optimizations on the end-user perception is still an open research topic. In this demo, we present a VR video platform to experience the working principles of adaptive tile-based VR video streaming services. Through different tiling approaches, bandwidth conditions and viewport algorithms, it allows the users to explore the effects that each optimization has on the perception of the service. In addition, the platform provides real-time bandwidth savings and objective Quality of Experience (QoE) measurements to provide a quantitative analysis of the optimizations effects. This demo aims to provide a common playground for researchers to benchmark and evaluate the performance of their optimization solutions.
{"title":"Effects of Adaptive Streaming Optimizations on the Perception of 360° Virtual Reality Video","authors":"J. Heyse, M. T. Vega, T. Wauters, F. D. Backere, F. Turck","doi":"10.1109/ITC30.2018.00021","DOIUrl":"https://doi.org/10.1109/ITC30.2018.00021","url":null,"abstract":"As the demand of Virtual Reality (VR) video streaming to mobile devices increases, novel optimization transport techniques need to be designed to cope with these ultra-high-bandwidth video services. One approach currently attracting attention is the application of adaptive tile-based streaming solutions to the VR video arena. The VR videos are encoded at different quality levels, temporally divided into segments and spatially split into tiles. During the streaming, each of these tiles can be transmitted independently according to its location within the frame (i.e., within or outside of the user's field of view). These methods open a new venue for bandwidth and latency optimization for the streaming of VR videos. However, the effect of the different adaptive streaming optimizations on the end-user perception is still an open research topic. In this demo, we present a VR video platform to experience the working principles of adaptive tile-based VR video streaming services. Through different tiling approaches, bandwidth conditions and viewport algorithms, it allows the users to explore the effects that each optimization has on the perception of the service. In addition, the platform provides real-time bandwidth savings and objective Quality of Experience (QoE) measurements to provide a quantitative analysis of the optimizations effects. This demo aims to provide a common playground for researchers to benchmark and evaluate the performance of their optimization solutions.","PeriodicalId":159861,"journal":{"name":"2018 30th International Teletraffic Congress (ITC 30)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121088854","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-09-01DOI: 10.1109/itc30.2018.10064
{"title":"[Publisher's information]","authors":"","doi":"10.1109/itc30.2018.10064","DOIUrl":"https://doi.org/10.1109/itc30.2018.10064","url":null,"abstract":"","PeriodicalId":159861,"journal":{"name":"2018 30th International Teletraffic Congress (ITC 30)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125974644","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-09-01DOI: 10.1109/ITC30.2018.00018
Christian Moldovan, Lea Skorin-Kapov, P. Heegaard, T. Hossfeld
With the majority of video distribution services relying on the HTTP adaptive streaming paradigm, a great deal of research is geared towards developing algorithms and solutions for improving user perceived quality while making efficient use of available resources. Our goal is to provide the means for benchmarking such solutions in the context of multiple users accessing Video on Demand content while sharing a bottleneck link. For that purpose, we propose a quadratic problem formulation to compute the theoretical optimum in terms of adaptation strategies and corresponding segment downloads across multiple users under given bandwidth constraints. By aiming to maximize both service quality and fairness, we quantify and compare the impact of different fairness objectives (bandwidth fairness, pattern fairness, and session fairness) on resulting quality and achieved QoE fairness. Based on conducted simulations and parameter studies, our results demonstrate the benefits of optimizing for session fairness as compared to other approaches.
{"title":"Optimal Fairness and Quality in Video Streaming with Multiple Users","authors":"Christian Moldovan, Lea Skorin-Kapov, P. Heegaard, T. Hossfeld","doi":"10.1109/ITC30.2018.00018","DOIUrl":"https://doi.org/10.1109/ITC30.2018.00018","url":null,"abstract":"With the majority of video distribution services relying on the HTTP adaptive streaming paradigm, a great deal of research is geared towards developing algorithms and solutions for improving user perceived quality while making efficient use of available resources. Our goal is to provide the means for benchmarking such solutions in the context of multiple users accessing Video on Demand content while sharing a bottleneck link. For that purpose, we propose a quadratic problem formulation to compute the theoretical optimum in terms of adaptation strategies and corresponding segment downloads across multiple users under given bandwidth constraints. By aiming to maximize both service quality and fairness, we quantify and compare the impact of different fairness objectives (bandwidth fairness, pattern fairness, and session fairness) on resulting quality and achieved QoE fairness. Based on conducted simulations and parameter studies, our results demonstrate the benefits of optimizing for session fairness as compared to other approaches.","PeriodicalId":159861,"journal":{"name":"2018 30th International Teletraffic Congress (ITC 30)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121855897","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-09-01DOI: 10.1109/ITC30.2018.00040
Per Hurtig, H. Haile, Karl-Johan Grinnemo, A. Brunström, E. Atxutegi, F. Liberal, Å. Arvidsson
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.
{"title":"Impact of TCP BBR on CUBIC Traffic: A Mixed Workload Evaluation","authors":"Per Hurtig, H. Haile, Karl-Johan Grinnemo, A. Brunström, E. Atxutegi, F. Liberal, Å. Arvidsson","doi":"10.1109/ITC30.2018.00040","DOIUrl":"https://doi.org/10.1109/ITC30.2018.00040","url":null,"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.","PeriodicalId":159861,"journal":{"name":"2018 30th International Teletraffic Congress (ITC 30)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134349734","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-09-01DOI: 10.1109/ITC30.2018.10062
F. Guillemin, R. Mazumdar, C. Rosenberg, Yu Ying
In this paper, a framework is developed to estimate the mean delay performance of (σ, ρ, π) regulated flows in networks with acyclic routing. We first show that the mean delay performance can be bounded by on-off type processes with exponentially distributed off periods. We then obtain per-flow bounds on the mean delay. We show that when there is no peak rate constraint, the Pollaczek-Khinchine formula for M/G/1 queues provides a tight bound thus establishing the Better-than-Poisson property for such flows. We then consider flows inside a network and show that they can be characterized by a stochastic burstiness parameter and show how the aggregate performance can be bounded from the asymptotic Better-than-Poisson property of regulated flows.
{"title":"Network Calculus for Mean Delay Analysis Through a Network","authors":"F. Guillemin, R. Mazumdar, C. Rosenberg, Yu Ying","doi":"10.1109/ITC30.2018.10062","DOIUrl":"https://doi.org/10.1109/ITC30.2018.10062","url":null,"abstract":"In this paper, a framework is developed to estimate the mean delay performance of (σ, ρ, π) regulated flows in networks with acyclic routing. We first show that the mean delay performance can be bounded by on-off type processes with exponentially distributed off periods. We then obtain per-flow bounds on the mean delay. We show that when there is no peak rate constraint, the Pollaczek-Khinchine formula for M/G/1 queues provides a tight bound thus establishing the Better-than-Poisson property for such flows. We then consider flows inside a network and show that they can be characterized by a stochastic burstiness parameter and show how the aggregate performance can be bounded from the asymptotic Better-than-Poisson property of regulated flows.","PeriodicalId":159861,"journal":{"name":"2018 30th International Teletraffic Congress (ITC 30)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121281092","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-09-01DOI: 10.1109/ITC30.2018.10054
Sounak Kar, Amr Rizk, M. Fidler
Recent advancements of multipath communications have made a new dimension of resource management accessible focusing on balanced and efficient utilization of available communication alternatives. Dynamic strategies in this context leverage the most up to date information on available interfaces to outperform comparable static versions. In this work, we propose an adaptive strategy that seeks to improve the worst-case performance of a multipath communication system by periodically looking at waiting time bounds of respective subsystems. We compare the performance of the proposed adaptive assignment with established round-robin and join-the-shortest-queue strategies numerically where we observe that our strategy tends to be superior in heterogeneous environments.
{"title":"Multi-interface Communication: Interface Selection Under Statistical Performance Constraints","authors":"Sounak Kar, Amr Rizk, M. Fidler","doi":"10.1109/ITC30.2018.10054","DOIUrl":"https://doi.org/10.1109/ITC30.2018.10054","url":null,"abstract":"Recent advancements of multipath communications have made a new dimension of resource management accessible focusing on balanced and efficient utilization of available communication alternatives. Dynamic strategies in this context leverage the most up to date information on available interfaces to outperform comparable static versions. In this work, we propose an adaptive strategy that seeks to improve the worst-case performance of a multipath communication system by periodically looking at waiting time bounds of respective subsystems. We compare the performance of the proposed adaptive assignment with established round-robin and join-the-shortest-queue strategies numerically where we observe that our strategy tends to be superior in heterogeneous environments.","PeriodicalId":159861,"journal":{"name":"2018 30th International Teletraffic Congress (ITC 30)","volume":"604 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116368213","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-09-01DOI: 10.1109/ITC30.2018.00012
S. Aalto, P. Lassila
A data center can be modeled as a set of parallel queues, and the dispatcher decides to which queue the arriving jobs are routed. We consider an energy-aware dispatching system in a Markovian setting, where each server upon becoming empty enters a sleep mode to save energy and to activate the server after sleep incurs an additional setup delay cost. We seek to optimize the performance-energy trade-off by applying the so-called Whittle index approach. As our main result, we rigorously prove, under a certain technical assumption, that the problem is indexable, and derive the explicit form of the Whittle index. Our numerical examples demonstrate that the resulting energy-aware Whittle index policy is able to perform very close to the numerically obtained optimal policy.
{"title":"Whittle Index Approach to Energy-Aware Dispatching","authors":"S. Aalto, P. Lassila","doi":"10.1109/ITC30.2018.00012","DOIUrl":"https://doi.org/10.1109/ITC30.2018.00012","url":null,"abstract":"A data center can be modeled as a set of parallel queues, and the dispatcher decides to which queue the arriving jobs are routed. We consider an energy-aware dispatching system in a Markovian setting, where each server upon becoming empty enters a sleep mode to save energy and to activate the server after sleep incurs an additional setup delay cost. We seek to optimize the performance-energy trade-off by applying the so-called Whittle index approach. As our main result, we rigorously prove, under a certain technical assumption, that the problem is indexable, and derive the explicit form of the Whittle index. Our numerical examples demonstrate that the resulting energy-aware Whittle index policy is able to perform very close to the numerically obtained optimal policy.","PeriodicalId":159861,"journal":{"name":"2018 30th International Teletraffic Congress (ITC 30)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117172774","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-09-01DOI: 10.1109/itc30.2018.10047
{"title":"[Copyright notice]","authors":"","doi":"10.1109/itc30.2018.10047","DOIUrl":"https://doi.org/10.1109/itc30.2018.10047","url":null,"abstract":"","PeriodicalId":159861,"journal":{"name":"2018 30th International Teletraffic Congress (ITC 30)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116057239","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-09-01DOI: 10.1109/ITC30.2018.00027
D. Mocanu
Traditionally science is done using the reductionism paradigm. Artificial intelligence does not make an exception and it follows the same strategy. At the same time, network science tries to study complex systems as a whole. This synopsis presents my PhD thesis which takes an alternative approach to the reductionism strategy, with the aim to advance both fields, advocating that major breakthroughs can be made when these two are combined. The thesis illustrates this bidirectional relation by: (1) proposing a new method which uses artificial intelligence to improve network science algorithms (i.e. a new centrality metric which computes fully decentralized the nodes and links importance, on the polylogarithmic scale with respect to the number of nodes in the network); and (2) proposing two methods which take inspiration from network science to improve artificial intelligence algorithms (e.g. quadratic acceleration in terms of memory requirements and computational speed of artificial neural network fully connected layers during both, training and inference).
{"title":"Synopsis of the PhD Thesis - Network Computations in Artificial Intelligence","authors":"D. Mocanu","doi":"10.1109/ITC30.2018.00027","DOIUrl":"https://doi.org/10.1109/ITC30.2018.00027","url":null,"abstract":"Traditionally science is done using the reductionism paradigm. Artificial intelligence does not make an exception and it follows the same strategy. At the same time, network science tries to study complex systems as a whole. This synopsis presents my PhD thesis which takes an alternative approach to the reductionism strategy, with the aim to advance both fields, advocating that major breakthroughs can be made when these two are combined. The thesis illustrates this bidirectional relation by: (1) proposing a new method which uses artificial intelligence to improve network science algorithms (i.e. a new centrality metric which computes fully decentralized the nodes and links importance, on the polylogarithmic scale with respect to the number of nodes in the network); and (2) proposing two methods which take inspiration from network science to improve artificial intelligence algorithms (e.g. quadratic acceleration in terms of memory requirements and computational speed of artificial neural network fully connected layers during both, training and inference).","PeriodicalId":159861,"journal":{"name":"2018 30th International Teletraffic Congress (ITC 30)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127649225","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：