{"title":"Pricing and revenue optimization strategy in macro-femto heterogeneous networks","authors":"Wafa Werda, Bo Gu, K. Yamori, Y. Tanaka","doi":"10.1109/APNOMS.2016.7737195","DOIUrl":"https://doi.org/10.1109/APNOMS.2016.7737195","url":null,"abstract":"The ongoing enhancement of mobile devices capabilities and advanced technologies has largely contributed to the huge increase of wireless traffic demand. Mobile network operators around the world are struggling to manage this new era of higher generation networks by finding new means and strategies to implement in order to meet the explosion in traffic demand. One of the current and most efficient strategies to handle this issue is the femtocell technology, which now has drawn the interest of main concerned actors as for manufacturers, operators, and researchers. In this paper, our main motivation was to address the macro-femto heterogeneous networks deployment issue from the economic side. Thus, we aimed to propose a pricing strategy for macro-femto networks with a user centric vision where users would have the choice to access one of the networks based on the proposed service price when he/she is accessing it. Based on our strategy, a wireless service provider's (WSP's) revenue optimization is then performed and evaluated in order to show the efficiency of our proposed pricing scheme.","PeriodicalId":194123,"journal":{"name":"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"157 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121529023","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}
Zhi Liu, M. Dong, Bo Gu, Cheng Zhang, Yusheng Ji, Y. Tanaka
{"title":"Impact of item popularity and chunk popularity in CCN caching management","authors":"Zhi Liu, M. Dong, Bo Gu, Cheng Zhang, Yusheng Ji, Y. Tanaka","doi":"10.1109/APNOMS.2016.7737213","DOIUrl":"https://doi.org/10.1109/APNOMS.2016.7737213","url":null,"abstract":"Content Centric Network (CCN) has become a heated research topic recently, as it is proposed as an alternative of the future network. The routers in CCN have the caching abilities and the caching strategies affect the system performance greatly. Each content in CCN is associated with a popularity, which is determined by the corresponding requested times. Popularity-aware caching scheme caches the popular content close to users and can lead to better caching performance in terms of smaller average transmission hops traveled. Content popularity significantly affects the overall system performance, and the content size is not considered during the content level popularity (i.e. item popularity) calculation. In this paper, we study the impact of the item popularity and chunk popularity in CCN, where the chunk popularity is the normalized item popularity considering the content size. Extensive simulations are conducted and the simulation results show the advantages and disadvantages of each scheme. A new popularity calculation method is proposed to perform the tradeoff between the item popularity and chunk popularity.","PeriodicalId":194123,"journal":{"name":"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130479764","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}
{"title":"Congestion field detection for Service Quality improvement using Kernel density estimation","authors":"Yuki Shitara, T. Yamazaki, K. Yamori, T. Miyoshi","doi":"10.1109/APNOMS.2016.7737246","DOIUrl":"https://doi.org/10.1109/APNOMS.2016.7737246","url":null,"abstract":"Owing to proliferation of smart phones, communication services such as a video streaming service are common in a mobile situation. For these services, quality evaluation and communication control based on Quality of Experience (QoE), which is the degree of a user's subjective satisfaction, is very important because the final goal of delivering high-quality service is improving user's satisfaction. QoE tends to be affected by several factors including Quality of Service (QoS). Therefore, collecting QoS data from the users who use the mobile application has become one of promising schemes to meet the QoE, which is called the crowd sourcing data. The crowd sourcing data are, however, apt to be affected by sensing errors and low accuracy. In this study, we propose to estimate some densities just from the records of application use and its location information to remove the sensing errors and low accuracy. The Kernel density estimator is used to derive a continuous density function from discrete distributed sample data such as the collected QoS data. From the viewpoint of QoS, it is important to extract high-density fields of the application use to find out QoS degradation. After estimating the Kernel density estimator, we determine the borderline between the high-density field and the other field by using the reference value that can be determined from the observed data. Simulated experiments verify effectiveness of the proposed method.","PeriodicalId":194123,"journal":{"name":"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124542189","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}
{"title":"Dynamic module deployment in a fog computing platform","authors":"Hua-Jun Hong, P. Tsai, Cheng-Hsin Hsu","doi":"10.1109/APNOMS.2016.7737202","DOIUrl":"https://doi.org/10.1109/APNOMS.2016.7737202","url":null,"abstract":"Several applications, such as smart cities, smart homes and smart hospitals adopt Internet of Things (IoT) networks to collect data from IoT devices. The incredible growing speed of the number of IoT devices congests the networks and the large amount of data, which are streamed to data centers for further analysis, overload the data centers. In this paper, we implement a fog computing platform that leverages end devices, edge networks, and data centers to serve the IoT applications. In this paper, we focus on implementing a fog computing platform, which dynamically pushes programs to the devices. The programs pushed to the devices pre-process the data before transmitting them over the Internet, which reduces the network traffic and the load of data centers. We survey the existing platforms and virtualization technologies, and leverage them to implement the fog computing platform. Moreover, we formulate a deployment problem of the programs. We propose an efficient heuristic deployment algorithm to solve the problem. We also implement an optimal algorithm for comparisons. We conduct experiments with a real testbed to evaluate our algorithms and fog computing platform. The proposed algorithm shows near-optimal performance, which only deviates from optimal algorithm by at most 2% in terms of satisfied requests. Moreover, the proposed algorithm runs in real-time, and is scalable. More precisely, it computes 1000 requests with 500 devices in <; 2 seconds. Last, the implemented fog computing platform results in real-time deployment speed: it deploys 20 requests <; 10 seconds.","PeriodicalId":194123,"journal":{"name":"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121444544","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}
Taku Yamazaki, R. Yamamoto, T. Miyoshi, T. Asaka, Y. Tanaka
{"title":"Forwarding mechanism using prioritized forwarders for opportunistic routing","authors":"Taku Yamazaki, R. Yamamoto, T. Miyoshi, T. Asaka, Y. Tanaka","doi":"10.1109/APNOMS.2016.7737221","DOIUrl":"https://doi.org/10.1109/APNOMS.2016.7737221","url":null,"abstract":"In ad hoc networks, backoff-based OR (opportunistic routing) protocols, which autonomously selects a forwarder among the potential forwarders based on a random backoff time, have been proposed. However, each potential forwarder must wait for the backoff time to avoid packet collisions among receivers. In addition, the terminal density strongly affects the performance since the backoff-based OR protocols improve the performance by using multiple terminals. In this paper, we propose a novel OR protocol called PRIOR (prioritized forwarding for opportunistic routing). In PRIOR, a terminal called prioritized forwarder, which forwards packets without using a backoff time, is selected among neighbours. In addition, we propose a hop-by-hop retransmission control that performs the retransmission terminal selection on the basis of a neighbour relation with the PFs. Moreover, we introduce an explicit acknowledgement mechanism on the basis of the difference of hop counts to alleviate the bad effect of the retransmission control in dense environments. Finally, we evaluate PRIOR in comparison with conventional backoff-based OR protocols in computer simulation.","PeriodicalId":194123,"journal":{"name":"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132885445","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}
{"title":"A reinforcement learning approach for cost- and energy-aware mobile data offloading","authors":"Cheng Zhang, Bo Gu, Zhi Liu, K. Yamori, Y. Tanaka","doi":"10.1109/APNOMS.2016.7737203","DOIUrl":"https://doi.org/10.1109/APNOMS.2016.7737203","url":null,"abstract":"With rapid increases in demand for mobile data, mobile network operators are trying to expand wireless network capacity by deploying WiFi hotspots to offload their mobile traffic. However, these network-centric methods usually do not fulfill interests of mobile users (MUs). MUs consider many problems to decide whether to offload their traffic to a complementary WiFi network. In this paper, we study the WiFi offloading problem from MU's perspective by considering delay-tolerance of traffic, monetary cost, energy consumption as well as the availability of MU's mobility pattern. We first formulate the WiFi offloading problem as a finite-horizon discrete-time Markov decision process (FDTMDP) with known MU's mobility pattern and propose a dynamic programming based offloading algorithm. Since MU's mobility pattern may not be known in advance, we then propose a reinforcement learning based offloading algorithm, which can work well with unknown MU's mobility pattern. Extensive simulations are conducted to validate our proposed offloading algorithms.","PeriodicalId":194123,"journal":{"name":"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"26 32","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131613632","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}
M. Ghanem, Olivier Fourmaux, Fabien Tarissan, T. Miyoshi
{"title":"P2PTV multi-channel peers analysis","authors":"M. Ghanem, Olivier Fourmaux, Fabien Tarissan, T. Miyoshi","doi":"10.1109/APNOMS.2016.7737215","DOIUrl":"https://doi.org/10.1109/APNOMS.2016.7737215","url":null,"abstract":"After being the support of the data and voice convergence, the Internet has become one of the main video providers such as TV-stream. As an alternative to limited or expensive technologies, P2PTV has turned out to be a promising support for such applications. This infrastructure strongly relies on the overlay composed by the peers that consume and diffuse video contents at the same time. Understanding the dynamical properties of this overlay, and in particular how the users switch from one overlay to another, appears to be a key aspect if one wants to improve the quality of P2PTV. In this paper, we investigate the question of relying on non-invasive measurement techniques to track the presence of users on several channels of P2PTV. Using two datasets obtained by using network measurement on P2PTV infrastructure, we show that such an approach contains sufficient information to track the presence of users on several channels. Besides, exploiting the view provided by sliding time windows, we are able to refine the analysis and track users that switch from one channel to another, leading to the detection of super-peers and providing explanations of the different roles they can play in the infrastructure. In addition, by comparing the results obtained on the two datasets, we show how such analyses can shed some light on the evolution of the infrastructure policy.","PeriodicalId":194123,"journal":{"name":"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"149 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122921122","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}
{"title":"A two-layer hierarchical framework for activity sequence recognition by wearable sensors","authors":"G. Chan, Dong-Hung Lin, Chih-Wei Yi, C. Tseng","doi":"10.1109/APNOMS.2016.7737259","DOIUrl":"https://doi.org/10.1109/APNOMS.2016.7737259","url":null,"abstract":"As the aging population grows, the elderly care service has become an important part of the service industry in the aging population era. Activity monitoring is one of the most important services in the field of the elderly care service. In this paper, we proposed a wearable solution to provide an activity monitoring service on elders for caregivers. This service monitors restroom activities, such as washing hands, urinating and defecation. In the proposed solution, wireless motion sensors are wore on elder's wrist and waist to measure their body movement. The measured motion data are processed to statistical features and aggregated to cloud servers through gateways. A two-layer hierarchical framework is used for the activity recognition. In the first layer, a preliminary recognition is performed by a supervised Reduced Error Pruning (REP) Tree classifier to detect the transition of the activity. In the second layer, a Variable Order Hidden Markov Model (VOHMM) is proposed to determine the sequence of the activities. The experiment results show that the recognition accuracy is 70 percent. We developed a prototype service App to provide a life log for the recording of the activity sequence. The caregivers can make use of this information to take necessary actions accordingly.","PeriodicalId":194123,"journal":{"name":"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115758465","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}
Seydou Ba, Akio Kawabata, Bijoy Chand Chatterjee, E. Oki
{"title":"Computational time complexity of allocation problem for distributed servers in real-time applications","authors":"Seydou Ba, Akio Kawabata, Bijoy Chand Chatterjee, E. Oki","doi":"10.1109/APNOMS.2016.7737236","DOIUrl":"https://doi.org/10.1109/APNOMS.2016.7737236","url":null,"abstract":"This paper analyzes the computational time complexity of the allocation problem for data processing functions among multiple users and distributed servers in the distributed processing communication scheme for a real-time network application. In the distributed processing communication scheme, the application is processed on a data processing function in the distributed servers in order to minimize the delay time. We prove that the allocation problem for data processing functions among multiple users and distributed servers is an NP-complete problem.","PeriodicalId":194123,"journal":{"name":"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117168143","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}
{"title":"A proposal of SDN based mobility management in multiple domain networks","authors":"Misumi Hata, S. Izumi, Toru Abe, T. Suganuma","doi":"10.1109/APNOMS.2016.7737263","DOIUrl":"https://doi.org/10.1109/APNOMS.2016.7737263","url":null,"abstract":"In this paper, we propose a mobility management architecture based on Software Defined Network (SDN) for multiple domain networks. In this architecture, each SDN controller cooperates with each other to optimize communication route covering multiple domain networks for seamless IP services even when the mobile devices move to other domain. This paper presents the basic design of the architecture and protocol to cover wide area for mobility management. We also show the initial experiments to confirm the behavior of our proposed architecture.","PeriodicalId":194123,"journal":{"name":"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"371 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124653827","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}