{"title":"A Class-Based Search System in Unstructured P2P Networks","authors":"Juncheng Huang, Xiuqi Li, Jie Wu","doi":"10.1109/AINA.2007.8","DOIUrl":"https://doi.org/10.1109/AINA.2007.8","url":null,"abstract":"Efficient searching is one of the important design issues in peer-to-peer (P2P) networks. Among various searching techniques, semantic-based searching has drawn significant attention recently. Gnutella-like efficient searching system (GES) in the work of Zhu et al. (2005) is such a system. GES derives a node vector, a semantic summary of all of the documents on a node, based on vector space model (VSM). The topology adaptation algorithm and search protocol are then designed according to the similarity between node vectors of different nodes. However, although GES is suitable when the distribution of documents in each node is uniform, it may not be efficient when the distribution is diverse. When there are many categories of documents at each node, the node vector representation may be inaccurate. We extend the idea of GES and present a class-based semantic searching system (CSS). It makes use of a data clustering algorithm, online spherical k-means clustering (OSKM) in the work of Zhang (2005), to cluster all documents on a node into several classes. Each class can be viewed as a virtual node. Virtual nodes are connected through virtual links. As a result, class vector replaces node vector and plays an important role in the class-based topology adaptation and search process, which makes CSS very efficient. Our simulation using the IR benchmark TREC collection demonstrates that CSS outperforms GES in terms of higher recall, higher precision and lower search cost.","PeriodicalId":361109,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","volume":"158 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122853850","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":"Performance Evaluation of Multicast Cost Sharing Mechanisms","authors":"N. Garg, Daniel Grosu","doi":"10.1109/AINA.2007.111","DOIUrl":"https://doi.org/10.1109/AINA.2007.111","url":null,"abstract":"In this paper we investigate experimentally the performance of marginal cost (MC) and Shapley value (SH) mechanisms for sharing the cost of multicast transmissions. We implement and deploy the MC and SH mechanisms on PlanetLab and study their properties. We compare the execution time of MC and SH mechanisms for the tamper-proof and autonomous node models. We also study the convergence and scalability of the mechanisms by varying the number of nodes and the number of users per node. We show that the MC mechanisms generate a smaller revenue compared to the SH mechanisms and thus they are not favorable for the content provider. From the computational point of view as well as economic considerations, increasing the number of users per node is beneficial for the system implementing these mechanisms.","PeriodicalId":361109,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134282675","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":"Efficient Analysis of Systems with Multiple States","authors":"L. Xing","doi":"10.1109/AINA.2007.62","DOIUrl":"https://doi.org/10.1109/AINA.2007.62","url":null,"abstract":"A multistate system is a system in which both the system and its components may exhibit multiple performance levels (or states) varying from perfect operation to complete failure. Examples abound in real applications such as communication networks and computer systems. Analyzing the probability of the system being in each state is essential to the design and tuning of dependable multistate systems. The difficulty in analysis arises from the non-binary state property of the system and its components as well as dependence among those multiple states. This paper proposes a new model called multistate multivalued decision diagrams (MMDD) for the analysis of multistate systems with multistate components. The computational complexity of the MMDD-based approach is low due to the nature of the decision diagrams. An example is analyzed to illustrate the application and advantages of the approach.","PeriodicalId":361109,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133808636","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 Distributed and Dynamic Data Gathering Protocol for Sensor Networks","authors":"H. Tan, I. Korpeoglu, I. Stojmenovic","doi":"10.1109/AINA.2007.11","DOIUrl":"https://doi.org/10.1109/AINA.2007.11","url":null,"abstract":"In this paper we propose a distributed, self organizing, robust and energy efficient data gathering algorithm for sensor networks operating in environments where all the sensor nodes are not in direct communication range of each other and data aggregation is used while routing. Proposed algorithm is based on local minimum spanning tree (LMST) structure, which nodes can construct from the position of their 1-hop neighbors. Reporting tree is constructed from the sink by allowing only edges of LMST to join the tree, plus possibly some direct links to the sink. Each node selects as parent the LMST neighbor so that the total energy cost of route to the sink is minimal. We also describe route maintenance protocols to respond to predicted sensor failures and addition of new sensors. Our simulation results show that our algorithm prolongs the network lifetime significantly compared to some alternative schemes.","PeriodicalId":361109,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","volume":"189 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115602885","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}
Hiroyuki Echigo, Hiroaki Yuze, Tsuyoshi Hoshikawa, Kazuo Takahata, N. Sawano, Y. Shibata
{"title":"Robust and Large Scale Distributed Disaster Information System over Internet and Japan Gigabit Network","authors":"Hiroyuki Echigo, Hiroaki Yuze, Tsuyoshi Hoshikawa, Kazuo Takahata, N. Sawano, Y. Shibata","doi":"10.1109/AINA.2007.123","DOIUrl":"https://doi.org/10.1109/AINA.2007.123","url":null,"abstract":"In this paper, a robust and large scale resident-oriented safety information system on the occurrence of the various disasters constructed over a nationwide high-speed network is introduced. The evacuated residents can register their safety information to the local safety information servers in the evacuation area whether they can safely evaluated or not using mobile PCs or terminals at the evacuation place or mobile terminals on the way of evacuation. All of the local information servers are connected each other by wireless network and the safety information can be sent an upper-layer database in the district area and finally integrated into a district safety information in that region. In our system some of the damaged local servers due to the disaster can be detected and recovered by the upper- layer database server. On the other hand, the upper-layer database servers are backed up by mirror servers located at mutually different locations with long distance to isolate the influence of the same disaster when the some of them were destroyed or disordered. Thus, by introducing two levels of redundancy and backup functions, more large scale and robust safety information database system can be realized.","PeriodicalId":361109,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115810441","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}
R. Beuran, L. Nguyen, K. Latt, J. Nakata, Y. Shinoda
{"title":"QOMET: A Versatile WLAN Emulator","authors":"R. Beuran, L. Nguyen, K. Latt, J. Nakata, Y. Shinoda","doi":"10.1109/AINA.2007.116","DOIUrl":"https://doi.org/10.1109/AINA.2007.116","url":null,"abstract":"In this paper we present the design of QOMET, the wireless LAN (WLAN) emulator that we develop. Our approach to WLAN emulation is a versatile two-stage scenario-driven design. In the first stage a real-world scenario representation provided by the user is converted successively into physical, data link and network layer effects that correspond to the emulated WLAN scenario. The output of the first stage is a description of the network states at successive moments of time, which is used in the second stage to accurately reproduce the wireless environment conditions by means of a wired-network emulator. We give here the details of the overall model that makes it possible to accomplish this conversion in QOMET. We then present our test methodology and illustrate our approach by several experimental results.","PeriodicalId":361109,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","volume":"777 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122628641","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":"An Application-Driven MAC-layer Buffer Management with Active Dropping for Real-time Video Streaming in 802.16 Networks","authors":"James She, Fen Hou, P. Ho","doi":"10.1109/AINA.2007.32","DOIUrl":"https://doi.org/10.1109/AINA.2007.32","url":null,"abstract":"In this paper, we propose an application-driven MAC-layer buffer management framework based on a novel active dropping (AD) mechanism for real-time video streaming in IEEE 802.16 Point-to-Multi-Point (PMP) networks. The basic idea of the proposed approach is that the MAC-layer protocol data units (MPDUs) of a video stream could be actively dropped at the Base Station (BS) if the corresponding frame is not with a sufficient confidence to be successfully delivered to the recipient within its application-layer delay bound. In contrast to the conventional cross-layer techniques that manipulate transmission and/or retransmission priorities for sending MPDUs of a single stream, the proposed AD mechanism can be more effectively bound the delay of each video frame and release precious transmission resources for the subsequent frames or the frames of the other competing streams. This is considered as an intelligent approach for minimizing delay propagation due to bad channels or any other possible reason. A comprehensive analytical model is formulated on deriving how confident a frame can be effectively delivered within its application-layer delay bound by jointly considering the effect of playback buffering. Extensive simulation is performed to demonstrate the effectiveness of the proposed scheme. We expect that the proposed application-driven MAC-layer buffer management can incorporate with the emerging cross-layer design paradigm for real-time video streaming in TDMA-based wireless broadband access networks such as IEEE 802.16.","PeriodicalId":361109,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125908496","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":"Delfos: the Oracle to Predict NextWeb User's Accesses","authors":"B. D. L. Ossa, J. A. Gil, J. Sahuquillo, A. Pont","doi":"10.1109/AINA.2007.50","DOIUrl":"https://doi.org/10.1109/AINA.2007.50","url":null,"abstract":"Despite the wide and intensive research efforts focused on Web prediction and prefetching techniques aimed to reduce user's perceived latency, few attempts to implement and use them in real environments have been done, mainly due to their complexity and supposed limitations that low user available bandwidths imposed few years ago. Nevertheless, current user bandwidths open a new scenario for prefetching that becomes again an interesting option to improve web performance. This paper presents Delfos, a framework to perform web predictions and prefetching on a real environment that tries to cover the existing gap between research and praxis. Delfos is integrated in the web architecture without modifying the standard HTTP 1.1 protocol, and acts inserting predictions in the web server side, while prefetchs are carried out by the client. In addition, it can be also used as a flexible framework to evaluate and compare existing prefetching techniques and algorithms and to assist in the design of new ones because it provides detailed statistics reports.","PeriodicalId":361109,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","volume":"04 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129397987","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}
Mitsunori Kubo, Baoliu Ye, Arata Shinozaki, M. Guo
{"title":"UMP-PerComp: A Ubiquitous Multiprocessor Network-Based Pipeline Processing Framework for Pervasive Computing Environments","authors":"Mitsunori Kubo, Baoliu Ye, Arata Shinozaki, M. Guo","doi":"10.1109/AINA.2007.142","DOIUrl":"https://doi.org/10.1109/AINA.2007.142","url":null,"abstract":"Pervasive computing provides an attractive vision for the future of computing where contextual intelligent services will be available anywhere at any time. However, how to integrate distributed resources existed among heterogeneous devices to build pervasive applications that can constantly adapt to the highly dynamic computing environment is still a challenge. By analyzing the pipelining feature within a user task and exploiting the parallelism among ubiquitous processors, we propose UMP-PerComp, a ubiquitous multiprocessor-based pipeline processing architecture to support high performance pervasive application development. UMP-PerComp is an integrated comprehensive framework that makes the development of pervasive applications easier. It includes a set of common services such as context management, resource management, service migration, topology management, that help to build applications and directly simplify the task decoupling and service composition. We describe the design and implementation of UMP-PerComp in this paper. Besides, we develop a distributed JPEG encoding application successfully on the UMP-PerComp. Our experience confirms that UMP-PerComp is a flexible, scalable and practicable framework with high performance.","PeriodicalId":361109,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129571234","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 Hierarchical Key Establishment Scheme forWireless Sensor Networks","authors":"Jamil Ibriq, I. Mahgoub","doi":"10.1109/AINA.2007.14","DOIUrl":"https://doi.org/10.1109/AINA.2007.14","url":null,"abstract":"This paper presents hierarchical key establishment scheme (HIKES) for wireless sensor networks. In this scheme, the base station, acting as the central trust authority, empowers randomly selected sensors to act as local trust authorities authenticating on its behalf the cluster members and issuing all secret keys. HIKES uses a partial key escrow scheme that enables any sensor node selected as a cluster head to generate all the cryptographic keys needed to authenticate other sensors within its cluster. This scheme localizes authentication and key distribution, thereby reducing the communication cost with the base station. HIKES also provides one-step broadcast authentication mechanism and shows robustness against most known routing attacks. Simulation results show that HIKES provides an efficient and scalable solution to the key management problem.","PeriodicalId":361109,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124621959","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}