International Journal of Internet Protocol Technology http://www.inderscience.com/browse/index.php?journalID=144&year=2011&vol=6&issue=3 Inderscience Publishers Ltd en-uk International Journal of Internet Protocol Technology 1743-8209 1743-8217 © 2011 Inderscience Publishers Ltd editor@inderscience.com https://www.inderscience.com/images/files/coverImgs/ijipt_scoverijipt.jpg http://www.inderscience.com/browse/index.php?journalID=144&year=2011&vol=6&issue=3 http://www.inderscience.com/link.php?id=43651 This paper addresses a novel mechanism to solve the scalable problem in JRRM. Due to the flexibility and simplification, the fuzzy logic control (FLC) is chosen to make effective utilisation of resources. The combined fuzzy logic and multi-attribute decision making (MADM)-based algorithm can make proper initial RAT selection, horizontal handoff, vertical handoff, admission control and load balancing. The MADM-based RAT selection also has better efficiency than the traditional RRM mechanisms. By considering three kinds of traffic, voice, video and data respectively, the proposed scheme provides lower new call blocking probability and handoff call dropping probability in the heterogeneous wireless network that includes GSM/EDGE radio access network (GERAN), high-speed packet access (HSPA) and mobile worldwide interoperability for microwave access (WiMAX) RATs. Joint radio resource management in heterogeneous wireless networks by using combined fuzzy logic and MADM
Jung-Shyr Wu; Shun-Fang Yang; Ai-Chieh Lin
International Journal of Internet Protocol Technology, Vol. 6, No. 3 (2011) pp. 135 - 145
This paper addresses a novel mechanism to solve the scalable problem in JRRM. Due to the flexibility and simplification, the fuzzy logic control (FLC) is chosen to make effective utilisation of resources. The combined fuzzy logic and multi-attribute decision making (MADM)-based algorithm can make proper initial RAT selection, horizontal handoff, vertical handoff, admission control and load balancing. The MADM-based RAT selection also has better efficiency than the traditional RRM mechanisms. By considering three kinds of traffic, voice, video and data respectively, the proposed scheme provides lower new call blocking probability and handoff call dropping probability in the heterogeneous wireless network that includes GSM/EDGE radio access network (GERAN), high-speed packet access (HSPA) and mobile worldwide interoperability for microwave access (WiMAX) RATs.

]]> 10.1504/IJIPT.2011.043651 International Journal of Internet Protocol Technology, Vol. 6, No. 3 (2011) pp. 135 - 145 Jung-Shyr Wu; Shun-Fang Yang; Ai-Chieh Lin Department of Communication Engineering, National Central University, No. 300, Jung-da Rd., Jung-li City, Taoyuan, 320, Taiwan. ' Department of Communication Engineering, National Central University, No. 300, Jung-da Rd., Jung-li City, Taoyuan, 320, Taiwan; Telecommunication Laboratories, ChungHwa Telecom Co., Ltd., 12, Lane 551, Min-Tsu Road, Sec. 5, Yang-Mei, Taoyuan, 326, Taiwan. ' Department of Communication Engineering, National Central University, No. 300, Jung-da Rd., Jung-li City, Taoyuan, 320, Taiwan joint radio resource management JRRM fuzzy logic fuzzy control FLC multi-attribute decision making MADM admission control vertical handover heterogeneous wireless networks call blocking handoff call dropping radio access networks high-speed packet access WiMAX. 2011-11-15T23:20:50-05:00 6 3 135 145 2011-11-15T23:20:50-05:00 http://www.inderscience.com/link.php?id=43675 Multipath TCP (MPTCP) is a new protocol being developed in the IETF's MPTCP working group in order to provide higher communication availability and to improve the throughput between two multi-addressed endpoints by using multiple paths. Due to the multipath nature and specifically its path management, some new security threats arise apart from those that are already present in standard single-path TCP. These new attacks include flooding and hijacking attacks performed by an off-path attacker. In this paper, we explore different solutions in order to cover the identified security flaws. The main proposal is based on hash chains, which significantly reduces the initial set of threats resulting in a residual group of vulnerabilities, which are also identified. Security for multipath TCP: a constructive approach
Javier Díez; Marcelo Bagnulo; Francisco Valera; Iván Vidal
International Journal of Internet Protocol Technology, Vol. 6, No. 3 (2011) pp. 146 - 155
Multipath TCP (MPTCP) is a new protocol being developed in the IETF's MPTCP working group in order to provide higher communication availability and to improve the throughput between two multi-addressed endpoints by using multiple paths. Due to the multipath nature and specifically its path management, some new security threats arise apart from those that are already present in standard single-path TCP. These new attacks include flooding and hijacking attacks performed by an off-path attacker. In this paper, we explore different solutions in order to cover the identified security flaws. The main proposal is based on hash chains, which significantly reduces the initial set of threats resulting in a residual group of vulnerabilities, which are also identified.

]]> 10.1504/IJIPT.2011.043675 International Journal of Internet Protocol Technology, Vol. 6, No. 3 (2011) pp. 146 - 155 Javier Díez; Marcelo Bagnulo; Francisco Valera; Iván Vidal Telematics Engineering Department, University Carlos III of Madrid Avda. Universidad, 30, 28911 Leganés, Madrid, Spain. ' Telematics Engineering Department, University Carlos III of Madrid Avda. Universidad, 30, 28911 Leganés, Madrid, Spain. ' Telematics Engineering Department, University Carlos III of Madrid Avda. Universidad, 30, 28911 Leganés, Madrid, Spain. ' Telematics Engineering Department, University Carlos III of Madrid Avda. Universidad, 30, 28911 Leganés, Madrid, Spain multipath TCP MPTCP security threats flooding attacks hijacking attacks hash chains transmission control protocol vulnerabilities. 2011-11-15T23:20:50-05:00 6 3 146 155 2011-11-15T23:20:50-05:00 http://www.inderscience.com/link.php?id=43676 This paper proposes a novel semi-fragile watermarking technique for sensor data. The proposed watermarking technique embeds the secret watermark in the order of the data readings rather than the data values themselves, thus, does not cause distortion to the transmitted data values. Transmitted data readings are organised in groups of fixed length. The watermarking algorithm then reorders data readings relative to each other according to the value of the secret watermark. The proposed scheme tolerates minor changes that might be caused by channel error. In case of a single attack, the proposed technique can identify the victim element with high probability. The paper provides detailed security analysis to show the robustness of the proposed techniques against various types of attacks. Extensive experiments are performed to measure the attack detection and victim identification rate. The execution time of the watermark embedding and integrity check is also shown. Semi-fragile watermark for sensor data
Ibrahim Kamel; Osama AlKoky
International Journal of Internet Protocol Technology, Vol. 6, No. 3 (2011) pp. 156 - 171
This paper proposes a novel semi-fragile watermarking technique for sensor data. The proposed watermarking technique embeds the secret watermark in the order of the data readings rather than the data values themselves, thus, does not cause distortion to the transmitted data values. Transmitted data readings are organised in groups of fixed length. The watermarking algorithm then reorders data readings relative to each other according to the value of the secret watermark. The proposed scheme tolerates minor changes that might be caused by channel error. In case of a single attack, the proposed technique can identify the victim element with high probability. The paper provides detailed security analysis to show the robustness of the proposed techniques against various types of attacks. Extensive experiments are performed to measure the attack detection and victim identification rate. The execution time of the watermark embedding and integrity check is also shown.

]]> 10.1504/IJIPT.2011.043676 International Journal of Internet Protocol Technology, Vol. 6, No. 3 (2011) pp. 156 - 171 Ibrahim Kamel; Osama AlKoky Department of Computer Engineering, University of Sharjah, P.O. Box 27272, Sharjah, UAE. ' Department of Computer Science, University of Sharjah, P.O. Box 27272, Sharjah, UAE information security digital watermarking data integrity sensor networks secured hashing data streams attacks attack detection victim identification. 2011-11-15T23:20:50-05:00 6 3 156 171 2011-11-15T23:20:50-05:00 http://www.inderscience.com/link.php?id=43652 The performance of thin-client systems based on TCP depends on network quality, so it becomes worse in a WAN environment; however, the effects of TCP mechanisms have not been clarified. In this paper, we first describe the download traffic of thin-client systems as a two-state model with interactive data flows in response to keystrokes and bulk data flows related to screen updates. Since users are more sensitive to the keystroke response time, our next objective is to minimise the latency of interactive data flows, especially when the network is congested. Through detailed simulation experiments, we reveal that the main delays are queuing delay in the bottleneck router and buffering delay in the server. We then enhance two TCP mechanisms: retransmission timeout calculation and SACK control, which negate the negative impacts of existing options and increase the interval between occurrences of large delays by about four times. A transport-layer approach for improving thin-client performance in a WAN environment
Yukio Ogawa; Go Hasegawa; Masayuki Murata
International Journal of Internet Protocol Technology, Vol. 6, No. 3 (2011) pp. 172 - 183
The performance of thin-client systems based on TCP depends on network quality, so it becomes worse in a WAN environment; however, the effects of TCP mechanisms have not been clarified. In this paper, we first describe the download traffic of thin-client systems as a two-state model with interactive data flows in response to keystrokes and bulk data flows related to screen updates. Since users are more sensitive to the keystroke response time, our next objective is to minimise the latency of interactive data flows, especially when the network is congested. Through detailed simulation experiments, we reveal that the main delays are queuing delay in the bottleneck router and buffering delay in the server. We then enhance two TCP mechanisms: retransmission timeout calculation and SACK control, which negate the negative impacts of existing options and increase the interval between occurrences of large delays by about four times.

]]> 10.1504/IJIPT.2011.043652 International Journal of Internet Protocol Technology, Vol. 6, No. 3 (2011) pp. 172 - 183 Yukio Ogawa; Go Hasegawa; Masayuki Murata Yokohama Research Laboratory, Hitachi, Ltd., 292 Yoshida-cho, Totsuka-ku, Yokohama-shi, Kanagawa-ken, 244-0817, Japan. ' Graduate School of Information Science and Technology, Osaka University, 1-5, Yamadaoka, Suita-shi, Osaka-fu, 565-0871, Japan. ' Graduate School of Information Science and Technology, Osaka University, 1-5, Yamadaoka, Suita-shi, Osaka-fu, 565-0871, Japan thin-client systems performance wide area networks WANs transport layer interactive data flows bulk data flows retransmission timeout TCP SACK simulation queuing delay buffering delay transmission control protocol. 2011-11-15T23:20:50-05:00 6 3 172 183 2011-11-15T23:20:50-05:00 http://www.inderscience.com/link.php?id=43677 A grid consists of high-end computational, storage, and network resources that, while known a priori, are dynamic with respect to activity and availability. Efficient scheduling of requests to use grid resources must adapt to this dynamic environment while meeting administrative policies. This paper discusses the necessary requirements of such a scheduler and proposes a framework called SPHINX that can administrate grid policies and schedule complex and data intensive scientific applications. The SPHINX design allows for a number of functional modules to flexibly plan and schedule workflows representing multiple applications on the grids. It also allows for performance evaluation of multiple algorithms for each functional module. We present early experimental results for SPHINX that effectively utilises other grid infrastructures such as workflow management systems and execution systems. These results demonstrate that SPHINX can effectively schedule work across a large number of distributed clusters that are owned by multiple units in a virtual organisation. SPHINX: a scheduling middleware for data intensive applications on a grid
Jang-uk In; Jong Hyuk Park
International Journal of Internet Protocol Technology, Vol. 6, No. 3 (2011) pp. 184 - 194
A grid consists of high-end computational, storage, and network resources that, while known a priori, are dynamic with respect to activity and availability. Efficient scheduling of requests to use grid resources must adapt to this dynamic environment while meeting administrative policies. This paper discusses the necessary requirements of such a scheduler and proposes a framework called SPHINX that can administrate grid policies and schedule complex and data intensive scientific applications. The SPHINX design allows for a number of functional modules to flexibly plan and schedule workflows representing multiple applications on the grids. It also allows for performance evaluation of multiple algorithms for each functional module. We present early experimental results for SPHINX that effectively utilises other grid infrastructures such as workflow management systems and execution systems. These results demonstrate that SPHINX can effectively schedule work across a large number of distributed clusters that are owned by multiple units in a virtual organisation.

]]> 10.1504/IJIPT.2011.043677 International Journal of Internet Protocol Technology, Vol. 6, No. 3 (2011) pp. 184 - 194 Jang-uk In; Jong Hyuk Park SQL Engine Platform, Microsoft Corporation, One Microsoft Way, Redmond, WA 98052-7329, USA. ' Department of Computer Science and Engineering, Seoul National University of Science and Technology (SeoulTech), 172 Gongreung 2-dong, Nowon-gu, Seoul, 139-743, Korea grid computing middleware quality of service QoS scheduling data intensive applications performance evaluation. 2011-11-15T23:20:50-05:00 6 3 184 194 2011-11-15T23:20:50-05:00