{"title":"CAM-MAC: A Cooperative Asynchronous Multi-Channel MAC Protocol for Ad Hoc Networks","authors":"Tie Luo, M. Motani, V. Srinivasan","doi":"10.1109/BROADNETS.2006.4374373","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374373","url":null,"abstract":"Medium access control (MAC) protocols have been studied under different contexts for several years now. In all these MAC protocols, nodes make independent decisions on when to transmit a packet and when to back-off from transmission. In this paper, we introduce the notion of node cooperation into MAC protocols. Cooperation adds a new degree of freedom which has not been explored before. Specifically we study the design of cooperative MAC protocols in an environment where each node is equipped with a single transceiver and has multiple channels to choose from. Nodes cooperate by helping each other select a free channel to use. We show that this simple idea of cooperation has several qualitative and quantitative advantages. Our cooperative asynchronous multi-channel MAC protocol (CAM-MAC) is extremely simple to implement and, unlike other multi-channel MAC protocols, is naturally asynchronous. We conduct extensive simulation experiments. We first compare CAM-MAC with IEEE 802.11b and a version of CAM-MAC with the cooperation element removed. We use this to show the value of cooperation. Our results show significant improvement in terms of number of collisions and throughput for CAM-MAC. We also compare our protocol with MMAC and SSCH and show that CAM-MAC significantly outperforms both of them.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130155721","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":"The Performance of Periodic Link-State Update in Wavelength-Routed Networks","authors":"Shu Shen, Gaoxi Xiao, T. Cheng","doi":"10.1109/BROADNETS.2006.4374370","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374370","url":null,"abstract":"Distributed lightpath establishment in wavelength- routed networks requires up-to-date link-state information to achieve blocking performance target. Invalid routing and wavelength assignment decisions caused by inaccurate link-state information may degrade network performance significantly as the lightpaths become more and more dynamic. In this paper, we evaluate the performance of periodic link-state update, where link-state information is exchanged between network nodes at regular intervals. By proposing an accurate analytical model as well as by carrying out extensive simulations, we show how different components of network blocking probability are affected by inaccurate information under different traffic loads, and provide insights into the high sensitivity of blocking performance to link- state update interval under light traffic loads. We demonstrate how the sensitivity could be affected by network connectivity as well.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126583818","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}
K. Kavoussanakis, A. Phipps, C. Palansuriya, A. Trew, A. Simpson, Rob Baxter
{"title":"Federated Network Performance Monitoring for the Grid","authors":"K. Kavoussanakis, A. Phipps, C. Palansuriya, A. Trew, A. Simpson, Rob Baxter","doi":"10.1109/BROADNETS.2006.4374419","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374419","url":null,"abstract":"Grid application performance is inherently dependent on the performance and reliability of the underlying network. In a production Grid infrastructure, network performance monitoring (NPM) information is required both for middleware resource-brokering decisions and operational monitoring. A variety of NPM frameworks are available which can provide such information. However, the diverse global nature of the EGEE (Enabling Grids for E-sciencE) fabric means it is impractical to mandate a single monitoring solution. In this paper we propose a broker-based federated architecture for integration of NPM information from a heterogeneous set of monitoring frameworks, which provides simplified access to the frameworks for clients. We also present an overview of the requirements for NPM gathered from EGEE middleware developers and operational monitoring users. Finally, we describe our pilot implementation which has proven the validity of the architecture and demonstrated the first integrated access to backbone and end-to-end data gathered using different monitoring frameworks.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126345879","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}
Xiaodong Huang, Qingya She, Zhang Tao, K. Lu, J. Jue
{"title":"Small Girou Multicast with Deflection Routing in Optical Burst Switched Networks","authors":"Xiaodong Huang, Qingya She, Zhang Tao, K. Lu, J. Jue","doi":"10.1109/BROADNETS.2006.4374322","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374322","url":null,"abstract":"In this paper, we focus on the problem of effectively supporting a large number of small group multicasts in optical burst switched (OBS) networks. We first propose a multicast scheme for small group multicast in OBS networks. To reduce burst loss due to potential burst contentions, a deflection routing scheme for multicast is proposed. We then develop a generic analytical model to evaluate the performance of the multicast scheme and the deflection routing scheme. To the best of our knowledge, this is the first analytical model proposed for the problem of multicast with deflection routing. The analytical model is verified through simulations. Numerical results show that the analytical model is accurate and that deflection routing can significantly reduce burst loss probability while slightly increasing burst delay.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131449000","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":"Effect of Number of Burst Assemblers on TCP Performance in Optical Burst Switching Networks","authors":"Guray Gurel, Ezhan Karasan","doi":"10.1109/BROADNETS.2006.4374326","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374326","url":null,"abstract":"Burst assembly mechanism is one of the fundamental factors that determine the performance of an optical burst switching (OBS) network. In this paper, we investigate the influence of number of burstifiers on TCP performance for an OBS network. An ns2-based OBS network simulator is developed for simulating the optical network. The goodput of TCP flows between an ingress and an egress nodes traveling through an optical network is studied for different values of the number of assembly buffers per destination. First, the losses resulting from the congestion in the core OBS network are modeled using a burst independent Bernoulli loss model. Then, a background burst traffic is generated to create contention at a core node in order to realize a burst dependent loss model. Simulation results show that for an OBS network employing timer-based assembly algorithm, TCP goodput increases as the number of burst assemblers is increased for both types of loss models. The improvement from one burstifier to moderate number of burst assemblers is significant (15-50% depending on the burst loss probability, processing delay and the TCP version), but the goodput difference between moderate number of buffers and per- flow aggregation is relatively small, implying that a cost-effective OBS edge switch implementation should use moderate number of assembly buffers per destination for enhanced TCP performance.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131845660","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":"Transparent Optimization of Grid Server Selection With Real-Time Passive Network Measurements","authors":"M. Zangrilli, B. Lowekamp","doi":"10.4108/gridnets.2006.7","DOIUrl":"https://doi.org/10.4108/gridnets.2006.7","url":null,"abstract":"Grid services have tremendously simplified the programming challenges in leveraging large-scale distributed computing. At the same time, the increased level of abstraction reduces the opportunities available to the application for optimizing its performance by monitoring the system. In this paper we introduce a monitoring grid services proxy, which transparently monitors network performance and selects between several replica service providers. This approach provides optimized server selection without any modification to or even awareness of the client application or service providers. We describe how we implement the proxy and monitor the available bandwidth to the service providers using the Wren monitoring toolkit. We present analysis indicating that our monitoring has negligible overhead. Finally, we demonstrate the practicality of our approach by optimizing the server selection for INCOGEN's VIBE, a bioinformatics workflow application that uploads gene sequences for analysis by remote service providers.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134456271","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":"Accuracy and Dynamics of Hash-Based Load Balancing Algorithms for Multipath Internet Routing","authors":"Rüdiger Martin, M. Menth, Michael Hemmkeppler","doi":"10.1109/BROADNETS.2006.4374377","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374377","url":null,"abstract":"This paper studies load balancing for multipath Internet routing. We focus on hash-based load balancing algorithms that work on the flow level to avoid packet reordering which is detrimental for the throughput of transport layer protocols like TCP. We propose a classification of hash-based load balancing algorithms, review existing ones and suggest new ones. Dynamic algorithms can actively react to load imbalances which causes route changes for some flows and thereby again packet reordering. Therefore, we investigate the load balancing accuracy and flow reassignment rate of load balancing algorithms. Our exhaustive simulation experiments show that these performance measures depend significantly on the traffic properties and on the algorithms themselves. As a consequence, our results should be taken into account for the application of load balancing in practice.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129328919","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}
Andrew Barton-Sweeney, Dimitrios Lymberopoulos, A. Savvides
{"title":"Sensor Localization and Camera Calibration in Distributed Camera Sensor Networks","authors":"Andrew Barton-Sweeney, Dimitrios Lymberopoulos, A. Savvides","doi":"10.1109/BROADNETS.2006.4374301","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374301","url":null,"abstract":"Camera sensors constitute an information rich sensing modality with many potential applications in sensor networks. Their effectiveness in a sensor network setting however greatly relies on their ability to calibrate with respect to each other, and other sensors in the field. This paper examines node localization and camera calibration using the shared field of view of camera pairs. Using a new distributed camera sensor network we compare two approaches from computer vision and propose an algorithm that combines a sparse set of distance measurements with image information to accurately localize nodes in 3D. Our algorithms are evaluated using a network of iMote2 nodes equipped with COTS camera modules. The sensor nodes identify themselves to cameras using modulated LED emissions. Our indoor experiments yielded a 2-7cm error in a 6x6m room. Our outdoor experiments in a 30x30m field resulted in errors 20-80cm, depending on the method used.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116353942","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":"OPSENET: A Security-Enabled Routing Scheme for a System of Optical Sensor Networks","authors":"U. N. Okorafor, D. Kundur","doi":"10.1109/BROADNETS.2006.4374297","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374297","url":null,"abstract":"In this paper we introduce OPSENET, a novel and efficient protocol that facilitates secure routing in directional optical sensor networks. We show that even though the uni- directionality of links in an optical sensor network (OSN) complicates the design of efficient routing, link directionality actually helps security in our network setup. In particular, we leverage the naturally-occurring clustering that results from passive (bi-directional) communication of select cluster head nodes with the base station, to improve overall network performance. This paper presents two main contributions: (1) We introduce OPSENET, a novel secure cluster-based routing algorithm for base station circuit discovery in OSNs. In order to support the efficient utilization of a nodes' resources, we employ symmetric cryptography in the design of OPSENET, using efficient oneway hash functions and pre-deployed keying. OPSENET achieves base station broadcast authentication, per-hop authentication, and cluster group secrecy, without requiring any time synchronization. (2) We analyze the relevance of traditional routing attacks on OSNs, and show that OPSENET is robust against uncoordinated (non-smart) insider routing attacks, amongst other compromises. An important performance metric of OPSENET is its low byte overhead, and graceful degradation with the number of compromised nodes in the network. To the best of our knowledge, this is the first paper to consider secure routing in an OSN network scenario.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125576359","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":"Divide and Conquer in Loss Tomography - Top Down vs. Botton Up","authors":"Weiping Zhu","doi":"10.1109/BROADNETS.2006.4374355","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374355","url":null,"abstract":"Loss tomography has received considerable attention in recent years. A number of methods, either based on maximum likelihood (ML) or Bayesian reasoning, have been proposed to estimate the loss rates of a network, and almost all of them use an iterative approximating method to search for the maximum in a multi-dimensional space. Those approaches lead to the concerns of their scalability and accuracy. To overcome the problems, a bottom up method has been proposed recently, that is a near optimal solution. In this paper, we present a closed form maximum likelihood estimate (MLE) that can be implemented in a top down method. Then, the bottom up method is compared with the top down one that shows they are little difference. More, simulations conducted under various conditions show that these two methods have almost identical results. Apart from that, the bottom up approach is independent to the number of sources used to send probes to receivers, this makes it a good candidate to estimate the loss rates of a general topology.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125814690","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}