Youngjoo HAN Hyewon SONG Byungsang KIM Chan-Hyun YOUN
Due to the dynamic nature and uncertainty of grid computing, system reliability can become very unpredictable. Thus, a well-defined scheduling mechanism that provides high system availability for grid applications is required. In this letter, we propose a SLA-constrained policy-based scheduling mechanism to enhance system performance in grid. Also, we implement the proposed model and show that our policy-based scheduling mechanism can guarantee high system availability as well as support load balancing on an experimental basis.
Moonseong KIM Euihoon JEONG Young-Cheol BANG Soyoung HWANG Changsub SHIN Gwang-Ja JIN Bongsoo KIM
One of the major challenges facing the design of a routing protocol for Wireless Sensor Networks (WSNs) is to find the most reliable path between the source and sink node. Furthermore, a routing protocol for WSN should be well aware of sensor limitations. In this paper, we present an energy efficient, scalable, and distributed node disjoint multipath routing algorithm. The proposed algorithm, the Energy-aware Multipath Routing Algorithm (EMRA), adjusts traffic flows via a novel load balancing scheme. EMRA has a higher average node energy efficiency, lower control overhead, and a shorter average delay than those of well-known previous works. Moreover, since EMRA takes into consideration network reliability, it is useful for delivering data in unreliable environments.
Yasufumi MORIOKA Takeshi HIGASHINO Katsutoshi TSUKAMOTO Shozo KOMAKI
Recent rapid development of high-speed wireless access technologies has created mixed WLAN (Wireless LAN) environments where QoS capable APs coexist with legacy APs. To provide QoS guarantee in this mixed WLAN environment, this paper proposes a new AP selection algorithm. The proposed algorithm assigns an STA (Station) to an AP in the overall WLAN service area. Simulation results show improvement in the VoIP performance in terms of an eMOS (estimated Mean Opinion Score) value and the FTP throughput compared to conventional algorithms.
Seungwu HAN Masaaki FUJIYOSHI Hitoshi KIYA
This paper proposes an image authentication method that detects tamper and localizes tampered areas efficiently. The efficiency of the proposed method is summarized as the following three points. 1) This method offers coarse-to-fine tamper localization by hierarchical data hiding so that further tamper detection is suppressed for blocks labeled as genuine in the uppper layer. 2) Since the image feature description in the top layer is hidden over an image, the proposed method enciphers the data in the top layer rather than enciphers all data in all layers. 3) The proposed method is based on the reversible data hiding scheme that does not use highly-costed compression technique. These three points makes the proposed method superior to the conventional methods using compression techniques and methods using multi-tiered data hiding that requires integrity verification in many blocks even the image is genuine. Simulation results show the effectiveness of the proposed method.
Abhay GHATPANDE Hidenori NAKAZATO Olivier BEAUMONT Hiroshi WATANABE
Divisible Load Theory (DLT) is an established mathematical framework to study Divisible Load Scheduling (DLS). However, traditional DLT does not address the scheduling of results back to source (i.e., result collection), nor does it comprehensively deal with system heterogeneity. In this paper, the DLSRCHETS (DLS with Result Collection on HETerogemeous Systems) problem is addressed. The few papers to date that have dealt with DLSRCHETS, proposed simplistic LIFO (Last In, First Out) and FIFO (First In, First Out) type of schedules as solutions to DLSRCHETS. In this paper, a new polynomial time heuristic algorithm, SPORT (System Parameters based Optimized Result Transfer), is proposed as a solution to the DLSRCHETS problem. With the help of simulations, it is proved that the performance of SPORT is significantly better than existing algorithms. The other major contributions of this paper include, for the first time ever, (a) the derivation of the condition to identify the presence of idle time in a FIFO schedule for two processors, (b) the identification of the limiting condition for the optimality of FIFO and LIFO schedules for two processors, and (c) the introduction of the concept of equivalent processor in DLS for heterogeneous systems with result collection.
Seishi HANAOKA Junji YAMAMOTO Masashi YANO
The cognitive radio system consists of multiple wireless access systems that cover overlapping areas and cognitive terminals that use one or more of the wireless access systems simultaneously. In this paper, we describe the system architecture of a platform for load balancing and throughput enhancement with cognitive radio system. In our platform, each terminal, which can access multiple radio systems, operates with a single local IP address. Based on our platform, we have developed both simulator and testbed system. Through the simulation of and the testing of a testbed system, we prove that systems load balance was achieved between WiMAX and wireless LAN, and total user throughput was increased with the proposed platform. Moreover, load balance to satisfy both real time service and best effort service. These results demonstrate the platform described in the paper can achieve a convergence with plural wireless systems.
Abhay GHATPANDE Hidenori NAKAZATO Olivier BEAUMONT Hiroshi WATANABE
Divisible Load Theory (DLT) is an established framework to study Divisible Load Scheduling (DLS). Traditional DLT ignores the result collection phase, and specifies no solution to the general case where both the network speed and computing capacity of the nodes are heterogeneous. In this paper, the DLS with Rosult Collection on HETerogemeous Systems (DLSRCHETS) problem is formulated as a linear program and analyzed. The papers to date that have dealt with result collection, proposed simplistic LIFO (Last In, First Out) and FIFO (First In, First Out) type of schedules as solutions. The main contributions of this paper are: (a) A proof of the Allocation Precedence Condition, which is inconsequential in LIFO or FIFO, but is important in a general schedule. (b) A proof of the Idle Time Theorem, which states that irrespective of whether load is allocated to all available processors, in the optimal solution to the DLSRCHETS problem, at the most one processor that is allocated load has idle time, and that the idle time exists only when the result collection begins immediately after the completion of load distribution.
Thavisak MANODHAM Luis LOYOLA Tetsuya MIKI
IEEE 802.11 wirelesses LANs (WLANs) have been rapidly deployed in enterprises, public areas, and households. Voice-over-IP (VoIP) and similar applications are now commonly used in mobile devices over wireless networks. Recent works have improved the quality of service (QoS) offering higher data rates to support various kinds of real-time applications. However, besides the need for higher data rates, seamless handoff and load balancing among APs are key issues that must be addressed in order to continue supporting real-time services across wireless LANs and providing fair services to all users. In this paper, we introduce a novel access point (AP) with two transceivers that improves network efficiency by supporting seamless handoff and traffic load balancing in a wireless network. In our proposed scheme, the novel AP uses the second transceiver to scan and find neighboring STAs in the transmission range and then sends the results to neighboring APs, which compare and analyze whether or not the STA should perform a handoff. The initial results from our simulations show that the novel AP module is more effective than the conventional scheme and a related work in terms of providing a handoff process with low latency and sharing traffic load with neighbor APs.
Takao FUJII Isao OHTA Tadashi KAWAI Yoshihiro KOKUBO
This paper presents a new quarter-wavelength microstrip coupler compensated with a periodic sequence of floating metallic strips in the slots on the inner edges. After describing the characteristics of the coupled-line, as an example, a 15-dB coupler is designed and a high directivity of 30 dB or more in theory is obtained over a full band of a single-section coupler. Next, couplers with various coupling factors are designed, and the usefulness for very loose coupling is demonstrated. Furthermore, a three-section coupler is designed to show the effectiveness in a wide frequency range. The validity of the design concept and procedure is confirmed by electromagnetic simulations and experiments.
Takefumi HIRAGURI Takeo ICHIKAWA Masataka IIZUKA Shuji KUBOTA
This paper proposes two traffic control schemes to support the communication quality of multimedia streaming services such as VoIP and audio/video over IEEE 802.11 wireless LAN systems. The main features of the proposed scheme are bandwidth control for each flow of the multimedia streaming service and load balancing between access points (APs) of the wireless LAN by using information of data link, network and transport layers. The proposed schemes are implemented on a Linux machine which is called the wireless traffic controller (WTC). The WTC connects a high capacity backbone network and an access network to which the APs are attached. We evaluated the performance of the proposed WTC and confirmed that the communication quality of the multimedia streaming would be greatly improved by using this technique.
The management of subscriptions and events is an important task in the content-based publish/subscribe system. A good management mechanism can not only produce lower matching costs to speed up the delivery of matched events to the interested subscribers but can also induce good load balancing for subscription storage. In this paper, we consider the construction of this kind of system over a peer-to-peer overlay network and propose two message-to-node mapping schemes for system management. We both analyze and simulate the performance of the proposed schemes. The simulation results show the superiority of our schemes over existing ones.
Sungwook KIM Myungwhan CHOI Sungchun KIM
New multimedia services over cellular/WLAN overlay networks require different Quality of Service (QoS) levels. Therefore, an efficient network management system is necessary in order to realize QoS sensitive multimedia services while enhancing network performance. In this paper, we propose a new online network management framework for overlay networks. Our online approach to network management exhibits dynamic adaptability, flexibility, and responsiveness to the traffic conditions in multimedia networks. Simulation results indicate that our proposed framework can strike the appropriate balance between performance criteria under widely varying diverse traffic loads.
Won-Jong LEE Vason P. SRINI Woo-Chan PARK Shigeru MURAKI Tack-Don HAN
We present an adaptive dynamic load balancing scheme for 3D texture based sort-last parallel volume rendering on a PC cluster equipped with GPUs. Our scheme exploits not only task parallelism but also data parallelism during rendering by combining the hierarchical data structures (octree and parallel BSP tree) in order to skip empty regions and distribute proper workloads to rendering nodes. Our scheme can also conduct a valid parallel rendering and image compositing in visibility order by employing a 3D clustering algorithm. To alleviate the imbalance when the transfer function is changed, a load rebalancing is inexpensively supported by exchanging only needed data. A detailed performance analysis is provided and scaling characteristics of our scheme are discussed. These show that our scheme can achieve significant performance gains by increasing parallelism and decreasing synchronizing costs compared to the traditional static distribution schemes.
A new load balanced channel sharing method (CSM), namely Heuristic Traffic Load Balanced (HTLB) CSM, is proposed for metro-wavelength division multiple access (WDMA) networks. In particular, HTLB CSM is designed to be effective for pre-allocation based medium access control (MAC) protocols by balancing traffic loads corresponding to pre-assigned destinations per time slot. As a result, HTLB CSM is shown to provide lower time complexity than the well-known sub-optimal load balanced CSM, MULTIFIT CSM. Furthermore, the Jain Index of the HTLB CSM is shown to be higher and more consistent than the MULTIFIT CSM and other pre-fixed CSMs under diverse traffic conditions.
This study presents a class of miniature parallel-coupled bandpass filters with good selectivity and stopband rejection. Capacitive terminations are introduced to the conventional anti-parallel coupled-lines, and lumped-element K-inverters are employed, to achieve both size reduction and spurious suppression. Additionally, the capacitive cross-coupling effect can be introduced to obtain three transmission zeros to enhance the selectivity. Suitable equivalent-circuit models, along with design formulae, are also established. Specifically, via design examples, this work demonstrates the feasibility of proposed filter structures in microstrip configuration. Compared to the conventional parallel-coupled filters, the proposed filters exhibit over 60% size reduction, improved selectivity, and wider stopbands up to four times the center frequency.
Ikuo AWAI Yangjun ZHANG Tetsuya ISHIDA Tsuyoshi SUZUKI
A new unified method is proposed to calculate the basic resonator parameters, i.e., the resonant frequency, external Q, unloaded Q and coupling coefficient in the time domain. By exciting the resonator from a weakly coupled external circuit, one can inject only a narrow resonant spectrum from the broad spectrum of the excitation pulse. The resonant frequency is easily counted by the number of zero crossings of the internal field intensity, whereas the Q's are calculated by the decay rate of the field amplitude. The coupling coefficient computed by the energy exchange rate between two resonators completes the new time domain algorithm.
Masoomeh TORABZADEH Yusheng JI
Multiple-antenna wireless systems, also known as multiple-input multiple-output (MIMO) cellular networks, can improve the capacity and reliability of communications. To realize these advantages, a packet scheduler should effectively allocate radio resources to users in a fair way. The previously proposed MIMO schedulers have problems such as ignoring traffic arrival process or complexity. We propose a load adaptive multi-output fair queueing (LA-MO-FQ) scheduler, which is based on a fair queueing algorithm with mechanisms for rate selection, compensation of lagging users, and virtual time system. Since some of the scheduler's system parameters are sensitive to the traffic load, it dynamically adjusts them in a way with low complexity so the system performs better. Intensive simulation studies considering the mobility of users and the traffic arrival demonstrate the good performance of LA-MO-FQ. Furthermore, we also propose in this paper some formulae for the time and service fairness comparisons of MIMO schedulers and we use them for comparison with some famous existing schedulers.
Soon LEE Seung-Mook BAEK Jung-Wook PARK Young-Hyun MOON
This paper presents a study to estimate the composition of an electric load, i.e. to determine the amount of each load class by the direct measurements of the total electric current waveform from instrument reading. Kalman filter algorithm is applied to estimate the electric load composition on a consumer side of a distributed power system. The electric load supplied from the different voltage level by using a non-ideal delta-wye transformer is also studied with consideration of the practical environment for a distributed power system.
Min CHOI Namgi KIM Seungryoul MAENG
In this paper, we describe a single system image (SSI) architecture for distributed systems. The SSI architecture is constructed through three components: single process space (SPS), process migration, and dynamic load balancing. These components attempt to share all available resources in the cluster among all executing processes, so that the distributed system operates like a single node with much more computing power. To this end, we first resolve broken pipe problems and bind errors on server socket in process migration. Second, we realize SPS based on block process identifier (PID) allocation. Finally, we design and implement a dynamic load balancing scheme. The dynamic load balancing scheme exploits our novel metric, effective tasks, to effectively distribute jobs to a large distributed system. The experimental results show that these three components present scalability, new functionality, and performance improvement in distributed systems.
Myeongcheol SHIN Sangheon KIM Jiwon KANG Chungyong LEE
For the closed loop multiple-input-multiple-output (MIMO) systems, Fisher's adaptive bit loading algorithm gives the best error performance by jointly optimizing the transmit powers, rates, and number of streams. However, its good performance comes at the cost of high and variable computational complexity for the joint optimization. In this letter, we propose an efficient multi-mode precoding algorithm using a simplified mode table. Numerical results show that the proposed algorithm provides almost the same performance as Fischer's with much less computational complexity.