Journal of High Speed Networks - Volume 22, issue 2

Authors: Narayan, D.G. | Uma, Mudenagudi

Article Type: Research Article

Abstract: In this paper, we propose a cross-layer optimization technique for multi-radio Wireless Mesh Networks (WMNs) using new routing metric and load balancing mechanism. WMNs are an emerging technology and are used as a backhaul network to connect various types of networks to the internet. These networks consist of mesh routers with multi-radio support to enhance the capacity. As the traffic density is very high from the client mesh to the gateways, load balancing in these networks has become an important research issue. For this, multipath routing which can exploit the multi-radio capabilities to balance the traffic simultaneously through mesh routers …is required. To address this, we analytically derive the routing metric using IEEE 802.11 Distributed Coordination Function (DCF) delay model. Using this model, we propose a routing metric called Passive Interference and Delay Aware (PIDA) metric for multipath routing to find the interference free paths. We extend the work by performing load balancing on multiple paths as well as on multiple interfaces using the proposed metric. We implement our techniques using popular Ad hoc On-demand Multipath Distance Vector (AOMDV) routing protocol in NS2. The results reveal that PIDA performs better in terms of throughput and average delay compared to recently proposed routing metrics with minimal routing overhead. In addition, load balancing mechanism with PIDA metric shows better results depending on the congestion level in the network. Show more

Keywords: Wireless mesh network, cross-layer, passive metric, AOMDV, load balancing

DOI: 10.3233/JHS-160529

Citation: Journal of High Speed Networks, vol. 22, no. 2, pp. 77-93, 2016

Authors: Pradhan, Ashok Kumar | Das, Kunal | Ghosh, Atreye | De, Tanmay

Article Type: Research Article

Abstract: In this paper, we have considered an optimal design and provisioning of WDM networks for the grooming of sub-wavelengths traffic requests. As higher layer electronic ports, such as transceivers and optical splitters are dominant cost factors of an optical network, it is essential to reduce their numbers of use while grooming the multicast traffic requests into high bandwidth light-trees. This paper provides an optimal cost design of WDM networks with multicast traffic grooming under static traffic demand. We develop a unified framework for the optimal provisioning of different practical scenarios of multicast traffic grooming in a static traffic scenario. In …this study, we design an Integer linear Programming (ILP) formulation for multicast traffic grooming to minimize the cost associated with the higher layer electronic ports such as transceivers, splitters and wavelengths, and simultaneously maximize the bandwidth utilization of the network. We propose a heuristic algorithm called Efficient Light-Tree based Multicast Traffic Grooming (ELT-MTG) algorithm to achieve scalability in large size optical networks. Simulations are conducted on several standard well-known WDM mesh networks to study the design cost (based on number of transceivers, optical splitters and wavelengths) used in the networks. The result, thus obtained by comparison, helped us to conclude that the proposed approach ELT-MTG gives better performance than well-known existing logical-first sequential routing with single-hop grooming (LFSEQSH) and logical-first sequential routing with multi-hop grooming (LFSEQMH) algorithms in a static traffic environment. Show more

Keywords: Lightpath, light-tree, splitter, traffic grooming, wavelength division multiplexing (WDM)

DOI: 10.3233/JHS-160530

Citation: Journal of High Speed Networks, vol. 22, no. 2, pp. 95-111, 2016

Authors: Wang, Qun | Hu, Chao | Wei, Xianglin | Xu, Bo | Li, Yuan

Article Type: Research Article

Abstract: Substream-based P2P live streaming systems can achieve high performance according to multiple metrics, including distribution delay, system robustness and protocol overhead. However, the current division approach into substreams is not flexible and cannot be adaptive to dynamic network environments, which characterize the basic transport facilities for supporting P2P live streaming services. In this paper, we propose a virtual adaptive substream partition and scheduling protocol, namely VAStream, which can enforce substream partition or merge operation based on the current P2P network status. This protocol also presents properly crafted schemes to deal with the issues in complex network situation, and effectively makes …use of peer resources. Comparing with other mechanisms, the simulation results show that VAStream can achieve low distribution delay, high chunk arrival ratio and good system robustness. Show more

