J. Cheyns, E. V. Breusegem, D. Colle, M. Pickavet, P. Demeester, D. Winter
{"title":"Controlling LSPs in an ORION network","authors":"J. Cheyns, E. V. Breusegem, D. Colle, M. Pickavet, P. Demeester, D. Winter","doi":"10.1109/BROADNETS.2004.25","DOIUrl":"https://doi.org/10.1109/BROADNETS.2004.25","url":null,"abstract":"New networking paradigms try to combine packet switching and circuit switching, keeping the best of both worlds and getting rid of the drawbacks. One promising technology is overspill routing in optical networks (ORION). In this paper we develop a control technique to set up LSPs in this novel network environment. It is based on the GMPLS paradigm and needs no extra control messages.","PeriodicalId":305639,"journal":{"name":"First International Conference on Broadband Networks","volume":"19 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131894543","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}
L. Savastano, G. Maier, M. Martinelli, A. Pattavina
{"title":"Performance comparison of guided-wave architectures for space-division photonic switching","authors":"L. Savastano, G. Maier, M. Martinelli, A. Pattavina","doi":"10.1109/BROADNETS.2004.59","DOIUrl":"https://doi.org/10.1109/BROADNETS.2004.59","url":null,"abstract":"The paper presents and compares various unicast nonblocking architectures to be used into space-domain photonic switching networks. All the analyzed architectures have been evaluated and compared considering a possible physical implementation based on guided-wave structures realized with integrated optics technology. Some properties including number of switching elements required, blocking performance, number of waveguide crossovers, system attenuation, and signal-to-noise ratio are evaluated and analyzed. The main purpose of this work is to review the state-of-the-art of optical guided-wave space-switching architectures and to provide a relevant set of technical elements useful in the selection of architectures to be used in all-optical cross-connect implementation.","PeriodicalId":305639,"journal":{"name":"First International Conference on Broadband Networks","volume":"44 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":"121475535","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":"Distributed hybrid agent based intrusion detection and real time response system","authors":"Vaidehi Kasarekar, B. Ramamurthy","doi":"10.1109/BROADNETS.2004.33","DOIUrl":"https://doi.org/10.1109/BROADNETS.2004.33","url":null,"abstract":"Wireless LANs are growing rapidly and security has always been a concern. We have implemented a hybrid system, which does not only detect active attacks such as identity theft causing denial of service attacks, but also detects the usage of accesspoint discovery tools. The system responds in real time by sending out an alert to the network administrator.","PeriodicalId":305639,"journal":{"name":"First International Conference on Broadband Networks","volume":"145 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":"134027330","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 case for multipath multimedia transport over wireless ad hoc networks","authors":"Yihan Li, S. Mao, S. Panwar","doi":"10.1109/BROADNETS.2004.84","DOIUrl":"https://doi.org/10.1109/BROADNETS.2004.84","url":null,"abstract":"Real-time multimedia transport has stringent bandwidth, delay, and loss requirements. Supporting this application in current wireless ad hoc networks is a challenge. Such networks are characterized with frequent link failures, as well as congestion. Consequently, data packets are dropped when a link fails or congestion occurs, resulting in low received quality. In addition, a realtime multimedia service may be unavailable when a particular server is unreachable. In this article, we make the case for using multipath transport for realtime multimedia services in wireless ad hoc networks, which provides a unified solution to the above problems. We review existing work on multipath multimedia transport, and discuss the advantages, as well as related issues, of using multipath transport for realtime multimedia transport.","PeriodicalId":305639,"journal":{"name":"First International Conference on Broadband Networks","volume":"89 13 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":"129753164","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":"Efficient online traffic grooming algorithms in WDM mesh networks with drop-and-continue node architecture","authors":"F. Farahmand, Xiaodong Huang, J. Jue","doi":"10.1109/BROADNETS.2004.37","DOIUrl":"https://doi.org/10.1109/BROADNETS.2004.37","url":null,"abstract":"As high capacity all-optical networks and WDM technologies advance and merge together, aggregating low-speed traffic streams onto high-speed wavelengths becomes more critical. Efficient aggregation techniques, known as traffic grooming, allow higher bandwidth utilization and can reduce request blocking probability. These algorithms can also result in lower network cost in terms of electronic switching. In this paper we focus on traffic grooming in WDM mesh networks with dynamic traffic patterns. We offer two new grooming concepts called lightpath dropping and lightpath extension. These concepts are based on an alternative node architecture in which incoming optical signals can be dropped at a node, while optically continuing to the next node. Based on these concepts, we develop several grooming algorithms and study them under various network objectives. We also compare their performance with previously proposed lightpath-based grooming algorithms. Through extensive simulation results we show that our proposed approaches lead to lower request blocking probability and lower average number of logical hops when the number of transceivers per node is limited.","PeriodicalId":305639,"journal":{"name":"First International Conference on Broadband Networks","volume":"19 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":"125788679","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":"Multimedia traffic support for asynchronous ad hoc wireless networks","authors":"T. B. Reddy, B. S. Manoj, C. Murthy","doi":"10.1109/BROADNETS.2004.47","DOIUrl":"https://doi.org/10.1109/BROADNETS.2004.47","url":null,"abstract":"In this paper, we address the issue of providing multimedia traffic support in asynchronous ad hoc wireless networks. Since multimedia traffic has stringent bounds on end-to-end delay, we present a resource reservation for transmitting in such traffic. The existing asynchronous MAC protocols such as RTMAC (B.S. and C. Siva Ram Murthy, August 2002) and MACA/PR (C.R. Lin and M. Gerla, March 1999) when used for multimedia traffic provide inefficient utilization of network resources and affect call acceptance ratio and call drop ratio of multimedia traffic severely. Hence in this work, we modify the RTMAC protocol for supporting multimedia traffic so that it overcomes these limitations and improves packet delivery ratio and end-to-end delay of such traffic. The core concept of this protocol is a novel slot allocation strategy for efficient utilization of the available bandwidth for carrying multimedia traffic and best-effort traffic. Extensive simulations were performed to assess the performance of the protocol under varying network conditions. The simulations clearly indicate the gains in using such a slot allocation strategy for carrying multimedia traffic.","PeriodicalId":305639,"journal":{"name":"First International Conference on Broadband Networks","volume":"53 41 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":"127949976","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}
Yufeng Xin, Jing Teng, G. Karmous-Edwards, G. Rouskas, D. Stevenson
{"title":"Fault management with fast restoration for optical burst switched networks","authors":"Yufeng Xin, Jing Teng, G. Karmous-Edwards, G. Rouskas, D. Stevenson","doi":"10.1109/BROADNETS.2004.41","DOIUrl":"https://doi.org/10.1109/BROADNETS.2004.41","url":null,"abstract":"This paper studies the important fault management issue with focus on the fast restoration mechanisms for optical burst switched (OBS) networks. In order to reduce the burst losses during the restoration process, effective fast restoration schemes are necessary. This is illustrated via two basic fast restoration schemes, the distributed deflection scheme and the local deflection scheme, compared with the slow global routing update mechanism. A novel priority-based QoS restoration scheme is also proposed to provide differentiated restoration services. Through detailed descriptive analysis and a comprehensive simulation study, these fast restoration schemes demonstrate fast restoration process, low fault management overheads, and excellent burst loss performance. As far as we know, this is the first comprehensive study on the restoration mechanisms for OBS networks.","PeriodicalId":305639,"journal":{"name":"First International Conference on Broadband Networks","volume":"32 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":"126462290","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 decomposition approximation for the performance evaluation of non-preemptive priority in GSM/GPRS","authors":"S. Ghani, M. Schwartz","doi":"10.1109/BROADNETS.2004.3","DOIUrl":"https://doi.org/10.1109/BROADNETS.2004.3","url":null,"abstract":"Decomposition approximations in the past have been successfully applied to the performance analysis of preemptive priority based GSM/GPRS networks. In this paper, we propose a decomposition technique for the performance analysis of GSM/GPRS networks where GSM voice calls have non-preemptive priority over GPRS data packets. In other words, when demand exists for GSM circuit switched channels, the GPRS user can continue its transmission until the ending of packet transmission resulting in a delayed release of the channel. It is shown that such an approximation can be quite accurate in predicting both the impact of delayed release on GSM voice queuing as well as for comparison of immediate versus delayed release of channels on GPRS data queuing delays.","PeriodicalId":305639,"journal":{"name":"First International Conference on Broadband Networks","volume":"231 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":"115838419","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 efficient broadcast scheduling with delay deadlines","authors":"D. Rajan, A. Sabharwal, B. Aazhang","doi":"10.1109/BROADNETS.2004.66","DOIUrl":"https://doi.org/10.1109/BROADNETS.2004.66","url":null,"abstract":"In this paper, we present a framework for the design of minimal power schedulers that satisfy average packet delay bounds for multiple users in a Gaussian wireless broadcast channel. We completely characterize the achievable region in the multidimensional delay-power space, and present schedulers that achieve the boundary regions. The optimal schedulers minimize the transmission power by jointly allocating rate and power to the different users based on various buffer and channel conditions. Finally, we also present low complexity scheduler designs that have near optimal performance.","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":"130717630","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 load-balancing spare capacity reallocation approach in service-rich SONET metro mesh networks","authors":"Lu Shen, Xi Yang, B. Ramamurthy","doi":"10.1109/BROADNETS.2004.6","DOIUrl":"https://doi.org/10.1109/BROADNETS.2004.6","url":null,"abstract":"The next-generation SONET metro network is evolving into a service-rich infrastructure. At the edge of such a network, multi-service provisioning platforms (MSPPs) provide efficient data mapping enabled by generic framing procedure (GFP) and virtual concatenation (VC). The core of the network tends to be a meshed architecture equipped with multi-service switches (MSSs), In the context of these emerging technologies, we propose a load-balancing spare capacity reallocation approach to improve network utilization in the next-generation SONET metro networks. Using our approach, carriers can postpone network upgrades, resulting in increased revenue with reduced capital expenditures (CAPEX). For the first time, we consider the spare capacity reallocation problem from a capacity upgrade and network planning perspective. Our approach can operate in the context of shared-path protection (with backup multiplexing) because it reallocates spare capacity without disrupting working services. Unlike previous spare capacity reallocation approaches which aim at minimizing total spare capacity, our load-balancing approach minimizes the network load vector (NLV), which is a novel metric that reflects the network load distribution. Because NLV takes into consideration both uniform and non-uniform link capacity distribution, our approach can benefit both uniform and non-uniform networks. We develop a greedy load-balancing spare capacity reallocation (GLB-SCR) heuristic algorithm to implement this approach. Our experimental results show that GLB-SCR outperforms a previously proposed algorithm (SSR) in terms of established connection capacity and total network capacity in both uniform and non-uniform networks.","PeriodicalId":305639,"journal":{"name":"First International Conference on Broadband Networks","volume":"55 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":"124914980","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}