2019 31st International Teletraffic Congress (ITC 31)最新文献

筛选
英文 中文
Max Weight Scheduling with Base Station Running and Switching Costs 具有基站运行和切换成本的最大权重调度
2019 31st International Teletraffic Congress (ITC 31) Pub Date : 2019-08-01 DOI: 10.1109/ITC31.2019.00021
K. Haritha, C. Singh
{"title":"Max Weight Scheduling with Base Station Running and Switching Costs","authors":"K. Haritha, C. Singh","doi":"10.1109/ITC31.2019.00021","DOIUrl":"https://doi.org/10.1109/ITC31.2019.00021","url":null,"abstract":"We study BS scheduling for cellular downlink. We propose a drift-plus-penalty based BS scheduling algorithm that minimizes BS running and switching costs while ensuring network stability. We illustrate the performance of the proposed algorithm via simulation.","PeriodicalId":268686,"journal":{"name":"2019 31st International Teletraffic Congress (ITC 31)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123714496","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}
引用次数: 0
Fluctuations Around the Mean-Field for a Large Scale Erlang Loss System Under the SQ(d) Load Balancing SQ(d)负载均衡下大规模Erlang损失系统的平均场波动
2019 31st International Teletraffic Congress (ITC 31) Pub Date : 2019-08-01 DOI: 10.1109/ITC31.2019.00010
Thirupathaiah Vasantam, R. Mazumdar
{"title":"Fluctuations Around the Mean-Field for a Large Scale Erlang Loss System Under the SQ(d) Load Balancing","authors":"Thirupathaiah Vasantam, R. Mazumdar","doi":"10.1109/ITC31.2019.00010","DOIUrl":"https://doi.org/10.1109/ITC31.2019.00010","url":null,"abstract":"In this paper, we study the fluctuations of the transient and stationary empirical distributions around the mean-field for a large scale multi-server Erlang Loss system that has N servers. Jobs arrive according to a Poisson process with rate Nλ and each incoming job is dispatched by a central job dispatcher to the server with the minimum occupancy among d randomly chosen servers with ties broken uniformly at random. Previous works have studied the mean-field limit of this model and characterized the asymptotic behavior of the system when N↦∞. In this paper, we focus on quantifying the resulting error when we approximate the transient and stationary behavior of the system when N is large by the mean-field of the system. We obtain functional central limit theorems (FCLTs) by studying the limit of a suitably scaled fluctuation process of the stochastic empirical process of the model with index N around the mean-field limit when N↦∞. We show that for both the transient and stationary regimes, the limiting process is characterized by an Ornstein-Uhlenbeck (OU) process. We also show that the interchange of limits lim_N↦∞ lim_t↦∞=lim_t↦∞ lim_N↦∞ is valid under the CLT scaling. Finally, we exploit the FCLT to show that the gap between the exact average blocking probability of a job in the system with the number of servers N and the limiting average blocking probability which is a function of the fixed-point of the mean-field, is of the order o(N^-1/2) and thus establish the accuracy of the mean-field approximation for finite N.","PeriodicalId":268686,"journal":{"name":"2019 31st International Teletraffic Congress (ITC 31)","volume":"132 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125424626","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}
引用次数: 3
ITC 31 Sponsors ITC 31家赞助商
2019 31st International Teletraffic Congress (ITC 31) Pub Date : 2019-08-01 DOI: 10.1109/itc31.2019.00009
{"title":"ITC 31 Sponsors","authors":"","doi":"10.1109/itc31.2019.00009","DOIUrl":"https://doi.org/10.1109/itc31.2019.00009","url":null,"abstract":"","PeriodicalId":268686,"journal":{"name":"2019 31st International Teletraffic Congress (ITC 31)","volume":"168 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122407592","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}
引用次数: 0
Small Solar Panels Can Drastically Reduce the Carbon Footprint of Radio Access Networks 小型太阳能电池板可以大大减少无线接入网络的碳足迹
2019 31st International Teletraffic Congress (ITC 31) Pub Date : 2019-08-01 DOI: 10.1109/ITC31.2019.00017
Ana Paula Couto da Silva, Daniela Renga, M. Meo, M. Marsan
{"title":"Small Solar Panels Can Drastically Reduce the Carbon Footprint of Radio Access Networks","authors":"Ana Paula Couto da Silva, Daniela Renga, M. Meo, M. Marsan","doi":"10.1109/ITC31.2019.00017","DOIUrl":"https://doi.org/10.1109/ITC31.2019.00017","url":null,"abstract":"The limited power requirements of new generations of base stations (BSs) make the use of renewable energy sources, solar in particular, extremely attractive for mobile network operators. Exploiting solar energy implies a reduction of the network operation cost as well as of the carbon footprint of radio access networks, but previous research works indicate that the area of the solar panels that are necessary to power a standard macro BS is large, so large to make the solar panel deployment problematic, especially within urban areas. In this paper we use a modeling approach based on Markov reward processes to investigate the possibility of combining small area solar panels with a connection to the power grid to run a macro BS. By so doing, it is possible to increase the amount of renewable energy used to run a radio access network, while also reducing the cost incurred by the network operator to power its base stations. We assume that energy is drawn from the power grid only when needed to keep the BS operational, or during the night, that corresponds to the period with lowest electricity price. This has advantages in terms of both cost and carbon footprint. We show that solar panels of the order of 1-2 kW peak, i.e., with a surface of about 5-10 m^2, combined with limited capacity energy storage (of the order of 10-15 kWh, corresponding to about 3-5 car batteries), and a smart energy management policy, can lead to an effective exploitation of renewable energy.","PeriodicalId":268686,"journal":{"name":"2019 31st International Teletraffic Congress (ITC 31)","volume":"06 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114697183","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}
引用次数: 2
Controlling Queues with Constant Interarrival Times 用恒定的到达间隔时间控制队列
2019 31st International Teletraffic Congress (ITC 31) Pub Date : 2019-08-01 DOI: 10.1109/ITC31.2019.00012
Esa Hyytiä, G. Magńusson, Rhonda Righter
{"title":"Controlling Queues with Constant Interarrival Times","authors":"Esa Hyytiä, G. Magńusson, Rhonda Righter","doi":"10.1109/ITC31.2019.00012","DOIUrl":"https://doi.org/10.1109/ITC31.2019.00012","url":null,"abstract":"We consider server systems with constant interarrival times subject to arbitrary cost functions. This type of systems arises when we have full control over arrivals. Typical examples include situations where computers or network elements schedule periodic updates at regular time intervals (cf. cron daemon in unix systems), a congestion avoidance or load balancing mechanism imposes regular inter-arrival times at a lower level, and also in customer service and healthcare systems where patients book appointments. In the basic case, known as the D/M/1 queue, there is a single server and the service times are independent and exponentially distributed. We study different value functions for the D/M/1 queue that characterize the expected cost difference in the infinite time horizon if the system is initially in a given state instead of being in equilibrium. When the arrival process is Poisson, the corresponding results are compact and known. The fixed interarrival times complicate the situation, and even the mean waiting time is harder to characterize. We apply our results to develop a heuristic for a dispatching problem, and evaluate the heuristic numerically.","PeriodicalId":268686,"journal":{"name":"2019 31st International Teletraffic Congress (ITC 31)","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124302386","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}
引用次数: 2
Task Scheduling on Crowdsourcing Platforms for Enabling Completion Time SLAs 基于完成时间sla的众包平台任务调度
2019 31st International Teletraffic Congress (ITC 31) Pub Date : 2019-08-01 DOI: 10.1109/ITC31.2019.00026
Matthias Hirth, Florian Steurer, Kathrin Borchert, Dan Dubiner
{"title":"Task Scheduling on Crowdsourcing Platforms for Enabling Completion Time SLAs","authors":"Matthias Hirth, Florian Steurer, Kathrin Borchert, Dan Dubiner","doi":"10.1109/ITC31.2019.00026","DOIUrl":"https://doi.org/10.1109/ITC31.2019.00026","url":null,"abstract":"Today a diverse crowdsourcing economy has established, and service level agreements (SLAs) become a crucial part of this ecosystem. However, the uncertainty introduced by human workers makes it hard to set completion time guarantees. In this work, we analyze an exemplary task scheduling strategy that helps operators of crowdsourcing-based services to meet completion time SLAs. We use the real-world crowdsourcing-based text digitalization platform ScaleHub as the foundation for our system model and a dataset provided by ScaleHub to obtain a realistic parametrization of the model. We derive a simulation model that enables us to illustrate the potential and limitations of scheduling mechanisms to meet SLA constraints and that helps platform providers to optimize their systems.","PeriodicalId":268686,"journal":{"name":"2019 31st International Teletraffic Congress (ITC 31)","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126017317","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}
引用次数: 5
Performance Analytics by Means of the M5P Machine Learning Algorithm 基于M5P机器学习算法的性能分析
2019 31st International Teletraffic Congress (ITC 31) Pub Date : 2019-08-01 DOI: 10.1109/ITC31.2019.00023
M. Fiedler
{"title":"Performance Analytics by Means of the M5P Machine Learning Algorithm","authors":"M. Fiedler","doi":"10.1109/ITC31.2019.00023","DOIUrl":"https://doi.org/10.1109/ITC31.2019.00023","url":null,"abstract":"Machine Learning (ML) has shown its capability to analyse, classify, and make predictions based on large data sets. Network performance analysis and evaluation focuses on finding and expressing qualitative, quantitative and formal relationships between performance-related parameters, with specific interest in asymptotic behaviours. This work introduces the notion of performance analytics as performance modeling with help of ML. In particular, it demonstrates the applicablibility of the ML algorithm M5P to such performance analytics, as the parameters of the generated model trees allow for identifying approximations together the applicable parameter sub-spaces in a straightforward approach. We present a set of examples with focus on post-analysis of analytically obtained performance results for asymptotic behaviour.","PeriodicalId":268686,"journal":{"name":"2019 31st International Teletraffic Congress (ITC 31)","volume":"24 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128453039","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}
引用次数: 5
[Title page i] [标题页i]
2019 31st International Teletraffic Congress (ITC 31) Pub Date : 2019-08-01 DOI: 10.1109/itc31.2019.00001
{"title":"[Title page i]","authors":"","doi":"10.1109/itc31.2019.00001","DOIUrl":"https://doi.org/10.1109/itc31.2019.00001","url":null,"abstract":"","PeriodicalId":268686,"journal":{"name":"2019 31st International Teletraffic Congress (ITC 31)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133798031","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}
引用次数: 0
Moving RTS/CTS to the Frequency Domain: an Efficient Contention Scheme for 802.11ax Networks 将RTS/CTS移动到频域:802.11ax网络的有效争用方案
2019 31st International Teletraffic Congress (ITC 31) Pub Date : 2019-08-01 DOI: 10.1109/ITC31.2019.00031
A. Baiocchi, D. Garlisi, Giuseppe Santaromita, I. Tinnirello
{"title":"Moving RTS/CTS to the Frequency Domain: an Efficient Contention Scheme for 802.11ax Networks","authors":"A. Baiocchi, D. Garlisi, Giuseppe Santaromita, I. Tinnirello","doi":"10.1109/ITC31.2019.00031","DOIUrl":"https://doi.org/10.1109/ITC31.2019.00031","url":null,"abstract":"In this paper, we propose a contention mechanism based on the execution of multiple contention rounds in the frequency domain (ReCHo), which is designed to offer high throughput performance and robustness with respect to imperfect carrier sensing. The main idea is using narrow tones as signalling messages for performing channel access contentions and allowing the Access Point (AP) to echo these signals, in order to extend the sensing capabilities to all the stations associated to the AP. In particular, we refer to the emerging IEEE 802.11ax standard, showing how our scheme can boost performance of random access with respect to the current version of IEEE 802.11ax OFDMA Back-Off (OBO), even when hidden node probability is very high.","PeriodicalId":268686,"journal":{"name":"2019 31st International Teletraffic Congress (ITC 31)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129871014","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}
引用次数: 1
Modeling Adaptive Video Streaming Using Discrete-Time Analysis 基于离散时间分析的自适应视频流建模
2019 31st International Teletraffic Congress (ITC 31) Pub Date : 2019-08-01 DOI: 10.1109/ITC31.2019.00028
Susanna Schwarzmann, P. Breitbach, T. Zinner, Matthias Rost
{"title":"Modeling Adaptive Video Streaming Using Discrete-Time Analysis","authors":"Susanna Schwarzmann, P. Breitbach, T. Zinner, Matthias Rost","doi":"10.1109/ITC31.2019.00028","DOIUrl":"https://doi.org/10.1109/ITC31.2019.00028","url":null,"abstract":"HTTP Adaptive Streaming (HAS) is the de-facto standard for video delivery over the Internet: video clips are split into segments and for each segment, several quality levels are provided. Based on client-centric parameters like the video buffer state or the throughput, an adaptive bitrate (ABR) algorithm is used to decide the quality of the segment to be downloaded. Besides the applied ABR algorithm, network and video characteristics, as well as the setting of buffer thresholds, the number of provided quality levels, and the choice of segment durations influence the Quality-of-Experience (QoE). Thus, the QoE is the result of the highly complex interaction of these parameters and the interdependence of these parameters has not been explored in a holistic manner yet. In this paper, a generic performance model for rate-based and buffer-based ABR algorithms is proposed. Using discrete-time analysis, the model allows computing relevant HAS metrics such as video interruptions and playback quality. To highlight the practical applicability of the model, an extensive evaluation is presented, in which the model's probabilistic results are compared with actual measurements of buffer-based and rate-based ABR algorithms. The results indicate that the model is sufficiently expressive to capture the HAS behavior across various settings, while still remaining computationally tractable.","PeriodicalId":268686,"journal":{"name":"2019 31st International Teletraffic Congress (ITC 31)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117315008","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}
引用次数: 1
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书