Keywords: Live streaming, P2P network, partition and mergence, substream scheduling

DOI: 10.3233/JHS-160531

Citation: Journal of High Speed Networks, vol. 22, no. 2, pp. 113-124, 2016

Authors: Krishnan, Sundaresan | Chaporkar, Prasanna

Article Type: Research Article

Abstract: Throughput improvement of the wireless LANs has been a constant area of research. Most of the work in this area focuses on designing throughput optimal schemes for fully connected networks (no hidden nodes). The schemes are optimal in a sense that they maximize the sum throughput subject to giving equal channel access opportunity to each user. But, we demonstrate that the optimal schemes proposed in the literature, though perform optimally in fully connected network, achieve significantly lesser throughput even than that of standard IEEE 802.11 in a network with hidden nodes. This motivates designing schemes that provide near optimal performance …even when hidden nodes are present. This problem is particularly challenging as mathematical models for networks with hidden nodes do not exist. Here, we consider the weighted fair throughput allocation policy that maximizes system throughput while guaranteeing that every user achieves a throughput that is proportional to their weights. We prove the optimality of the proposed scheme in a fully connected network. However, the specialty of the algorithm, as observed in the simulation study, is that it can provide the optimal throughput even in networks with hidden terminals. Unlike existing techniques, which use the mathematical model to derive invariant features, we attempt to maximize the throughput directly using stochastic approximation techniques, and hence does not require the estimation of any system parameters which can result in inaccurate predictions. Simulations show that our proposed policies perform better than the standard IEEE 802.11 protocol without or with hidden nodes present. Moreover, our proposed schemes outperform existing schemes when the network is not fully connected. Show more

Keywords: Stochastic approximation, optimization, wireless LANs, resource allocation, on-line algorithms

DOI: 10.3233/JHS-160532

Citation: Journal of High Speed Networks, vol. 22, no. 2, pp. 125-151, 2016

Authors: Wang, Hao | Zheng, Zhihua | Wu, Lei | He, Debiao

Article Type: Research Article

Abstract: We propose a new large-universe multi-authority ciphertext-policy attribute-based encryption system. In this system, any string can be used as an attribute of the system, and there are several authorities, each of which is responsible for the authorized key distribution of a specific set of attributes. Then, we prove its security under two static assumptions without random oracle. The main techniques used in this work are “Waters’ hash” over global identifier and attribute information in the construction, as well as dual system encryption in the security proof. To the best of our knowledge, this is the first ciphertext-policy attribute-based encryption system …satisfying both of “large-universe” property and “multi-authority” property without random oracle. Finally, as the application of our new scheme, we propose a new data access control scheme for cloud storage systems. Show more

Keywords: Large-universe, multi-authority, CP-ABE, Waters’ hash, without random oracle, cloud storage systems

DOI: 10.3233/JHS-160536

Citation: Journal of High Speed Networks, vol. 22, no. 2, pp. 153-167, 2016

Authors: Ziyi, Yang | Jun, Sang | Daxiang, Hong | Tong, Wang | Zhili, Xiang

Article Type: Research Article

Abstract: As user-generated content suffers from severe problems of data sparseness, many topic models designed for social network are proposed. Without a unified metric, the methods to weigh topics are mixed. Since topic models like Dirichlet Allocation (LDA) can summarize the main information of news articles, topics of short messages on social networking websites should reveal key features of the authors of messages. Personality is the natural characteristic of human. Past work on personality identification has shown that the words people say on social network can reveal people’s personality but none of them compare the effects of different topic model tactics …on personality identifying. We run LDA and one of its variant (Twitter-LDA) on real social network data (Facebook status messages) then use the topics distribution as features to identify pre-labelled Big-Five personality traits. The results demonstrate that the likelihood of personality as a metric can discover more features of topic models than the model designer said. Furthermore, our research add values to personality identification. Show more

Keywords: Social networks, topic models, personality

DOI: 10.3233/JHS-160540

Citation: Journal of High Speed Networks, vol. 22, no. 2, pp. 169-176, 2016