{"title":"SDN integration in LTE mobile backhaul networks","authors":"J. Costa-Requena","doi":"10.1109/ICOIN.2014.6799479","DOIUrl":"https://doi.org/10.1109/ICOIN.2014.6799479","url":null,"abstract":"The major challenge in future mobile networks is how to improve throughput to support the increase demand in traffic. Software Defined Networks is the new technology proposed but so far it has been proposed to be integrated in the current 4G architecture without major changes. However, we present the mobile networks beyond 4G where Software Defined Network should be used in a more disruptive approach to redesign the current architecture. This proposal includes the proper migration path to ensure reasonable transition phase. The objective is not to meet short term needs but to fulfill the future throughput requirements by revamping the transport network in the mobile backhaul, and moving most of the current LTE network elements to the cloud. In this approach we remove completely the core mobile network as it is known today. Instead, the mobile architecture beyond 4G consists of a simplified access network formed by base stations i.e. eNodeBs, interconnected through a backhaul network composed by SDN switches managed from the cloud together with the rest of LTE network elements.","PeriodicalId":388486,"journal":{"name":"The International Conference on Information Networking 2014 (ICOIN2014)","volume":"501 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116195004","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":"Optimization of broadband wireless networks with centralized control using memetic algorithm","authors":"S. Horng, Feng-Yi Yang","doi":"10.1109/ICOIN.2014.6799746","DOIUrl":"https://doi.org/10.1109/ICOIN.2014.6799746","url":null,"abstract":"In this paper, a k-limited polling system enabling an adequate description of broadband wireless networks with centralized control is presented. A memetic algorithm (MA) is proposed to solve the k-limited polling system to obtain a good enough solution (k-limited threshold) using limited computation time. The proposed MA combines the global search and local search to achieve a balance between the exploration and exploitation in searching through the solution space. Firstly, a crude evaluation based on a small amount of transmitted packets is constructed to approximately evaluate the performance of a solution. In global search, we apply the real-coded genetic algorithm (GA) associated with crude evaluation to select N roughly good solutions from huge solution space to construct the selected subset. In local search, the simulated annealing (SA) assisted by crude evaluation is utilized to search for N neighboring optima to form the candidate subset. Finally, a ranking and selection (R&S) technique is used to select the best solution among the N neighboring optima in the candidate subset. As for the performance of minimizing the average of total expected waiting and loss cost, we have demonstrated that our approach drastically outperforms the developed service disciplines. The good enough solution obtained by our method is promising in the aspects of solution quality and computational efficiency.","PeriodicalId":388486,"journal":{"name":"The International Conference on Information Networking 2014 (ICOIN2014)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121030348","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 virtual machine consolidation framework for CloudStack platforms","authors":"Tanasak Janpan, V. Visoottiviseth, Ryousei Takano","doi":"10.1109/ICOIN.2014.6799494","DOIUrl":"https://doi.org/10.1109/ICOIN.2014.6799494","url":null,"abstract":"Virtual machine (VM) consolidation is an emerging solution for energy saving in cloud data centers. An appropriate VM consolidation policy must change accordingly, depending on the situation. To easily deploy a VM consolidation solution, this paper proposes a VM consolidation framework for Apache CloudStack, which is a popular open source cloud platform software suite. We separate the VM consolidation mechanism from the policy used to decide which VMs should be moved to somewhere more appropriate to run. This framework is a modular architecture that combines various resource monitoring systems, power control mechanisms, and VM packing algorithms. Using the proposed framework, we have demonstrated that a Web application can consolidate and deconsolidate VMs so as to balance the load of CPU utilization among physical machines in response to the number of physical machines in operation. Experimental results reveal the proposed framework is preliminary, but provides the required functionality.","PeriodicalId":388486,"journal":{"name":"The International Conference on Information Networking 2014 (ICOIN2014)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121377798","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}
T. Orawiwattanakul, H. Otsuki, Eiji Kawai, S. Shimojo, K. Yamaji, Motonori Nakamura
{"title":"Path selection in inter-domain dynamic circuit network (DCN) based on a probabilistic link failure model","authors":"T. Orawiwattanakul, H. Otsuki, Eiji Kawai, S. Shimojo, K. Yamaji, Motonori Nakamura","doi":"10.1109/ICOIN.2014.6799744","DOIUrl":"https://doi.org/10.1109/ICOIN.2014.6799744","url":null,"abstract":"In recent years, many large academic networks have deployed a dynamic circuit network (DCN) controller, such as OSCARS or autoBAHN, to provide on-demand virtual circuits (VCs) across multiple administrative domains. The challenge in implementing a DCN is inter-domain quality of service (QoS) provisioning. In practice, service-sensitive applications, e.g., large distributed systems and live-video applications, require not only bandwidth guarantee but also high availability. This paper proposes explicit QoS framework in an inter-domain DCN, in which the user can specify the path selection policies (PSPs), i.e., least hop, highest availability (loose QoS), or highest availability (strict QoS). For an availability constraint, a probabilistic link failure model is used to find high-availability paths. The system is developed on OSCARS v.6, and the experiments on the control plane are presented in this paper.","PeriodicalId":388486,"journal":{"name":"The International Conference on Information Networking 2014 (ICOIN2014)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126990520","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":"FRT-2-Chord: A DHT supporting seamless transition between one-hop and multi-hop lookups with symmetric Routing Table","authors":"Y. Ando, Hiroya Nagao, T. Miyao, Kazuyuki Shudo","doi":"10.1109/ICOIN.2014.6799686","DOIUrl":"https://doi.org/10.1109/ICOIN.2014.6799686","url":null,"abstract":"FRT-2-Chord is a DHT based on Flexible Routing Tables, a method for designing routing algorithms for overlays. DHTs should consider the following factors when constructing overlay topologies: the number of nodes, identifier distance, network proximity and node groups. Existing DHTs either do not adapt to those factors or focus on only some of them. FRT-2-Chord is more adaptable and achieves efficient routing under a variety of conditions of those factors. Theoretical analysis and experimental results show the efficiency of FRT-2-Chord.","PeriodicalId":388486,"journal":{"name":"The International Conference on Information Networking 2014 (ICOIN2014)","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114838732","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}
Saeed Ullah, Imdad Ullah, H. K. Qureshi, Rim Haw, Sungman Jang, C. Hong
{"title":"Passive packet loss detection in Wi-Fi networks and its effect on HTTP traffic characteristics","authors":"Saeed Ullah, Imdad Ullah, H. K. Qureshi, Rim Haw, Sungman Jang, C. Hong","doi":"10.1109/ICOIN.2014.6799718","DOIUrl":"https://doi.org/10.1109/ICOIN.2014.6799718","url":null,"abstract":"In this paper, we analyze the performance of web applications that run on top of TCP over the passively collected data from an operational network based on wireless infrastructure. In particular, we evaluate the impact of 1) TCP loss rates; 2) user interrupts; 3) connection volume and their durations; and 4) variations in TCP throughputs on web applications. Since TCP behavior is dependent on events like packet losses, timeouts, and connection terminations, which affect the behavior of TCP-based web applications. The phenomena is more prominent in wireless networks. Our collected real network traffic traces provides very interesting insight on the TCP behavior showing the effect of TCP throughput on packet losses and user interrupted connections, which in turn also increases unnecessary retransmissions. Our performance evaluation reveal that the longer duration and higher volumes of TCP connections is a function of higher interrupted connections and loss rates. By further studying the statistical properties of TCP connections shows that the loss rate increases with decrease in connection duration, and also leads to frequent termination of TCP connections.","PeriodicalId":388486,"journal":{"name":"The International Conference on Information Networking 2014 (ICOIN2014)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117075280","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 sequential pattern mining using dynamic in stream environment","authors":"Pilsun Choi, Hwan Kim, B. Hwang","doi":"10.1109/ICOIN.2014.6799733","DOIUrl":"https://doi.org/10.1109/ICOIN.2014.6799733","url":null,"abstract":"Sequential pattern mining is the technique which finds out frequent patterns from the data set in time order. In this field, dynamic weighted sequential pattern mining is applied to a computing environment that changes according to the time, and it can be applied to a variety of environments applying changes of dynamic weight. In this paper, we propose a new sequence data mining method to discover frequent sequential patterns by applying the dynamic weight. This method reduces the number of candidate patterns by using the dynamic weight according to the relative time sequence. This method reduces the memory usage and processing time more than applying the existing methods dramatically. We show the importance of dynamic weighted mining through the comparison of existing weighted pattern mining techniques.","PeriodicalId":388486,"journal":{"name":"The International Conference on Information Networking 2014 (ICOIN2014)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123980688","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}
António Homem Ferreira, R. Pereira, Fernando M. Silva
{"title":"Partial Swarm Merger: Increasing BitTorrent content availability","authors":"António Homem Ferreira, R. Pereira, Fernando M. Silva","doi":"10.1109/ICOIN.2014.6799742","DOIUrl":"https://doi.org/10.1109/ICOIN.2014.6799742","url":null,"abstract":"The BitTorrent Peer-to-Peer file sharing protocol is a popular way to distribute digital content. Despite its high scalability and capacity for fast file replication, BitTorrent struggles to replicate rare or unpopular content. Previous work has shown that there is a potential to increase file availability, as there are torrents which share common parts. These arise, e.g., when people publish the same files using different names. This paper presents Partial Swarm Merger (PSM), a novel approach to increase the availability for unpopular content and thus BitTorrent's performance. PSM exploits the redundancy of content being shared across different swarms. PSM is able to automatically detect torrents with similar content, increasing the number of sources. It does this resorting only to the torrent file info key, which contains hash values for each file part. With PSM, a peer can connect to the several swarms that are sharing files common with the files the peer is downloading. This way, the peer participates in several swarms, announcing and requesting just the common content pieces the original download has with these swarms. Through measurement results, we show that PSM can decrease the download time for all peers and not just the ones using PSM.","PeriodicalId":388486,"journal":{"name":"The International Conference on Information Networking 2014 (ICOIN2014)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129287966","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":"Beamspace MIMO system with different elements distances in ESPAR array antenna","authors":"Bong-Jun Kim, H. Ryu","doi":"10.1109/ICOIN.2014.6799672","DOIUrl":"https://doi.org/10.1109/ICOIN.2014.6799672","url":null,"abstract":"In this paper, we evaluate performance of beamspace MIMO(Multiple-Input Multiput Output) system using three-element ESPAR antenna according to distance of ESPAR(Eletronically Steerable Parasitic Array Radiator) antenna array when transmitting two BPSK(Binary Phase Shift Keying) symbols. Through the simulation, we confirm that three-element ESPAR antenna can transmit two BPSK symbols, and performance degradation can reduce by changing a reactance of parasitic element.","PeriodicalId":388486,"journal":{"name":"The International Conference on Information Networking 2014 (ICOIN2014)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131303181","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}
N. Khaitiyakun, T. Sanguankotchakorn, Apinun Tunpan
{"title":"Data dissemination on MANET using content delivery network (CDN) technique","authors":"N. Khaitiyakun, T. Sanguankotchakorn, Apinun Tunpan","doi":"10.1109/ICOIN.2014.6799732","DOIUrl":"https://doi.org/10.1109/ICOIN.2014.6799732","url":null,"abstract":"One major problem in MANET is the mutual interferences between each nodes sending data to destination. In this paper, we propose a data dissemination technique on Vehicular Network deploying OLSR mobile ad hoc network in a city scenario. In our proposed algorithm, when deploying content delivery network (CDN) technique, data is delivered via the CDN nodes which are closer to final destination than the original sender node. In this work, multipoint relays (MPRs) nodes are used as the CDN nodes since these node cover all the subscriber nodes optimally due to the nature of OLSR. It can be anticipated that this scheme is suitable to deliver the information from unexpected event or congestions arising in a city.","PeriodicalId":388486,"journal":{"name":"The International Conference on Information Networking 2014 (ICOIN2014)","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122917933","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}