{"title":"P2PConf: A Medium-Size P2P Internet Conference with Effective Floor Control","authors":"Yuh-Jzer Joung, P. Chien","doi":"10.1109/ICOIN.2008.4472792","DOIUrl":"https://doi.org/10.1109/ICOIN.2008.4472792","url":null,"abstract":"Internet-Conferencing allows a number of participants, separated by substantial distances, to meet in a virtual space and communicate with each other. In contrast to existing systems that typically require dedicated servers to manage conferences, Skype has illustrated the potential of using P2P (peer- to-peer) technology to construct a simple yet very large VoIP application over the Internet. However, each conference in Skype is limited to at most five participants. As the interaction between Internet users increases, a conference that can accommodate more participants becomes imminent. This paper presents the design and implementation of such a P2P-based conference system, along with an effective floor control mechanism to ensure conference quality.","PeriodicalId":447966,"journal":{"name":"2008 International Conference on Information Networking","volume":"94 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134476239","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}
Donghyeok Lee, Seungmin Lee, Taekyong Nam, You-Jin Song
{"title":"A Bucket ID Transformation Scheme for Efficient Database Encryption","authors":"Donghyeok Lee, Seungmin Lee, Taekyong Nam, You-Jin Song","doi":"10.1109/ICOIN.2008.4472789","DOIUrl":"https://doi.org/10.1109/ICOIN.2008.4472789","url":null,"abstract":"Encryption is a well established technology for protecting sensitive data. Unfortunately, the integration of existing encryption techniques with database systems causes undesirable performance degradation. We propose the bucket ID transformation that supports range queries without exposing the order of plaintext. The Bucket ID Transformation is performed by modulo arithmetic or pseudo-random number generation. This method is more powerful than the previous order-preserving methods and is expected to handle data more efficiently than other methods. Experiment results show that our scheme outperforms other method in encryption and query speed.","PeriodicalId":447966,"journal":{"name":"2008 International Conference on Information Networking","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133269282","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":"Heuristics to Classify Internet Backbone Traffic based on Connection Patterns","authors":"Wolfgang John, S. Tafvelin","doi":"10.1109/ICOIN.2008.4472818","DOIUrl":"https://doi.org/10.1109/ICOIN.2008.4472818","url":null,"abstract":"In this paper Internet backbone traffic is classified on transport layer according to network applications. Classification is done by a set of heuristics inspired by two previous articles and refined in order to better reflect a rough and highly aggregated backbone environment. Obvious misclassified flows by the existing two approaches are revealed and updated heuristics are presented, excluding the revealed false positives, but including missed P2P streams. The proposed set of heuristics is intended to provide researchers and network operators with a relatively simple and fast method to get insight into the type of data carried by their links. A complete application classification can be provided even for short 'snapshot' traces, including identification of attack and malicious traffic. The usefulness of the heuristics is finally shown on a large dataset of backbone traffic, where in the best case only 0.2% of the data is left unclassified.","PeriodicalId":447966,"journal":{"name":"2008 International Conference on Information Networking","volume":"17 28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114520217","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}
Weiyu Wu, Yang Chen, Xinyi Zhang, Xiaohui Shi, Lin Cong, Beixing Deng, Xing Li
{"title":"LDHT: Locality-aware Distributed Hash Tables","authors":"Weiyu Wu, Yang Chen, Xinyi Zhang, Xiaohui Shi, Lin Cong, Beixing Deng, Xing Li","doi":"10.1109/ICOIN.2008.4472811","DOIUrl":"https://doi.org/10.1109/ICOIN.2008.4472811","url":null,"abstract":"As the substrate of structured peer-to-peer systems, distributed hash table (DHT) plays a key role in P2P routing infrastructures. Traditional DHT does not consider the location of the nodes for the assignment of identifiers, which will result in high end-to-end latency on DHT-based overlay networks. In this paper, we propose a design of locality-aware DHT called LDHT, which exploits network locality on DHT-based systems. Instead of assigning uniform random node identifiers in traditional DHT, nodes in LDHT are assigned locality-aware identifiers according to their autonomous system numbers (ASNs). As a result, each node will have more nearby neighbors than faraway neighbors in the overlay. We evaluate the performance of LDHT on different kinds of typical DHT protocols and on various topologies. The results show that LDHT improves the traditional DHT protocols a lot in terms of end-to-end latency, without introducing additional overhead. It is indicated that LDHT is fit for different kinds of DHT protocols and can work effectively on all structured P2P systems including Chord, Symphony and Kademlia.","PeriodicalId":447966,"journal":{"name":"2008 International Conference on Information Networking","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127946600","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":"Implementation and Evaluation of a Generic IP Signaling Protocol","authors":"N. Boukhatem, Thanh Tra Luu","doi":"10.1109/ICOIN.2008.4472750","DOIUrl":"https://doi.org/10.1109/ICOIN.2008.4472750","url":null,"abstract":"To contribute to the effort of the NSIS (next steps in signaling) IETF working group in defining a generic IP signaling protocol, we designed the GISP (generic signaling service protocol) protocol. In this paper, we summarize the GISP characteristics and focus on implementation aspects and performance results of the GISP signaling system. We study various performance aspects such session setup latency, memory and CPU consumption. Our results highlight good performance of the GISP and validate the implementation choices.","PeriodicalId":447966,"journal":{"name":"2008 International Conference on Information Networking","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121071611","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":"UDDN: Unidirectional Data Dissemination via Negotiation","authors":"I. Banerjee, H. Rahaman","doi":"10.1109/ICOIN.2008.4472776","DOIUrl":"https://doi.org/10.1109/ICOIN.2008.4472776","url":null,"abstract":"Radio technology enables deployment of tiny smart sensors in wireless sensor networks. The smart sensors can collect information from surroundings to forward it to the network base station. In this paper, we present UDDN (Unidirectional Data Dissemination via Negotiation) for efficient routing of such useful information in an energy-constrained environment. The sensor nodes in UDDN use meta-data in negotiation to avoid redundant data transmission as well as to reduce the network operations. Further, while disseminating data towards base station the UDDN minimizes the number of nodes participating in such process and, thereby, reduces energy consumption in routing the information.","PeriodicalId":447966,"journal":{"name":"2008 International Conference on Information Networking","volume":"192 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124281497","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}
Seung-Yeon Kim, Se-Jin Kim, Hyong-Woo Lee, Choong-Ho Cho
{"title":"Packet Interference and Aggregated Throughput of Bluetooth Piconets Using an Adaptive Frequency Hopping in Rician Fading Channels","authors":"Seung-Yeon Kim, Se-Jin Kim, Hyong-Woo Lee, Choong-Ho Cho","doi":"10.1109/ICOIN.2008.4472812","DOIUrl":"https://doi.org/10.1109/ICOIN.2008.4472812","url":null,"abstract":"In this paper we analyze the packet interference probability and the aggregated throughput of a WPAN in which a number of Bluetooth piconets share the ISM band with WLANs. When an Adaptive Frequency Hopping (AFH) algorithm is used, the number of hops available to the Bluetooth piconets varies depending on the number of independent WLANs within the piconets radio range. Using a packet collision model in a piconet cluster, we give an analysis of the packet interference probability and the aggregated throughput as a function of the available hops for the AFH algorithm. We also present an analytical model of packet interference with multi-path fading channel in a cluster of piconets. Through analysis, we obtain the packet collision probability and aggregated throughput assuming capture effect. Numerical examples are given to demonstrate the effect of various parameters such as capture ratio, Rice factor and cluster size on the system performance.","PeriodicalId":447966,"journal":{"name":"2008 International Conference on Information Networking","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124407911","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":"Ubiquitous Audio Access in the UPnP Home Network","authors":"Chung-Ming Huang, Ming-Sian Lin, Hon-Long Wong","doi":"10.1109/ICOIN.2008.4472807","DOIUrl":"https://doi.org/10.1109/ICOIN.2008.4472807","url":null,"abstract":"The evolution of wireless transmission technology enables users to have multimedia services anywhere in the digital home network. In this paper, we propose a handoff control scheme for devices without computation capability, such as the light-weight Bluetooth (LW-BT) headset. The main concern of the handoff is that the client device doesn't have the computation capability. The main function of the computing powerless client device is to send/receive signals and play the audio data. Thus, how to have the handoff control when a computing powerless client device is switched from one access point to another access point becomes a problem to be resolved. A typical example is in the BT wireless network environment. The LW-BT headset is dedicated for audio applications and doesn't have extra computation capability. The proposed handoff control scheme puts all handoff computation overhead on the master BT device, such that the LW-BT headset is unaware of the handoff. Based on the proposed handoff control scheme, a Ubiquitous Audio Access Platform for the LW-BT headset (UAB) is proposed and developed to enable users to access the audio flies using the LW- BT headset in the digital home network even when they are roaming.","PeriodicalId":447966,"journal":{"name":"2008 International Conference on Information Networking","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125253872","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 Multi-Level Super Peer Based P2P Architecture","authors":"Zhao Cao, Kan Li, Yu-shu Liu","doi":"10.1109/ICOIN.2008.4472751","DOIUrl":"https://doi.org/10.1109/ICOIN.2008.4472751","url":null,"abstract":"Most existing super peer based Peer-to-Peer (P2P) systems have only one level super peer, it can not support hierarchical P2P architecture, especially, the effectiveness, efficiency and scalability can not satisfy some application's requirements with the growth of the system. In this paper, we design a P2P system with hierarchical structure. First, we propose a Multi-Level Super Peer (MLSP) based P2P architecture for supporting hierarchical P2P system, where the upper level super peer summarizes its subordinates' meta information. Second, based on this architecture, we develop our query executing algorithm by only spreading query to the upper level super peer and flooding query between root level super peers. Finally, we design a protocol to handle the join and leave of peers, super peer selection, split and merge. By conducting experiments on a simulated large-scale network, we come to the conclusion that the effectiveness, efficiency and scalability improve prominently in the proposed system.","PeriodicalId":447966,"journal":{"name":"2008 International Conference on Information Networking","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125683081","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":"Investigating the Performance of Hierarchical Video-on-Demand System in Heterogeneous Environment","authors":"K. Ho, W. Poon, K. Lo","doi":"10.1109/ICOIN.2008.4472804","DOIUrl":"https://doi.org/10.1109/ICOIN.2008.4472804","url":null,"abstract":"To support large-scale video-on-demand (VoD) services, many transmission schemes such as data broadcasting and proxy caching have been developed to minimize the resources requirement and enhance the system scalability. However, most of the previous works mainly focused on providing the VoD services in a homogeneous environment. In this paper, we investigate a feasible solution for building an efficient hierarchical VoD system using proxy caching coupled with broadcasting and appropriate coding schemes in heterogeneous environment so as to minimize the system transmission cost. By developing a performance model in this paper, system designers can study how various techniques for VoD can be organized to maximize the efficiency of the system. From the results, it can be seen that the system performance can be greatly enhanced by efficiently coupling various techniques.","PeriodicalId":447966,"journal":{"name":"2008 International Conference on Information Networking","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129381015","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}