• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.6
• /
• pp.269-274
• /
• 2013

In this paper, we propose the design and implementation method of picking system using zigbee wireless communication in order to solve problems of the conventional picking system which has expensive labors and maintenance costs. We use multi router based star-tree topology as a default routing topology to provide the reliable data transmission and define the method of ID configuration and data transmission. We confirm that successful data transmission ratio of multi router based picking system is maximum 20% higher than that of single router based picking system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.3
• /
• pp.1052-1070
• /
• 2016

Wireless Body Area Networks (WBANs) have received a lot of attention as a promising technology for medical and healthcare applications. A WBAN should guarantee energy efficiency, data reliability, and low data latency because it uses tiny sensors that have limited energy and deals with medical data that needs to be timely and correctly transferred. To satisfy this requirement, many multi-radio multi-channel MAC protocols have been proposed, but these cannot be implemented on current off-the-shelf sensor nodes because they do not support multi-radio transceivers. Thus, recently single-radio multi-channel MAC protocols have been proposed; however, these methods are energy inefficient due to data duplication. This paper proposes a TDMA-based single-radio, multi-channel MAC protocol that uses the Unbalanced Star+Mesh topology to satisfy the requirements of WBANs. Our analytical analysis together experiments using real sensor nodes show that the proposed protocol outperforms existing methods in terms of energy efficiency, reliability, and low data latency.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.7
• /
• pp.3329-3350
• /
• 2017

Installing caching and computing facilities in mobile edge networks is a promising solution to cope with the challenging capacity and delay requirements imposed on future mobile communication systems. The problem of optimal facility placement in mobile edge networks has not been fully studied in the literature. This is a non-trivial problem because the mobile edge network has a unidirectional topology, making existing solutions inapplicable. This paper considers the problem of optimal placement of a fixed number of facilities in a mobile edge network with an arbitrary tree topology and an arbitrary demand distribution. A low-complexity sequential algorithm is proposed and proved to be convergent and optimal in some cases. The complexity of the algorithm is shown to be $O(H^2{\gamma})$, where H is the height of the tree and ${\gamma}$ is the number of facilities. Simulation results confirm that the proposed algorithm is effective in producing near-optimal solutions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.7
• /
• pp.2977-2997
• /
• 2018

In big data era, fresh data grows rapidly every day. More than 30,000 gigabytes of data are created every second and the rate is accelerating. Many organizations rely heavily on real time streaming, while big data stream computing helps them spot opportunities and risks from real time big data. Storm, one of the most common online stream computing platforms, has been used for big data stream computing, with response time ranging from milliseconds to sub-seconds. The performance of Storm plays a crucial role in different application scenarios, however, few studies were conducted to evaluate the performance of Storm. In this paper, we investigate the performance of Storm under different application scenarios. Our experimental results show that throughput and latency of Storm are greatly affected by the number of instances of each vertex in task topology, and the number of available resources in data center. The fault-tolerant mechanism of Storm works well in most big data stream computing environments. As a result, it is suggested that a dynamic topology, an elastic scheduling framework, and a memory based fault-tolerant mechanism are necessary for providing high throughput and low latency services on Storm platform.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.5
• /
• pp.1333-1353
• /
• 2012

The robustness of a network is usually measured by error tolerance and attack vulnerability. Significant research effort has been devoted to determining the network design with optimal robustness. However, little attention has been paid to the problem of how to improve the robustness of existing networks. In this paper, we investigate how to optimize attack tolerance and communication efficiency of an existing network under the limited link addition. A survival fitness metric is defined to measure both the attack tolerance and the communication efficiency of the network. We show that network topology reconfiguration optimization with limited link addition (NTRLA) problem is NP-hard. Two approximate solution methods are developed. First, we present a degree-fitness parameter to guide degree-based link addition method. Second, a preferential configuration node-protecting cycle (PCNC) method is developed to do trade-off between network robustness and efficiency. The performance of PCNC method is demonstrated by numerical experiments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.171-192
• /
• 2017

The change of any element in the network is possible to cause performance degradation of the multicast network. So it is necessary to optimize the topology path through the multicast update strategy, which directly affects the performance and user experience of the overlay multicast. In view of the above, a new multicast tree update strategy based on perturbation theory Musp (Multicast Update Strategy based on Perturbation theory) is proposed, which reduces the data transmission interruption caused by the multicast tree update and improves user experiences. According to the multicast tree's elements performance and the topology structure, the Musp strategy defines the multicast metric matrix and based on the matrix perturbation theory it also defines the multicast fluctuation factor. Besides it also demonstrates the calculability of the multicast fluctuation factor presents the steps of the Musp algorithm and calculates the complexity. The experimental results show that compared with other update strategies, as for the sensitivity of the multicast fluctuation factor's energized multicast tree to the network disturbance, the maximum delay of the Musp update strategy is minimal in the case of the local degradation of network performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.8
• /
• pp.2875-2893
• /
• 2015

Existing coding aware routing algorithms focused on novel routing metric design that captures the characteristics of network coding. However, in packet coding algorithm, they use opportunistic coding scheme which didn't consider the queue state of the coding node and are equivalent to the conventional store-and-forward method in light traffic load condition because they never delay packets and there are no packets in the output queue of coding node, which results in no coding opportunity. In addition, most of the existing algorithms assume that all flows participating in the network have equal rate. This is unrealistic since multi-rate environments are often appeared. To overcome above problem and expand network coding to light traffic load scenarios, we present an enhanced coding-aware routing algorithm based on queue state and local topology (OQMCAR), which consider the queue state of coding node in packet coding algorithm where the control policy is of threshold-type. OQMCAR is a unified framework to merge single rate case and multiple rate case, including the light traffic load scenarios. Simulations results show that our scheme can achieve higher throughput and lower end-to-end delay than the current mechanisms using COPE-type opportunistic coding policy in different cases.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.4
• /
• pp.9-15
• /
• 2013

Most of recent studies on data center networks are based on the assumption of symmetrical multi-rooted tree topologies such as a Fat-Tree. While packet scatter schemes are very effective for such a network topology, it is known that various failures can result in an asymmetric topology which degrades TCP performance. In this paper, we reexamine the effects of link failures on packet scatter schemes in Fat-Trees. Our simulation results show that in case of a single link failure in a large-scale Fat-Tree, packet reordering does not occur enough to degrade TCP performance. This implies that we do not necessarily need a complex scheme to make packet schemes robust to link failures.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.4
• /
• pp.105-109
• /
• 2018

In this paper, the performance enhancement of a time-modulated array is described. The proposed time-modulated array is based on the topology of a conventional array but uses apodized discrete time switching, instead of phase shifters, to achieve beamforming functions with side-band suppression. Numerical simulations are carried out to examine the performance of this beamforming system based on apodized time sequence of 16 elements linear array. Numerical results reveal that the proposed method provides a more flexible and accurate way of producing desired beampatterns with low or ultralow side-lobe level (SLL) compared with the conventional methods.

• The Journal of Information Technology
• /
• v.5 no.4
• /
• pp.155-164
• /
• 2002

MPLS is a integrated technology by using routing function and label swapping in the network layer. Based on the previous forwarding equivalence classes, it adds the fixed length label in ingress of the MPLS domain. For the routing, without the packet header information, it uses label for the forwarding decisions. In this paper, traffic engineering requirements in the MPLS internet will be setup. The traffic engineering function have to be performed previously with the network topology. In addition to, we presents the IP network topology and main function with MPLS signaling protocol.