{"title":"A Proactive Fault Resilient Overlay Multicast for Media Streaming","authors":"B. B. Bista","doi":"10.1109/NBiS.2009.23","DOIUrl":"https://doi.org/10.1109/NBiS.2009.23","url":null,"abstract":"IP multicast has been suffering from a large scale deployment due to various issues such as upgrading of routers, policy making, negotiation and so on. To overcome problems of IP multicast, overlay multicast in which multicast functionalities are implemented at end hosts has been proposed. However, unlike IP multicast non-leaf nodes in the multicast delivery tree are normal end hosts which can join and leave the tree freely. This causes the multicast tree unstable and disrupted nodes to rejoin the tree. In this paper, we propose that each node when joining the multicast tree sets its leaving time, i.e. how long it will stay in the tree, and sends join request to a number of nodes which are already on the tree. Using the leaving time of nodes, new nodes are joined at the tree such that a child's leaving time is earlier than its parent, i.e. the child will leave the tree earlier than its parent. This makes the tree more stable than joining at random nodes in the tree. Furthermore, we propose a proactive recovery mechanism so that even if a parent leaves the tree and children do not, children can rejoin at predetermined nodes immediately, so that the recovery time of the disrupted nodes is minimum. We have shown by simulation that there is less overhead when joining the multicast tree and the recovery time of the disrupted nodes is much less than the previous works.","PeriodicalId":312802,"journal":{"name":"2009 International Conference on Network-Based Information Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123112924","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Self-stabilized Flocking of a Group of Mobile Robots under Memory Corruption","authors":"Yan Yang, X. Défago, M. Takizawa","doi":"10.1109/NBiS.2009.60","DOIUrl":"https://doi.org/10.1109/NBiS.2009.60","url":null,"abstract":"Robotics has been paid a lot attentions because of its wide applications, like explore unknown planet or rescue people after earthquake or fire. In a group of mobile robots, robots are usually weak and are easy to get crash, especially working in dangerous or harsh environment. Unfortunately, to the best of our knowledge, only a few studies address on robot failure, especially transient failure. Therefore, in this paper, based on a pair of fault tolerant flocking algorithms which we proposed, we discuss if it is possible to make robots work together once robots' memory experiences corruption. Otherwise, we further explore the reason and then try to revise the existing algorithm to make robots self-stabilized.","PeriodicalId":312802,"journal":{"name":"2009 International Conference on Network-Based Information Systems","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125585816","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Yan Yang, N. Xiong, A. Aikebaier, T. Enokido, M. Takizawa
{"title":"Minimizing Power Consumption with Performance Efficiency Constraint in Web Server Clusters","authors":"Yan Yang, N. Xiong, A. Aikebaier, T. Enokido, M. Takizawa","doi":"10.1109/NBiS.2009.101","DOIUrl":"https://doi.org/10.1109/NBiS.2009.101","url":null,"abstract":"Energy efficiency has become a very important issue to reduce the consumption of resources on the Earth. We have to consider how to save the energy consumption anywhere and anytime, including a large set of servers, for example, servers in the Google company. Hence, power and energy consumption has recently become key concerns, especially huge number of servers are deployed in large cluster configurations as in data centers and Web hosting facilities. Even though we emphasize power saving as much as possible, the performance of servers should be ensured. So far, there have been some discussions about enhancing power conservation. However, with the best of our knowledge, a mathematical model about consumed power and server’s performance has not been discussed. Therefore, in this paper, we attempted to minimize the energy consumption with performance constraint of web servers. We know, the response time is the focus of the performance in web servers. Therefore, we first find the trade off value of load for each server based on optimized methods. With the trade off load, the performance of users can be satisfied at the same time the power consumption is minimized. Then, using the trade off load value, we propose a novel load allocation method and then discuss the effectiveness of our load allocation method by comparing with other two methods: random load allocation method and average load allocation method.","PeriodicalId":312802,"journal":{"name":"2009 International Conference on Network-Based Information Systems","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122381998","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Evaluation of Stateful Reliability Counter in Small-World Cellular Neural Networks","authors":"Katsuyoshi Matsumoto, M. Uehara, H. Mori","doi":"10.1109/NBiS.2009.26","DOIUrl":"https://doi.org/10.1109/NBiS.2009.26","url":null,"abstract":"In this paper, fault tolerant techniques and the evaluation results for the small world cellular network are described. The small world network is characterized by smaller number of hops necessary for the communication between nodes in the network compared with usual regular networks. So that, high speed operations are expected in image processing and the kind of field. However, the fault tolerance of the permanent fault is a severe problem, because the error propagation tends to spread quickly compared with usual networks due to the network characteristics. Moreover, it is expected that the integration limitation in the circuit technology will come in the near future, so it is also important to cope with the temporary fault caused by humidity, heat, and the radiation, and so on. In this paper, effective techniques of the fault tolerance for the temporary fault are proposed as well as a permanent fault, and the evaluation results are provided.","PeriodicalId":312802,"journal":{"name":"2009 International Conference on Network-Based Information Systems","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122856647","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Semantic P2P Overlay Network for Web Service Discovery","authors":"Mario Bisignano, G. Modica, O. Tomarchio","doi":"10.1109/NBiS.2009.29","DOIUrl":"https://doi.org/10.1109/NBiS.2009.29","url":null,"abstract":"In service-oriented environments the service discovery mechanisms adopting a key-word based and centralised approach are not able to provide the users' requests with accurate results, nor are any longer able to scale against the increasing number of Web Services provided by service providers. Distributed, semantics-enabled infrastructures for service discovery promise to fulfill these requirements, even though the ambitious goal of a dynamic selection and automated integration of web services has not been accomplished yet. In this paper we present a P2P-based infrastructure supporting a scalable service discovery process. Overlay groups are formed by clustering together peers offering services which are semantically related: a search request for a service (query) will be handled by the group where it has the highest chance to be satisfied. The main focus of the paper is on the groups creation and maintenance strategy, and on the query routing mechanism. A system prototype has been implemented and validated through a case study.","PeriodicalId":312802,"journal":{"name":"2009 International Conference on Network-Based Information Systems","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124549669","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Kenichi Tanaka, M. Uehara, Makoto Murakami, M. Yamagiwa
{"title":"Web-Disk-Based Efficient Application Delivery Method for Grids","authors":"Kenichi Tanaka, M. Uehara, Makoto Murakami, M. Yamagiwa","doi":"10.1109/NBiS.2009.25","DOIUrl":"https://doi.org/10.1109/NBiS.2009.25","url":null,"abstract":"Recently, in line with increased hardware performance, resources for individual PCs have increased. These resources are however, seldom fully utilized, resulting in many free or idle resources. We are currently investigating implementing a full grid on Windows PCs using Virtual Machines. This study aims to utilize idle resources on Windows PCs within a Linux Grid using Virtual Machines (Virtual Grid). In addition, we have developed a Meta Grid that controls the Virtual Grid. We have also proposed a method to provide Web Storage for the Meta Grid. This method allows the Virtual Grid to use massive Web Storage through NBD and is also suitable for deploying applications. In addition, Grid applications are relieved of massive data transfer. In this paper, we describe the method for delivering applications to Virtual Grids through shared virtual disks.","PeriodicalId":312802,"journal":{"name":"2009 International Conference on Network-Based Information Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130546483","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Tetsuya Shigeyasu, Hiyuu Shimizu, H. Matsuno, N. Morinaga
{"title":"A Method for Syncronous Transmissions with Exposing Terminal on the Basis of Overheating RTS Header Information","authors":"Tetsuya Shigeyasu, Hiyuu Shimizu, H. Matsuno, N. Morinaga","doi":"10.1109/NBiS.2009.56","DOIUrl":"https://doi.org/10.1109/NBiS.2009.56","url":null,"abstract":"IEEE802.11DCF, which is a most widely used wireless LAN employs RTS/CTS handshake as an option for mitigating effects of hidden terminals. This handshake can prevent packet collisions by exchange RTS and CTS among transmitter and receiver in order to notify length of its transmission period to neighboring terminals. However, by the handshaking, terminals overhearing RTS and/or CTS prohibit its transmission needlessly even though the terminals can transmit packet without any damaging effect for on going transmission. This paper proposes a new method for synchronous parallel transmissions with exposing terminal on the basis of overhearing RTS header information.","PeriodicalId":312802,"journal":{"name":"2009 International Conference on Network-Based Information Systems","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126312067","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
E. Shakshuki, T. Sheltami, H. Malik, Chuoxian Yang
{"title":"Investigation and Implementation of Border Nodes in S-MAC","authors":"E. Shakshuki, T. Sheltami, H. Malik, Chuoxian Yang","doi":"10.1109/NBiS.2009.103","DOIUrl":"https://doi.org/10.1109/NBiS.2009.103","url":null,"abstract":"Wireless sensor networks are destined to see widespread adoption in such diverse sectors as industrial process control, health care, and home automation. A WSN is normally constructed from large numbers of low-power, inexpensive sensor devices that are densely embedded in the physical environment, operating together in a wireless network. Being energy constrained, the network environment requires a communication protocol to maximize the lifetime of each node in WSN. Sensor-Medium Access Control (S-MAC) is a contention-based protocol designed specifically for WSN. It’s operational principle is based on a periodic cycle, in which nodes take turns to sleep and wake-up to listen for awhile. The focus of this paper is to investigate and implement border nodes, or gateways in S MAC, using network simulator-2 (ns-2). Border nodes have been previously defined, however, the life cycle of border nodes has not, nor have they been implemented and tested under a simulation package such as ns-2. We introduce the birth and death of border nodes in the implementation of S-MAC. Our simulation results demonstrate that, with border nodes implementation, the network latency is increased at the cost of prolonged network life.","PeriodicalId":312802,"journal":{"name":"2009 International Conference on Network-Based Information Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126376925","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Reducing Total Energy Consumption with Collaboration between Network and End Systems","authors":"K. Hatakeyama, Yasunori Osana, S. Kuribayashi","doi":"10.1109/NBiS.2009.15","DOIUrl":"https://doi.org/10.1109/NBiS.2009.15","url":null,"abstract":"Full-scale IT introduction in the near future is expected to increase information flows vastly and this information explosion will also increase the number of IT devices in use, positioning the energy consumption of IT devices themselves as a key issue. Most of conventional measures to treat energy consumption handle servers and network devices separately. This paper first identifies that the network should cooperate with end systems to reduce the total energy consumption, and proposes an integrated method to reduce the total energy consumption by both network and end systems. Then, this paper proposes a simple method of estimating the volume of energy consumption by all network devices and assigning it to an individual user, based on the volume of traffic measured and the information about packet routing paths in the network.","PeriodicalId":312802,"journal":{"name":"2009 International Conference on Network-Based Information Systems","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125641942","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"SSL Connection Failover in Web Clusters and its Evaluation","authors":"Satoshi Shimazaki, Takamichi Saito","doi":"10.1109/NBiS.2009.63","DOIUrl":"https://doi.org/10.1109/NBiS.2009.63","url":null,"abstract":"It is important for enterprises to continuously provide web service. Failover cluster is a popular technology to provide web service without interruption. Although we have many well-established methodologies of failover for Hyper Text Transfer Protocol (HTTP), they can’t be applied in case of cryptographic channel. Then, keeping an encryption session between clusters, we design to migrate the session from one to others. Moreover, we evaluate it from the viewpoint of performance.","PeriodicalId":312802,"journal":{"name":"2009 International Conference on Network-Based Information Systems","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127419319","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}