Thomas Reidemeister, Klemens Böhm, Paul A. S. Ward, Erik Buchmann
{"title":"Malicious behaviour in content-addressable peer-to-peer networks","authors":"Thomas Reidemeister, Klemens Böhm, Paul A. S. Ward, Erik Buchmann","doi":"10.1109/CNSR.2005.39","DOIUrl":"https://doi.org/10.1109/CNSR.2005.39","url":null,"abstract":"Distributed hash tables (DHTs) promise to manage huge sets of key-value pairs in a peer-to-peer manner. The content-addressable network (CAN) is a prominent variant of DHT. A critical challenge when designing a CAN, or indeed any DHT, is ensuring that all data items are accessible despite the presence of malicious and faulty peers. Such peers may hinder other peers in accessing the keys in various ways. In this paper we identify various types of attacks and propose, where possible, some countermeasures. To counter man-in-the-middle attacks we have developed a dynamically-adjustable multi-path routing algorithm. We evaluate the efficacy of our method both analytically and by simulation. For networks with less than 1% malicious peers we were able to reduce the effect of such attacks by 80%.","PeriodicalId":166700,"journal":{"name":"3rd Annual Communication Networks and Services Research Conference (CNSR'05)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131038616","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 framework for quality of service in wireless networks","authors":"Jasminder Grewal, J. DeDourek","doi":"10.1109/CNSR.2005.7","DOIUrl":"https://doi.org/10.1109/CNSR.2005.7","url":null,"abstract":"The measurement and provision of QoS (Quality of Service) has increased in importance with the advent of real time streaming of multimedia applications. With wireless devices such as laptops, personal digital assistants and palmtops becoming more popular the onus lies in the transmission of multimedia streams over a wireless medium. This paper investigates the design of a testbed for evaluation of QoS in a network that includes a wireless link. Wireless network measurement techniques used for the research are discussed first followed by the issues arising as a result of using those techniques. The testbed setup that avoids the measurement issues and that can be used for carrying out wireless network measurement is described next. The final stage of the research concerns with a strategy that can be used for providing QoS over the previously discussed testbed. The tools used for implementing the strategies are discussed next.","PeriodicalId":166700,"journal":{"name":"3rd Annual Communication Networks and Services Research Conference (CNSR'05)","volume":"8 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116111071","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":"Biorthogonal pulse position modulation for time-hopping UWB systems","authors":"Hao Zhang, Wei Li, T. Gulliver","doi":"10.1109/CNSR.2005.26","DOIUrl":"https://doi.org/10.1109/CNSR.2005.26","url":null,"abstract":"In this paper, we propose a new modulation scheme called biorthogonal pulse position modulation (BPPM) for ultra-wideband (UWB) communication systems. The BPPM signals are constructed from orthogonal pulse position modulation signals. The channel capacity and error probability of BPPM are determined for a time-hopping UWB communication system. It is shown that N-ary BPPM has better performance than N-ary PPM with the same throughput and half the computational complexity.","PeriodicalId":166700,"journal":{"name":"3rd Annual Communication Networks and Services Research Conference (CNSR'05)","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134206060","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":"Understanding the performance of cooperative Web caching systems","authors":"Xiaosong Hu, A. N. Zincir-Heywood","doi":"10.1109/CNSR.2005.61","DOIUrl":"https://doi.org/10.1109/CNSR.2005.61","url":null,"abstract":"Web caching has been recognized as an effective scheme to alleviate the service bottleneck and reduce the network traffic, thereby minimizing the user access latency on the Internet. To maximize the performance of caching, cache cooperation systems such as hierarchical, distributed and hybrid are employed. In this work, we first derive an analytical model to calculate the performance parameters for the aforementioned three caching systems. We then test these systems on a Web cache simulator. Results show that the hybrid system is very competitive in terms of the hit ratio and the bandwidth usage compared to the distributed system and hierarchical system, respectively. On the other hand, the hybrid system gives the optimal results in terms of latency and the number of hops.","PeriodicalId":166700,"journal":{"name":"3rd Annual Communication Networks and Services Research Conference (CNSR'05)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129243569","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}
S. Krasser, H. Owen, J. Sokol, Hans-Peter Huth, J. Grimminger
{"title":"Adaptive per-flow traffic engineering based on probe packet measurements","authors":"S. Krasser, H. Owen, J. Sokol, Hans-Peter Huth, J. Grimminger","doi":"10.1109/CNSR.2005.20","DOIUrl":"https://doi.org/10.1109/CNSR.2005.20","url":null,"abstract":"In this research, we propose a new connection admission control and online traffic engineering framework. The framework is designed to fit small networks using differentiated services, e.g. radio access networks. Decisions are made at the edge routers of the network. Multiple disjoint label switched paths are pre-configured between each pair of edge routers (ERs). Between each pair of ERs, probe packets are sent on every path between those ERs and for every class of service. The characteristics of the transmission are measured at the ER at the end of the path, the egress ER. It sends the results back in feedback packets to the ingress ER at the beginning of the path. Additionally, low priority probe packets are sent at high rates to discover and reserve available bandwidth. The achieved throughput of those probes is also reported in feedback packets. Based on the results in these feedback packets, ERs render an admission decision for new connection requests and pick a path.","PeriodicalId":166700,"journal":{"name":"3rd Annual Communication Networks and Services Research Conference (CNSR'05)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133437314","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 tool framework for generation of application optimized communication protocols","authors":"R. Burda, Jörn Seger","doi":"10.1109/CNSR.2005.19","DOIUrl":"https://doi.org/10.1109/CNSR.2005.19","url":null,"abstract":"Communication networks and their services have been developing from user centric systems to a conglomerate of heterogeneous entities. Nowadays the end user device is only one participant. All communicating entities define services of arbitrary complexity by arranging the set of available functionalities according to the requested solution. Recently sensor networks have gathered a lot of attention to provide to \"the network\" some needed environmental information to enable value added location based services. This evolution has also introduced embedded systems to participate and supplement existing networks. In favour of these systems (which are lightweight usually), this paper proposes an algorithmic and tooling approach to define and implement communication protocols which are tailored to the specific needs of a given application. This approach, compared to general purpose protocols, reduces the communication overhead significantly. Side effects as energy saving may become crucial if long sustainability of an autonomous service is a major goal. Meanwhile, the database defining the application protocol is kept at a high abstraction level such as an XML document in case of the given examples.","PeriodicalId":166700,"journal":{"name":"3rd Annual Communication Networks and Services Research Conference (CNSR'05)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133310203","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 sensor Web language for mesh architectures","authors":"B. Nickerson, Zhongwei Sun, J. Arp","doi":"10.1109/CNSR.2005.17","DOIUrl":"https://doi.org/10.1109/CNSR.2005.17","url":null,"abstract":"A sensor Web language (SWL) for mesh architectures is presented. The mesh SWL architecture was extended from a hierarchical structure to provide a more robust environment to deploy, maintain and operate sensor networks. Alerts, direct sensor node communication, multiple gateway nodes and dynamic configuration are realized. With mesh architecture support in SWL, multiple sensor networks are provided with greater flexibility, more reliable operation and machinery to better support self-diagnosis and inferencing with sensor data.","PeriodicalId":166700,"journal":{"name":"3rd Annual Communication Networks and Services Research Conference (CNSR'05)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125924433","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":"Experimental studies of the 2.4-GHz ISM wireless indoor channel","authors":"H. MacLeod, C. Loadman, Z. Chen","doi":"10.1109/CNSR.2005.33","DOIUrl":"https://doi.org/10.1109/CNSR.2005.33","url":null,"abstract":"Experimental results from indoor measurements of the 2.4-GHz wireless channel are presented. These measurements include both quasi-static and time-varying channel conditions in a number of indoor environments. Four channel propagation characteristics of interest are evaluated. For the time-varying environment, the Doppler spread of the wireless channel is measured. For the quasi-static environment, mean excess delay, rms delay spread, and coherence bandwidth of the channel are determined. The effect each of these propagation characteristics has on multiple antenna wireless systems and their suitability for indoor use is discussed.","PeriodicalId":166700,"journal":{"name":"3rd Annual Communication Networks and Services Research Conference (CNSR'05)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123148619","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":"On fair traceable electronic cash","authors":"X. Hou, C. H. Tan","doi":"10.1109/CNSR.2005.45","DOIUrl":"https://doi.org/10.1109/CNSR.2005.45","url":null,"abstract":"Credit card is currently the most popular electronic payment method on the Internet, but it is not an ideal method from the security and privacy point of view. Electronic cash solves many inherent problems of credit card, such as anonymity and off-line payment, and is generally considered as an ideal electronic payment method. However, there are issues that are yet to be satisfactorily solved, such as fair traceability and double-spending prevention of offline schemes. In this paper, we will focus on the discussion of fair traceability of electronic cash and analysis of various fair tracing mechanisms, and present a new approach of fair tracing in the customer generated fair traceable electronic cash model.","PeriodicalId":166700,"journal":{"name":"3rd Annual Communication Networks and Services Research Conference (CNSR'05)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114120029","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":"Router design for optical Cartesian networks","authors":"N. Sheth, Larry Hughes","doi":"10.1109/CNSR.2005.54","DOIUrl":"https://doi.org/10.1109/CNSR.2005.54","url":null,"abstract":"The paper describes the progress in the research, design, and development of an all-optical router for the optical switching of packets in Cartesian networks (a novel network akin to mesh networks). The importance of all-optical packet switching/routing for convergent, next generation transport network is described. The selection of Cartesian routing as the basic routing methodology for all-optical packets is justified. The photonic packet switch/router architecture is studied in detail. Various design issues related to an all-optical node, such as header synchronization, header processing and optical buffering have been addressed. The functionality modelling of optical components and optical switch/router simulation algorithms are presented as well.","PeriodicalId":166700,"journal":{"name":"3rd Annual Communication Networks and Services Research Conference (CNSR'05)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114385722","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}