IEEE ComSoc International Communications Quality and Reliability Workshop
16-18 May 2017 – Naples, Florida, USA

2017 Technical Paper Abstracts


Hede Nakazato, Technical Program Co-Chair, presenting Best Paper trophy to    Nobuhiko Itoh, NEC Corporation


Best Paper! – Novel Packet Scheduling for Supporting Various Real-Time IoT Applications in LTE Networks by Nobuhiko Itoh, Hiroya Kaneko, Akihito Kohiga, Takanori Iwai and Hideyuki Shimonishi

AbstractLTE networks are attracting a great deal of attention as a platform for real-time IoT applications.  Vehicles periodically provide each other with their real-time location information to avoid automobile collision.  It is important to improve the total amount of application data that meets its deadline—we call the metric for this the goodput. However, Proportional Fair can obtain only very low goodput.  We propose packet scheduling method that adaptively prioritizes each item of application data on the basis of uplink/downlink deadlines and wireless channel quality.  We evaluate our method on NS-3 and find that our method outperforms the Proportional Fair.


Kai Zeng, Technical Program Co-Chair, presenting Best Paper trophy to Yusaku Hayamizu, Kansai University graduate student


Best Paper! – Effective New Cache Decision Policy for Breadcrumbs in Content-Centric Networking by Yusaku Hayamizu, Akihisa Shibuya and Miki Yamamoto

AbstractInformation-Centric Networking (ICN) has been proposed for efficient content distribution.  ICN routers are generally equipped with cache memories and store incoming data packets temporally.  In order to leverage as much total cache memories in a network as possible, the combination of routing policy and cache policy installed on the routers is dominant factor for performance.  For routing policy, efficient off-path forwarding with in-network guidance, Breadcrumbs, has been proposed.  In this paper, we propose a cache decision policy based on betweenness centrality and content popularity, which is suitable for Breadcrumbs.  Our proposed cache decision policy makes popular contents located edge area of a network, which stabilizes popular cached content.  And moderate popular contents tend to be stored core area, which induces in-network guided request to encounter cached contents more frequently.  Our performance evaluation results reveal that the combination of Breadcrumbs and our proposed cache policy improves cache hit performance compared to existing cache policies.


Quality Degradation Localization in Complex Message Processing Networks by Yuncheng Zhu, Hideki Okita and Seishi Hanaoka

Abstract Fault management of message processing networks requires fault localization on the higher layers. In this article, we propose a new fault localization technique for complex message processing networks, to locate specific network equipment that are highly correlated with the given service quality degradation occurrence. Our proposed technique utilizes the attempt and failure counters of message processing, and consists of two phases: processing failure model derivation and anomaly detection using the derived model. As a concrete example, the application in mobile core networks is described and evaluated. The simulation shows that our proposed technique is excellent in both accuracy and sensitivity.


Predictive Dynamic Bandwidth Allocation Based on the Correlation of the Bi-directional Traffic for Cloud-based Virtual PON-OLT by Keita Nishimoto, Masashi Tadokoro, Toshihito Fujiwara, Takashi Yamada, Toshikiyo Tanaka, Akiyuki Takeda and Takashi Inoue

Abstract We propose a new access network architecture named Cloud-based PON.  It separates the C-Plane/D-Plane functions of PON-OLT and consolidates the former in a datacenter.  We identify the increase in upstream delay (due to the increase in Round Trip Time) as a technical obstacle to the realization of the concept.  In order to solve this problem, we propose a predictive Dynamic Bandwidth Allocation algorithm that takes advantage of the correlation characteristic between the upstream and downstream traffic.  Simulations verify that our proposal improves the delay and the bandwidth utilization compared to the existing related works.


Heterogeneous Delay Tomography Based on Graph Fourier Transform in Mobile Networks by Hideaki Kinsho, Rie Tagyo, Daisuke Ikegami, Takahiro Matsuda, Akira Takahashi and Tetsuya Takine

Abstract – In this paper, we consider a wide area mobile network including heterogeneous network components such as base stations, routers, and servers, and aim to estimate delays at these components.  In order to estimate the delays, we propose heterogeneous delay tomography in mobile networks, which is a new network tomography scheme based on graph Fourier transform (GFT).  We assume that average delays of neighboring base stations are comparable and most of the servers have small delays.  Under these assumptions, the proposed scheme estimates delays at base stations in the GFT domain and delays at servers with Compressed Sensing.


Cross Layer Image Optimization (CLIO) for Wireless Video Transmission over 802.11ad Multi-Gigabit Channels by Amin Mobasher, Gregory Cook and Jalil Kamali

Abstract Wireless display is known to be the future of display technology where a world full of inexpensive displays is used for streaming various multimedia applications.  Due to the stringent requirements for high quality video transmission with low latency, a cross layer approach is needed to adapt to fast changes of the wireless link.  Here, we consider cross layer approaches over IEEE 802.11ad multi-gigabit wireless networks to increase QoS guarantee for real time multimedia applications.  This includes dynamic layering or partitioning on top of IEEE 802.11ad to switch among a set of procedures/parameters in the transmitter and receiver, including error correction technique, compression, or packetization on a packet by packet basis.  We propose a layered-based compression designed for an unequal error protection for treating ordered bit streams of different layers differently.  Dynamic importance aware tagging for packets is proposed as the third method. IEEE 802.11ad MAC and transport layer protocols and signaling are proposed to be modified to adapt for importance levels and corresponding information exchange.