{"title":"DATALITE: a distributed architecture for traffic analysis via light-weight traffic digest","authors":"W. Lau, M. Kodialam, T. V. Lakshman, H. J. Chao","doi":"10.1109/BROADNETS.2007.4550492","DOIUrl":"https://doi.org/10.1109/BROADNETS.2007.4550492","url":null,"abstract":"In this paper, we propose DATALITE, a Distributed Architecture for Traffic Analysis via LIght-weight Traffic digEst, which introduces a set of new distributed algorithms and protocols to support general Traffic Measurement and Analysis (TMA) functions for large-scale, 10Gbps+ packet-switched networks. We formulate the network-wide traffic measurement/ analysis problem as a series of set-cardinality-determination (SCD) problems. By leveraging recent advances in probabilistic distinct sample counting techniques, the set-cardinalities, and thus, the network-wide traffic measurements of interest can be computed in a distributed manner via the exchange of extremely light-weight traffic digests (TD’s) amongst the network nodes. A TD for N packets only requires O(loglog N) bits of memory storage.","PeriodicalId":352372,"journal":{"name":"2007 Fourth International Conference on Broadband Communications, Networks and Systems (BROADNETS '07)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123760690","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. Balasubramaniam, D. Botvich, W. Donnelly, J. Strassner
{"title":"A biologically inspired policy based management system for survivability in autonomic networks","authors":"S. Balasubramaniam, D. Botvich, W. Donnelly, J. Strassner","doi":"10.1109/BROADNETS.2007.4550420","DOIUrl":"https://doi.org/10.1109/BROADNETS.2007.4550420","url":null,"abstract":"The vision of Autonomic Network Management seeks self-governance (e.g. self-organisation, self-management) capabilities amongst network devices and system to minimise complexities found in current network management. Policy based management system provides a mechanism to counter these complexities, where the system provides a consistent model for decision making process. In this paper we propose bio-inspired mechanisms to support network survivability that is integrated with policy based management. Our solution is based on adaptation and integration of various biological principles such as Blood Glucose Homeostasis, Chemotaxis, Reaction-Diffusion and Hormone Signaling. The bio-inspired principles support a high degree of robustness, which is a key feature towards adapting in fluctuating network environment. Simulations results have also been presented to illustrate our proposed solution.","PeriodicalId":352372,"journal":{"name":"2007 Fourth International Conference on Broadband Communications, Networks and Systems (BROADNETS '07)","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134600475","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 study of self-repairing unicast hierarchical protection trees in mesh networks","authors":"S. Shah-Heydari, O. Yang","doi":"10.1109/BROADNETS.2007.4550490","DOIUrl":"https://doi.org/10.1109/BROADNETS.2007.4550490","url":null,"abstract":"Protection trees have been used in the past for protecting multicast and unicast traffic in networks in various scenarios. In this paper we focus on shared protection trees for link protection in unicast mesh networks. We present a heuristic algorithm that reduces the redundant capacity required for protection on shared trees, and improves the restorability of the network. We use simulation of random mesh graphs to compute the performance improvement for various network sizes.","PeriodicalId":352372,"journal":{"name":"2007 Fourth International Conference on Broadband Communications, Networks and Systems (BROADNETS '07)","volume":"230 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116388141","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}
D. Simeonidou, G. Zervas, R. Nejabati, F. Callegati, A. Campi, W. Cerroni
{"title":"SIP-enpowered OBS network architecture for future IT services and applications","authors":"D. Simeonidou, G. Zervas, R. Nejabati, F. Callegati, A. Campi, W. Cerroni","doi":"10.1109/BROADNETS.2007.4550414","DOIUrl":"https://doi.org/10.1109/BROADNETS.2007.4550414","url":null,"abstract":"This paper presents a novel application-aware network architecture for evolving and emerging IT services and applications. It proposes and analyses network architectures that integrate Session Initiation Protocol (SIP) with Optical Burst Switched (OBS) protocols on a unified manner. We suggest various SIP-OBS layering architectures for possible deployment as well as a number of end-to-end resource discovery protocols (both for network and non-network resources). Finally the paper reports of a SIP-enpowered OBS Testbed where this approach was experimentally validated.","PeriodicalId":352372,"journal":{"name":"2007 Fourth International Conference on Broadband Communications, Networks and Systems (BROADNETS '07)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114391390","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":"Using closed loop feedback control theoretic techniques to improve obs networks performance","authors":"Wael Hosny Fouad Aly, M. Zhani, H. Elbiaze","doi":"10.1109/BROADNETS.2007.4550405","DOIUrl":"https://doi.org/10.1109/BROADNETS.2007.4550405","url":null,"abstract":"This paper considers the use of closed loop feedback control theoretic techniques to improve the performance of Optical Burst Switching (OBS) networks. In OBS networks, the Burst Loss Ratio (BLR) is the ratio between the lost bursts to the sent bursts. The BLR is used as a performance metric. The desired burst loss ratio depends on the application using the network. Some applications might tolerate more burst loss ratios than other applications. Higher network link utilization could be achieved by having more control over the burst loss ratio. Burstification rate is the rate of injecting bursts into the OBS network. In this paper, a novel technique to control the burst loss ratio in OBS networks is proposed. The technique is based on classical control theory approaches to tune the burstification rate in order to achieve a desired burst loss ratio to satisfy the application requirements. Extensive experiments show that the proposed technique achieves promising results. That is, the measured burst loss ratio hovers around the desired burst loss ratio and higher utilization is observed. Empirical approaches are used to identify the proposed model. The empirical model fits the OBS network by a value that did not fall below 75%.","PeriodicalId":352372,"journal":{"name":"2007 Fourth International Conference on Broadband Communications, Networks and Systems (BROADNETS '07)","volume":"298 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114488687","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":"Extending parallel index clustering for multi-operator mobile peer-to-peer services","authors":"N. Beijar","doi":"10.1109/BROADNETS.2007.4550463","DOIUrl":"https://doi.org/10.1109/BROADNETS.2007.4550463","url":null,"abstract":"This paper studies a commercial service for resource sharing between users of a mobile network. It process a unique architecture combining the advantages of the Parallel Index Cluster (PIC) architecture with the semi-centralized (super-peer) architecture. The architecture extends PIC by adding two hierarchical levels and by removing the requirement of full connectivity between clusters. For the latter purpose, two new search algorithms based on random walks are proposed. The architecture is applied to a multi-operator environment, where policies affect the routing of queries. To distribute load between nodes, we specify a procedure for interconnecting clusters. The proposed extensions and search algorithms are evaluated using simulation.","PeriodicalId":352372,"journal":{"name":"2007 Fourth International Conference on Broadband Communications, Networks and Systems (BROADNETS '07)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131598307","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}
B. Lannoo, Lieven Verslegers, D. Colle, M. Pickavet, P. Demeester, M. Gagnaire
{"title":"Thorough analysis of the IPACT dynamic bandwidth allocation algorithm for EPONs","authors":"B. Lannoo, Lieven Verslegers, D. Colle, M. Pickavet, P. Demeester, M. Gagnaire","doi":"10.1109/BROADNETS.2007.4550473","DOIUrl":"https://doi.org/10.1109/BROADNETS.2007.4550473","url":null,"abstract":"This paper describes extensive research in the field of the Multipoint Control Protocol (MPCP) for the Ethernet Passive Optical Network (EPON). More in particular the dynamic bandwidth allocation (DBA) algorithm IPACT (Interleaved Polling with Adaptive Cycle Time) is analytically modeled. The main focus has been on analyzing cycle times and packet delay in detail. The analysis starts from a simple traffic model with Poisson arrival rates, symmetric load and fixed packet size. Based on the obtained insights, more general cases with asymmetric traffic load, packet size distribution, self-similar traffic and differentiated services are further elaborated.","PeriodicalId":352372,"journal":{"name":"2007 Fourth International Conference on Broadband Communications, Networks and Systems (BROADNETS '07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134486333","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":"Dedicated path protection for waveband switching in WDM networks (invited paper)","authors":"Mengke Li, B. Ramamurthy","doi":"10.1109/BROADNETS.2007.4550487","DOIUrl":"https://doi.org/10.1109/BROADNETS.2007.4550487","url":null,"abstract":"This paper considers the problem of dedicated path-protection in a wavelength-division multiplexing (WDM) mesh network with waveband switching (WBS) functionality under shared risk link group (SRLG) constraints. Two protection schemes are proposed, namely the Protecting-waveBand-At-waveBand-Level-only (PBABL) and the Mixed-Protection-At-waveBand-and-Wavelength-Level (MPABWL). The PBABL protects each working waveband-path by a backup waveband-path. While the MPABWL protects each working waveband-path by either a backup waveband-path or multiple backup lightpaths. The performances of the two protection schemes in terms of gained revenue and cost saving are studied and compared. Integer linear programming (ILP) formulations are presented to solve the problems for each protection scheme. Numerical results of the ILPs and the experimental results of previously proposed heuristics are presented, which show that both heuristics can obtain optimum solutions. According to the results, under heavy load traffic the MPABWL scheme provides solutions with higher revenues than the PBABL scheme does. Under light load traffic, where network resources are sufficient to accommodate all the traffics, the PBABL scheme leads to less switching and transmission costs than the MPABWL scheme does.","PeriodicalId":352372,"journal":{"name":"2007 Fourth International Conference on Broadband Communications, Networks and Systems (BROADNETS '07)","volume":"244 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133718859","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":"Optimizing dimensionality and accelerating landmark positioning for coordinates based RTT predictions","authors":"D. Milic, T. Braun","doi":"10.1109/BROADNETS.2007.4550493","DOIUrl":"https://doi.org/10.1109/BROADNETS.2007.4550493","url":null,"abstract":"In this paper we analyze the positioning of landmarks in coordinates-based Internet distance prediction approaches with focus on Global Network Positioning (GNP). We show that one of the major drawbacks of GNP is its computational overhead for a large number of landmarks and dimensions. In our work we identify two factors, which have a great impact on the computational overhead. The first one is being able to determine the optimal number of dimensions for embedding a given set of landmarks into a Euclidean space. The second factor is the selection of a good starting point for minimizing the total error of embedding. We propose an algorithm based on the simplex inequality (a generalized form of the triangle inequality) to extract the optimal number of dimensions based on distance measurements between landmarks. We also provide methods to compute a good starting point for the minimization problem and to reduce the number of variables involved in the minimization. We performed experiments with data obtained from the PlanetLab all-sites-pings experiment to verify the correctness and performance gains of our algorithm. The experimental results show that our enhancements to GNP landmark positioning are able to find the optimal number of dimensions for embedding the landmarks. These enhancements also accelerate the function minimization.","PeriodicalId":352372,"journal":{"name":"2007 Fourth International Conference on Broadband Communications, Networks and Systems (BROADNETS '07)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128337558","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":"Client-side web acceleration for low-bandwidth hosts","authors":"Tae-Young Chang, Zhenyun Zhuang, Aravind Velayutham, Raghupathy Sivakumar","doi":"10.1109/BROADNETS.2007.4550537","DOIUrl":"https://doi.org/10.1109/BROADNETS.2007.4550537","url":null,"abstract":"Current popular web-browsers simply fetch the entire web-page from the server in a greedy fashion. This simple web fetching mechanism employed by browsers is inappropriate for use in low-bandwidth networks, since they cause large response times for users unneccesarily. In this paper, we first analyze the reasons that cause large response times by considering several factors including the properties of typical web-pages and browsers, the interaction of the HTTP and TCP protocols, and the impact of server-side optimization techniques. We then propose three easy-to-deploy browser-side optimization mechanisms to reduce the user response time. Through simulations, we compare the performance of our solution with that of current browsers and show that the proposed scheme brings significant performance benefits in terms of user-perceived response times.","PeriodicalId":352372,"journal":{"name":"2007 Fourth International Conference on Broadband Communications, Networks and Systems (BROADNETS '07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129344324","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}