2019 International Conference on Computing, Networking and Communications (ICNC)最新文献

An Enhanced Capacity Model based on Network Measurements for a Multi-Service 3G System 基于网络测量的多业务3G系统增强容量模型

2019 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2019-04-11 DOI: 10.1109/ICCNC.2019.8685529

D. Parracho, D. Duarte, Iola Pinto, P. Vieira

{"title":"An Enhanced Capacity Model based on Network Measurements for a Multi-Service 3G System","authors":"D. Parracho, D. Duarte, Iola Pinto, P. Vieira","doi":"10.1109/ICCNC.2019.8685529","DOIUrl":"https://doi.org/10.1109/ICCNC.2019.8685529","url":null,"abstract":"With the ongoing growth on mobile networks utilization, new challenges come up in order to achieve a better efficient resource network management. The purpose of this paper is to present a multi-service platform based on admission curves for Third Generation (3G) and beyond mobile networks, depending on some cell characteristics, which are calculated based on real measurements. The model considers admission curves based on the Multidimensional Erlang-B model, which defines the maximum limit of resource utilization for a given Quality of Service (QoS), and will manage traffic between several services. The proposed method takes different specific constraints for each traffic environment based on network performance. To estimate the cell characteristics, for Voice and Packet Switched (PS) Release 99 (R99) services, a method is proposed, based on the Multiple Linear Regression model and dependent on Key Performance Indicators (KPI) taken from a live mobile network. For High Speed Downlink Packet Access (HSDPA) service, a different approach is set since there is a well defined time to transmit data (Transmission Time Interval (TTI)) along with other important features, like Channel Quality Indicator (CQI) and Block Error Rate (BLER), to be considered.","PeriodicalId":161815,"journal":{"name":"2019 International Conference on Computing, Networking and Communications (ICNC)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130372192","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

Spectrum Usage Minimization for Shared Backup Path Protection in Elastic Optical Networks 弹性光网络中共享备份路径保护的频谱利用率最小化

2019 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2019-04-08 DOI: 10.1109/ICCNC.2019.8685656

Chingfang Hsu, Hao Hu, Hsuan-Fang Fu, Jin-Jun Zheng, Shi-Xuan Chen

{"title":"Spectrum Usage Minimization for Shared Backup Path Protection in Elastic Optical Networks","authors":"Chingfang Hsu, Hao Hu, Hsuan-Fang Fu, Jin-Jun Zheng, Shi-Xuan Chen","doi":"10.1109/ICCNC.2019.8685656","DOIUrl":"https://doi.org/10.1109/ICCNC.2019.8685656","url":null,"abstract":"Protection is an important issue of resilience in elastic optical networks (EONs). Not only for working lightpaths, but also routing, modulation and spectrum assignment (RMSA) for backup paths is essential. In protection scheme, shared backup path protection (SBPP) is usually discussed now. SBPP allows backup lightpaths to share spectrum resource so that the amount of allocated frequency slots can be reduced. Spectrum usage critically affects blocking performance due to the limited resource in spectrum. For this reason, we aim at minimizing spectrum usage as our objective. For RMSA, many heuristic algorithms pursue the shortest path or minimum-hopped path and neglect the balance between number of required frequency slots and maximum transmission distance (MTD) of modulation levels. Therefore, we propose a RMSA algorithm, namely, lowest cost first and shortest path algorithm (LCF) to derive the RSA solutions for both working and backup lightpaths. However, among RSA solutions satisfying MTD constraint, the one with least vacant resource consumption might be neither the minimum-hopped path nor the shortest path. Hence we propose an enhanced RMSA algorithm called minimum usage algorithm (MU) to pre-calculate all paths satisfying MTD constraint and then find the one with minimum resource usage. Simulation results show that both LCF and MU can achieve great improvement on blocking performance.","PeriodicalId":161815,"journal":{"name":"2019 International Conference on Computing, Networking and Communications (ICNC)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122061330","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

Multicast Design for the MobilityFirst Future Internet Architecture 面向移动优先的未来互联网架构的组播设计

2019 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2019-04-08 DOI: 10.1109/ICCNC.2019.8685485

Bowen Yang, Xiang Chen, Jin Xie, Sugang Li, Yanyong Zhang, Jian Yang

{"title":"Multicast Design for the MobilityFirst Future Internet Architecture","authors":"Bowen Yang, Xiang Chen, Jin Xie, Sugang Li, Yanyong Zhang, Jian Yang","doi":"10.1109/ICCNC.2019.8685485","DOIUrl":"https://doi.org/10.1109/ICCNC.2019.8685485","url":null,"abstract":"With the advent of fifth generation (5G) network and increasingly powerful mobile devices, people can conveniently obtain network resources wherever they are and whenever they want. However, the problem of mobility support in current network has not been adequately solved yet, especially in inter-domain mobile scenario, which leads to poor experience for mobile consumers. MobilityFirst is a clean slate future Internet architecture which adopts a clean separation between identity and network location. It provides new mechanisms to address the challenge of wireless access and mobility at scale. However, MobilityFirst lacks effective ways to deal with multicast service over mobile networks. In this paper, we design an efficient multicast mechanism based on MobilityFirst architecture and present the deployment in current network at scale. Furthermore, we propose a hierarchical multicast packet header with additional destinations to achieve low-cost dynamic multicast routing and provide solutions for both the multicast source and the multicast group members moving in intra- or inter-domain. Finally, we deploy a multicast prototype system to evaluate the performance of the proposed multicast mechanism.","PeriodicalId":161815,"journal":{"name":"2019 International Conference on Computing, Networking and Communications (ICNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134306915","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}

引用次数: 4

Design of an Efficient Resource Management Model in Elastic Optical Networks 弹性光网络中高效资源管理模型的设计

2019 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2019-04-08 DOI: 10.1109/ICCNC.2019.8685613

Chingfang Hsu, S. Sie, Hsuan-Fang Fu, Jin-Jun Zheng, Shi-Xuan Chen

{"title":"Design of an Efficient Resource Management Model in Elastic Optical Networks","authors":"Chingfang Hsu, S. Sie, Hsuan-Fang Fu, Jin-Jun Zheng, Shi-Xuan Chen","doi":"10.1109/ICCNC.2019.8685613","DOIUrl":"https://doi.org/10.1109/ICCNC.2019.8685613","url":null,"abstract":"The advent of elastic optical networks (EONs) has drawn much attention in recent years and this new paradigm is identified as the most promising solution to the next generation optical networks. In EONs, routing and spectrum assignment (RSA) problem plays a role very similar to the routing and wavelength assignment (RWA) problem in wavelength-routed networks. As the RSA problem has been proved to be NP-hard, how to design an efficient resource management model to improve execution efficiency of RSA heuristics would become a practical and critical issue. In this work, we address a whole new resource management unit named cluster to simplify the spectrum assignment step. Because of the trade-off between computation efficiency and blocking performance, it is expectable that the cluster-based RSA algorithm would suffer from the problem of low spectral utilization. To effectively alleviate the inevitable intra-and inter-cluster fragmentation, we also propose some additional processing options as possible solutions. Numerical results show that the proposed scheme is a highly competitive dynamic RSA algorithm because of its acceptable blocking performance and significantly improved execution efficiency as compared with near-optimal algorithm. It reveals that cluster-based resource management model can not only achieve the goal of good time efficiency but also maintain satisfactory blocking performance.","PeriodicalId":161815,"journal":{"name":"2019 International Conference on Computing, Networking and Communications (ICNC)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128019716","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

Smart Stadia as Testbeds for Smart Cities: Enriching Fan Experiences and Improving Accessibility 智能体育场作为智能城市的试验台:丰富球迷体验，提高可达性

2019 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2019-04-08 DOI: 10.1109/ICCNC.2019.8685580

S. Panchanathan, T. McDaniel, Ramin Tadayon, Adric Rukkila, Hemanth Venkateswara

{"title":"Smart Stadia as Testbeds for Smart Cities: Enriching Fan Experiences and Improving Accessibility","authors":"S. Panchanathan, T. McDaniel, Ramin Tadayon, Adric Rukkila, Hemanth Venkateswara","doi":"10.1109/ICCNC.2019.8685580","DOIUrl":"https://doi.org/10.1109/ICCNC.2019.8685580","url":null,"abstract":"Rapid urbanization is introducing a variety of challenges for municipalities. Technologically-enabled ‘Smart Cities’ are rising to meet these needs, which include smarter sustainability, cybersecurity, transportation, waste management, energy efficiency, education, among many other areas, all toward enhancing the quality of life of citizens. These cities leverage the capabilities of Internet of Things (IoT) technology and the service economy to infuse sensing and information delivery into everyday life through the power of data analytics and artificial intelligence. However, the size of a city and its population make it difficult to evaluate smart solutions. In this work, the ‘Smart Stadium’ is proposed as a testbed to trial Smart City technologies in an environment small enough to facilitate user trials yet large enough to produce scalable outcomes. Our previous proof-of-concepts are summarized to highlight the potential of this approach. We also present a more recent project on accessibility and inclusion using virtual reality with preliminary results.","PeriodicalId":161815,"journal":{"name":"2019 International Conference on Computing, Networking and Communications (ICNC)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129483104","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}

引用次数: 6

COMPRESS: A Self-Sufficient Scheme for Measuring Queueing Delay on the Internet Routers 压缩:一种自给自足的因特网路由器排队延迟测量方案

2019 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2019-04-08 DOI: 10.1109/ICCNC.2019.8685606

Khondaker M. Salehin, R. Rojas-Cessa, Ki-Won Kwon

引用次数: 3

Expected Capacity Guaranteed Routing based on Dynamic Link Failure Prediction 基于动态链路故障预测的期望容量保证路由

2019 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2019-04-08 DOI: 10.1109/ICCNC.2019.8685646

Shu Sekigawa, S. Okamoto, N. Yamanaka, E. Oki

{"title":"Expected Capacity Guaranteed Routing based on Dynamic Link Failure Prediction","authors":"Shu Sekigawa, S. Okamoto, N. Yamanaka, E. Oki","doi":"10.1109/ICCNC.2019.8685646","DOIUrl":"https://doi.org/10.1109/ICCNC.2019.8685646","url":null,"abstract":"In a high-speed backbone network, the failure of network links may cause large data losses, so it is necessary to reserve spare network resources for faster recovery. The conventional protection methods that reserve backup paths do not consider the failure probability of each network link and allocate same amount of network resources for the backup paths regardless of the failure rate of network links. This leads to the excessive or insufficient capacity allocation. This paper proposes the routing method that guarantees the expected value of the allocated capacity based on dynamically changed link failure rate. We formulate a Mixed Integer Liner Programming (MILP) model for the proposed method. We conduct simulations to investigate the effect of the expected capacity guaranteed routing over the conventional routing method in terms of bandwidth blocking probability, transmitted capacity achieved ratio, and the ratio of total transmitted capacity to total requested capacity. The results show that our proposed method marks higher transmitted capacity achieved ratio compared to conventional routing methods. We also find the transmitted capacity achieved ratio of the proposed method maintains 90% under high failure rate.","PeriodicalId":161815,"journal":{"name":"2019 International Conference on Computing, Networking and Communications (ICNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114763551","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

Online Reconfigurable Antenna State Selection based on Thompson Sampling 基于汤普森采样的在线可重构天线状态选择

2019 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2019-04-08 DOI: 10.1109/ICCNC.2019.8685555

Tianchi Zhao, Ming Li, G. Ditzler

{"title":"Online Reconfigurable Antenna State Selection based on Thompson Sampling","authors":"Tianchi Zhao, Ming Li, G. Ditzler","doi":"10.1109/ICCNC.2019.8685555","DOIUrl":"https://doi.org/10.1109/ICCNC.2019.8685555","url":null,"abstract":"Reconfigurable antennas (RAs) are capable of dynamically and swiftly changing their radiation patterns, which enables them to adapt to channel variations and enhance link capacity. To fully exploit the benefits of RAs, the antenna states need to be optimally selected on-the-fly. The main challenges are two-fold: uncertainty of channel over time, and a large number of candidate antenna states. Previous approaches can only deal with a small number of antenna states, or suffer from slow convergence. In this paper, we propose an optimal online antenna state selection framework for SISO and MISO wireless links, based on the Thompson sampling algorithm for general stochastic bandits. In order to enhance the convergence rate for large antenna state sets, we propose two novel antenna state pruning strategies and integrate them with Thompson sampling, which exploit the relationship between antenna radiation pattern and channel state. The first one requires knowledge of angles of departure of the channel, while guaranteeing convergence to optimality. The other one doesn’t require any prior channel information. Simulation results using a real-world reconfigurable antenna’s radiation patterns show that, both of our proposed learning algorithms can significantly improve the convergence rate and yield much lower regret compared with existing schemes.","PeriodicalId":161815,"journal":{"name":"2019 International Conference on Computing, Networking and Communications (ICNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134200733","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}

引用次数: 10

Blind Carrier Frequency Offset Estimation in Generalized Frequency Division Multiplexing 广义频分复用中载波频偏盲估计

2019 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2019-02-18 DOI: 10.1109/ICCNC.2019.8685592

Ana Belen Martinez, Maximilian Matthé, Marwa Chafii, G. Fettweis

引用次数: 2

Clustering the Unknown - The Youtube Case 聚类未知——Youtube案例

2019 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2019-02-18 DOI: 10.1109/ICCNC.2019.8685364

A. Dvir, Angelos K. Marnerides, Ran Dubin, Nehor Golan

{"title":"Clustering the Unknown - The Youtube Case","authors":"A. Dvir, Angelos K. Marnerides, Ran Dubin, Nehor Golan","doi":"10.1109/ICCNC.2019.8685364","DOIUrl":"https://doi.org/10.1109/ICCNC.2019.8685364","url":null,"abstract":"Recent stringent end-user security and privacy requirements caused the dramatic rise of encrypted video streams in which YouTube encrypted traffic is one of the most prevalent. Regardless of their encrypted nature, metadata derived from such traffic flows can be utilized to identify the title of a video, thus enabling the classification of video streams into a single video title using a given video title set. Nonetheless, scenarios where no video title set is present and a supervised approach is not feasible, are both frequent and challenging. In this paper we go beyond previous studies and demonstrate the feasibility of clustering unknown video streams into subgroups although no information is available about the title name. We address this problem by exploring Natural Language Processing (NLP) formulations and Word2vec techniques to compose a novel statistical feature in order to further cluster unknown video streams. Through our experimental results over real datasets we demonstrate that our methodology is capable to cluster 72 video titles out of 100 video titles from a dataset of 10,000 video streams. Thus, we argue that the proposed methodology could sufficiently contribute to the newly rising and demanding domain of encrypted Internet traffic classification.","PeriodicalId":161815,"journal":{"name":"2019 International Conference on Computing, Networking and Communications (ICNC)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127713570","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}

引用次数: 7