Journal of High Speed Networks - Volume 23, issue 3

Authors: Kim, Chulmin | Kim, Cheeha

Article Type: Research Article

Abstract: In-band simultaneous transmission between an access point (AP) and a node was enabled by recent full-duplex radio communication research. While this event was expected to increase throughput within the feasibility of full-duplex radio communication, the conventional Medium Access Control (MAC) Distributed Coordination Function (DCF) protocol in wireless local area networks (WLAN) limits this performance enhancement. Each node competes for transmission opportunities because DCF is based on half-duplex communication principles. The competition among nodes and an AP creates excessive overhead and many collisions. In this paper, we propose a new MAC protocol called Reservation-Based Medium-Access Control (RMAC) based on node reservation …in WLAN with full-duplex radio. RMAC is compatible with DCF. RMAC decreases collisions by reducing the number of competing nodes and increases throughput by reducing competition overhead. Our RMAC assures nodes a transmission opportunity without collision if a node has several packets to send. We show that RMAC achieves at least 86.3% more throughput than full-duplex radio based on DCF. The RMAC protocol also maintains high throughput even in cases of dense node deployment. Show more

Keywords: Wireless LAN, computer networks, full-duplex radio, Medium Access Control

DOI: 10.3233/JHS-170565

Citation: Journal of High Speed Networks, vol. 23, no. 3, pp. 187-199, 2017

Authors: Wang, Xiaonan | Cheng, Hongbin | Yao, Yufeng

Article Type: Research Article

Abstract: In wireless networks, the handover in the network layer (L3) is usually initiated after the handover in the link layer (L2) is complete, so the total handover delay is equal to the sum of the L2 handover delay and the L3 handover delay. In order to reduce the total handover delay, this paper studies the correlations between the L2 messages and L3 ones, and proposes a cross-layering handover scheme. The main idea behind this scheme is to effectively combine the related messages in L2 and L3 and achieve the L3 handover with the L2 messages in order to minimize the …effect of the L3 handover delay on the total handover delay. The performance of this scheme is evaluated, and the results show that this scheme effectively reduces the total handover delay. Show more

Keywords: IPv6, handover, IEEE 802.16, cross-layering

DOI: 10.3233/JHS-170566

Citation: Journal of High Speed Networks, vol. 23, no. 3, pp. 201-213, 2017

Authors: Chen, Le | Xie, Linquan | Yang, Shuxin | Cao, Ying | Huang, Ge | Li, Xiaorong

Article Type: Research Article

Abstract: The detection of complexes in protein–protein interaction (PPI) network bears great significance in predicting unknown protein and providing theoretical basis for various researches on a wide array of diseases. In this paper, a PPI network complexes detection algorithm based on Harmony Search Clustering Optimization Model (HMS-CD) is being proposed. Compared with the traditional harmony search algorithm, dynamic parameter of HMCR and BW is introduced to improve the search strategy. The method to find a set of nodes with a larger aggregation coefficient in PPI network is regarded as the objective function of the proposed algorithm. The experimental result on a …real dataset like yeast PPI network shows that the proposed algorithm achieves better detection accuracy than traditional harmony search (HMS) algorithm and typical MCODE algorithm, and it can detect complexes in PPI network more effectively. Show more

Keywords: Harmony search, complexes detection, PPI network

DOI: 10.3233/JHS-170567

Citation: Journal of High Speed Networks, vol. 23, no. 3, pp. 215-223, 2017

Authors: Balzano, Walter | Murano, Aniello | Stranieri, Silvia

Article Type: Research Article

Abstract: Inter-vehicular communication is a very hot topic in the most recent research environment, since the management of traffic information is an important issue in order either to minimize the number of accidents, or to optimize the road safety. The most known traffic control systems are the VANETs (Vehicular Ad Hoc Network), a decentralized structure by which vehicles are able to communicate to each other, by exploiting some OBUs (On Board Units), which actually realize signals transmission. The main idea of this work is to transform the decentralized structure, typical of the VANETs, into a centralized one. In this way, …we can obtain many advantages, such as a simpler clustering process: this last is a very important operation concerning the organization of some objects in more groups, according to some criteria which can improve the performances of a system, in general. In this case, we would exploit this notion, in order to reduce a phenomenon, known as “broadcast storm”, which is very frequent when we speak about VANETs and causes most of the collisions occurring during the communication between vehicles. According to this goal, we provide, in this work, a non-exclusive clustering algorithm, by exploiting the simplicity and the expressive power of Prolog programming language. Moreover, in this work we also underline the utility of equipping this communication framework with a central unit which, on one hand, has a full knowledge of the network topology, on the other hand, it is able to collect, manage, store, and process the most important recovered data and, consequentially, to make some significant statistics. Finally, we evaluate some improvement possibilities of the described model, by integrating it with some of the most common electronic devices, which can rise its performances. Show more

Keywords: VANET, broadcast storm, network topology, Prolog, clustering

DOI: 10.3233/JHS-170568

Citation: Journal of High Speed Networks, vol. 23, no. 3, pp. 225-236, 2017

Authors: Soursouri, Masoud | Ahmadi, Mahmood

Article Type: Research Article

Abstract: In traditional networks, the control and data planes are integrated into a single system which makes complicated administrating and managing of these networks. Therefore, Software Defined Networking (SDN) decouples these planes using a single controller component. An SDN controller is a fundamental element that consists of applications, northbound and southbound interfaces. It also creates and manages a general view of the whole network. The increasing attempts to improve the performance of the controller have been performed, which proposed the centralized and distributed architectures for the controllers. In this paper, a service to allocate the resources to an SDN controller is …proposed. Resources such as CPU and memory based on demand are allocated. In addition, to efficient use of resources when they are not needed, deallocation of resources is done. This service has been designed based on the XenServer hypervisor OpenStack platform, OpenDayLight SDN controller and their capabilities to change the resources dynamically. The results related to resource usage show that increasing the number of switches increases the number of CPUs, and memory, linearly. Show more

Keywords: SDN controller, Cloud computing, XenServer hypervisor, adaptive resource allocation

DOI: 10.3233/JHS-170569

Citation: Journal of High Speed Networks, vol. 23, no. 3, pp. 237-253, 2017

Authors: Saidi, Mohand Yazid | Cousin, Bernard

Article Type: Research Article

Abstract: With the widespread use of real-time applications (VoIP, IPTV, Video conference, etc.) in Internet, protection and resource optimization become increasingly desired. Network protection aims to decrease the interruption time of communications by precomputing backup paths capable to receive and route traffics of affected primary paths upon failures. Resource optimization is achieved by improving data routing and resource sharing: data routing is often optimized by following the shortest paths whereas resource sharing is applied between the backup paths protecting against different failure risks. Two strategies of resource sharing are defined in literature: (1) backup sharing which limits the resource sharing to the …backup paths and (2) global sharing which extends the resource sharing to the primary and backup paths. In this paper, we compared the effects of resource sharing strategies on the resource utilization when the primary paths correspond to the shortest ones according to a static metric. With the single failure assumption, we show formally that the resource sharing between primary and backup paths is limited to some few links which cannot form a backup path. Thus, independently of the amount of resources (for instance: bandwidth) that can be shared between the primary and backup paths, the maximum number of backup paths is bounded. In our simulation, we comfort our formal result by showing that the two strategies have close acceptance rates of backup paths and protection bandwidth utilizations. Show more

Keywords: Routing, backup path, local path protection, resource sharing, shortest paths, MPLS, virtual networks

DOI: 10.3233/JHS-170570

Citation: Journal of High Speed Networks, vol. 23, no. 3, pp. 255-269, 2017