Belkacem Daheb, W. Fawaz, O. Audouin, B. Berde, Ken Chen, G. Pujolle
{"title":"Policy-based hybrid hierarchical optical networks","authors":"Belkacem Daheb, W. Fawaz, O. Audouin, B. Berde, Ken Chen, G. Pujolle","doi":"10.1109/BROADNETS.2004.65","DOIUrl":"https://doi.org/10.1109/BROADNETS.2004.65","url":null,"abstract":"This document presents provisioning strategies for emerging hybrid optical networks. The idea is to make use of policy-based management that guides the behavior of a network through high-level declarative directives. In this regard and in the context of hybrid optical networks, policy rules are employed as the main means to extend the functionality of the control system and to complement its role in order to achieve the service provisioning.","PeriodicalId":305639,"journal":{"name":"First International Conference on Broadband Networks","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116107873","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":"Computing blocking probability of dynamic traffic grooming in mesh WDM optical networks","authors":"C. Xin","doi":"10.1109/BROADNETS.2004.24","DOIUrl":"https://doi.org/10.1109/BROADNETS.2004.24","url":null,"abstract":"The optical connections (lightpaths) offered to the client by optical networks have large capacities. On the other hand, the client traffic flows require smaller and heterogeneous bandwidths. Due to this bandwidth gap, client traffic flows are aggregated onto lightpaths to improve network utilization and reduce cost, which is called traffic grooming. In this paper, we develop an analytical model using the single-service reduced load approximation to compute traffic loss probabilities in grooming of dynamic traffic. The model can address arbitrary alternate routing, and arbitrary wavelength conversion in the optical network. We have compared this model with a previous work that uses the multi-service reduced load approximation, with regard to computation time and calculated blocking probabilities. The results obtained by the single-service model are very close to those by the multi-service model, and the computation time can be significantly improved. On the other hand, the results calculated by the (both single and multi-service) analyses match those obtained by the simulation.","PeriodicalId":305639,"journal":{"name":"First International Conference on Broadband Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123917317","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":"Sinkhole intrusion indicators in DSR MANETs","authors":"B. J. Culpepper, H. Tseng","doi":"10.1109/BROADNETS.2004.77","DOIUrl":"https://doi.org/10.1109/BROADNETS.2004.77","url":null,"abstract":"Due to fundamental characteristics, routing protocols in wireless mobile ad hoc networks (MANETs) are particularly vulnerable to attack. One such attack, the \"sinkhole\" problem, is analyzed in the context of the dynamic source routing (DSR) protocol, and a sinkhole intrusion detection system (SIDS) is proposed for detecting it. The design and evaluation of this system is rigorously detailed, its performance is evaluated, and directions for future work are outlined. The simulation results show that SIDS is a promising methodology for this important problem.","PeriodicalId":305639,"journal":{"name":"First International Conference on Broadband Networks","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124028964","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":"Handheld routers: intelligent bandwidth aggregation for mobile collaborative communities","authors":"P. Sharma, Sung-Ju Lee, Jack Brassil, K. Shin","doi":"10.1109/BROADNETS.2004.43","DOIUrl":"https://doi.org/10.1109/BROADNETS.2004.43","url":null,"abstract":"Multi-homed, mobile wireless computing and communication devices can spontaneously form communities to logically combine and share the bandwidth of each other's wide-area communication links using inverse multiplexing. But membership in such a community can be highly dynamic, as devices and their associated WAN links randomly join and leave the community. We identify the issues and tradeoffs faced in designing a decentralized inverse multiplexing system in this challenging setting, and determine precisely how heterogeneous WAN links should be characterized, and when they should be added to, or deleted from, the shared pool. We then propose methods of choosing the appropriate channels on which to assign newly-arriving application flows. Using video traffic as a motivating example, we demonstrate how significant performance gains can be realized by adapting allocation of the shared WAN channels to specific application requirements. Our simulation and experimentation results show that collaborative bandwidth aggregation systems are, indeed, a practical and compelling means of achieving high-speed Internet access for groups of wireless computing devices beyond the reach of public or private access points.","PeriodicalId":305639,"journal":{"name":"First International Conference on Broadband Networks","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130243207","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. Shenai, M. Venkatachalam, C. Maciocco, K. Sivalingam
{"title":"Threshold based selective survivability for optical WDM mesh networks","authors":"R. Shenai, M. Venkatachalam, C. Maciocco, K. Sivalingam","doi":"10.1109/BROADNETS.2004.86","DOIUrl":"https://doi.org/10.1109/BROADNETS.2004.86","url":null,"abstract":"This paper presents survivability mechanisms that attempt to improve the overall restoration efficiency of dynamic link restoration in optical WDM mesh networks. The proposed mechanisms make use of network state information such as link load in order to identify critical network sections (such as links or segments) that are subsequently protected by selectively assigning backup capacity ahead of failures. The first approach, termed \"threshold based selective link restoration\", utilizes existing link load information to identify critical links, and the second approach, termed \"threshold based selective segment restoration\", employs data-analysis techniques to identify critical segments. The overall goal of the proposed algorithms is to improve the restoration efficiency by providing a trade-off between proactive protection and reactive restoration. The experimental results indicate that under high loads, the proposed approaches maintain a consistent restoration efficiency that is at least 10% when compared to dynamic restoration.","PeriodicalId":305639,"journal":{"name":"First International Conference on Broadband Networks","volume":"356 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122174487","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":"Power save mechanisms for multi-hop wireless networks","authors":"Matthew J. Miller, N. Vaidya","doi":"10.1109/BROADNETS.2004.67","DOIUrl":"https://doi.org/10.1109/BROADNETS.2004.67","url":null,"abstract":"In this paper, we discuss power save mechanisms that allow hosts to go to sleep to conserve energy. When sleeping hosts need to receive packets from other hosts, these hosts must somehow wake up the sleeping hosts. The paper discusses a busy-tone mechanism for this purpose, and an approach to improve the mechanism by using multiple busy tones. We generalize this protocol to develop the notion of multi-level power save mechanisms, and present some examples to illustrate this notion.","PeriodicalId":305639,"journal":{"name":"First International Conference on Broadband Networks","volume":"137 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122855572","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}
V. Paruchuri, S. Basavaraju, A. Durresi, R. Kannan, S. Iyengar
{"title":"Random asynchronous wakeup protocol for sensor networks","authors":"V. Paruchuri, S. Basavaraju, A. Durresi, R. Kannan, S. Iyengar","doi":"10.1109/BROADNETS.2004.71","DOIUrl":"https://doi.org/10.1109/BROADNETS.2004.71","url":null,"abstract":"This paper presents a random asynchronous wakeup (RAW), a power saving technique for sensor networks that reduces energy consumption without significantly affecting the latency or connectivity of the network. RAW builds on the observation that when a region of a shared-channel wireless network has a sufficient density of nodes, only a small number of them need be active at any time to forward the traffic for active connections. RAW is a distributed, randomized algorithm where nodes make local decisions on whether to sleep, or to be active. Each node is awake for a randomly chosen fixed interval per time frame. High node density results in existence of several paths between two given nodes whose path length and delay characteristics are similar to the shortest path. Thus, a packet can be forwarded to any of several nodes in order to be delivered to the destination without affecting much the path length and delay experienced by the packet as compared to forwarding the packet through the shortest path. The improvement in system lifetime, due to RAW, increases as the ratio of idle-to-sleep energy consumption increases, and as the density of the network increases. Through analytical and experimental evaluations, we show that RAW improves communication latency and system lifetime compared to current schemes.","PeriodicalId":305639,"journal":{"name":"First International Conference on Broadband Networks","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123823706","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":"Crosstalk-aware wavelength assignment in dynamic wavelength-routed optical networks","authors":"Tao Deng, S. Subramaniam, Jinghao Xu","doi":"10.1109/BROADNETS.2004.26","DOIUrl":"https://doi.org/10.1109/BROADNETS.2004.26","url":null,"abstract":"In-band crosstalk has been widely considered as a major transmission impairment that significantly impacts the BER (bit error rate) performance of lightpaths in circuit-switched all-optical wavelength-routed networks. Such crosstalk usually occurs when multiple lightpaths occupying identical or adjacent wavelengths pass through an optical crossconnect node. Traditional WA (wavelength assignment) schemes pay little regard to the physical layer QoS (quality of service), and hence cannot provide optimized network performance in practice. In this paper, we propose four crosstalk-aware WA algorithms as variations of the well-known first-fit, random-pick, most-used and least-used schemes, with the crosstalk factor taken into consideration. Simulation results show that, independent of the network amplifier placement and the traffic, our WA algorithms can successfully suppress the in-band crosstalk throughout the network, and significantly decrease BER blocking rate.","PeriodicalId":305639,"journal":{"name":"First International Conference on Broadband Networks","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125792019","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":"Synchronous optical burst switching","authors":"S. Sheeshia, C. Qiao","doi":"10.1109/BROADNETS.2004.82","DOIUrl":"https://doi.org/10.1109/BROADNETS.2004.82","url":null,"abstract":"We introduce a new protocol based on the optical-burst-switched (OBS) transport to support synchronous services such as SONET/SDH. We term this protocol synchronous optical burst switching (SOBS) and describe the problems and challenges of supporting both synchronous and asynchronous traffic with various bandwidth granularities. We discuss the problems of path signaling, periodic reservations, and burst framing. We also highlight the importance of burst-level grooming, develop related analytical formulations, and present results of various simulations.","PeriodicalId":305639,"journal":{"name":"First International Conference on Broadband Networks","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115977120","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 10/7 + /spl epsi/ approximation for minimizing the number of ADMs in SONET rings","authors":"M. Shalom, S. Zaks","doi":"10.1109/BROADNETS.2004.1","DOIUrl":"https://doi.org/10.1109/BROADNETS.2004.1","url":null,"abstract":"SONET ADMs are dominant cost factors in WDM/SONET rings. Whereas most previous papers on the topic concentrated on the number of wavelengths assigned to a given set of lightpaths, more recent papers argue that the number of ADMs is a more realistic cost measure. Some of these works discuss various heuristic algorithms for this problem, and the best known result is a 3/2 approximation in G. Calinescu and P.J. Wan (2001). Through the study of the relation between this problem and the problem of finding maximum disjoint rings in a given set of lightpaths we manage to shed more light onto this problem and to develop a 10/7 + /spl epsi/ approximation for it.","PeriodicalId":305639,"journal":{"name":"First International Conference on Broadband Networks","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122331768","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}