2006 3rd International Conference on Broadband Communications, Networks and Systems最新文献_第9页

UWB versus 802.11 - a Network Perspective UWB与802.11——网络视角

2006 3rd International Conference on Broadband Communications, Networks and Systems Pub Date : 2006-10-01 DOI: 10.1109/BROADNETS.2006.4374351

Gyouhwan Kim, A. Rajeswaran, R. Negi

引用次数: 7

A Study on Dynamic Survivable Routing with Availability Constraint for GMPLS-Based Recovery 基于gmpls的恢复中带可用性约束的动态存活路由研究

2006 3rd International Conference on Broadband Communications, Networks and Systems Pub Date : 2006-10-01 DOI: 10.1109/BROADNETS.2006.4374350

P. Ho, János Tapolcai, A. Haque

{"title":"A Study on Dynamic Survivable Routing with Availability Constraint for GMPLS-Based Recovery","authors":"P. Ho, János Tapolcai, A. Haque","doi":"10.1109/BROADNETS.2006.4374350","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374350","url":null,"abstract":"This paper introduces a new dynamic availability-aware survivable routing scheme under the framework of generalized multi-protocol label switching (GMPLS)-based recovery, which aims to achieve the best generality for the network operation in meeting the end-to-end (E2E) availability requirement of each connection. The paper first defines the partial restorability, justifies the feasibility of equipping a connection with partial restorability under the GMPLS control plane, and highlights the approach of evaluating the E2E availability for a pair of working and partially restorative SRG (shared risk group)-disjoint shared backup label switched paths (LSPs). A compact matrix expression is developed for modeling the minimum spare capacity along each link and the cost function for solving both of the paths. Based on the developed cost function, a novel integer linear program (ILP) is formulated to dynamically determine the working and backup LSPs of the corresponding connection request with the least amount of total capacity while the E2E availability requirement of the connection is met. We demonstrate that the model is general to the traffic uniformity, connection indivisibility, and working bandwidth restorability compared with the previous studies. Simulation is conducted to verify the proposed ILP model by making a comparison with a number of legacy schemes that achieve 100% restorability in facing a specific number of simultaneous failures, such as shared path protection (SPP), 1+1 protection, and dual-failure protection. In the case study, we have seen merits in the proposed algorithm by significantly reducing the required redundancy in the effort of achieving the given availability constraint for each connection request.","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":"132110959","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}

引用次数: 2

Secure Diffusion for Wireless Sensor Networks 无线传感器网络的安全扩散

2006 3rd International Conference on Broadband Communications, Networks and Systems Pub Date : 2006-10-01 DOI: 10.1109/BROADNETS.2006.4374317

Hao Yang, Starsky H. Y. Wong, Songwu Lu, Lixia Zhang

引用次数: 16

On the Use of Smart Antennas in Multi-Hop Wireless Networks 智能天线在多跳无线网络中的应用研究

2006 3rd International Conference on Broadband Communications, Networks and Systems Pub Date : 2006-10-01 DOI: 10.1109/BROADNETS.2006.4374412

K. Sundaresan, Sriram Lakshmanan, Raghupathy Sivakumar

{"title":"On the Use of Smart Antennas in Multi-Hop Wireless Networks","authors":"K. Sundaresan, Sriram Lakshmanan, Raghupathy Sivakumar","doi":"10.1109/BROADNETS.2006.4374412","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374412","url":null,"abstract":"Smart antennas include a broad range of antenna technologies ranging from the simple switched beam to the more sophisticated adaptive arrays and multiple input multiple output (MIMO) links. Their ability to exploit multiple degrees of freedom helps them operate in different strategies to achieve different objectives ranging from rate increase, range increase, transmission power reduction, and higher link reliability. While these antennas have been significantly researched at the PHY layer leading to results that are easily translatable to single-hop wireless networks, very little is understood about their use in multi-hop wireless ad-hoc networks. Specific unanswered questions in this context include: (i) what kind of performance improvements can the different technologies and their strategies provide? (ii) for each technology, which of the different possible strategies is the optimal strategy to employ for a given network condition? and (iii) for a given network setting, which of the different smart antenna technologies will deliver the best performance? In this paper, we systematically answer these questions by comprehensively evaluating the relative benefits of the different smart antenna technologies.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"175 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":"114072467","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}

引用次数: 9

Architecture and Performance of A Next-Generation Optical Burst Switch (OBS) 下一代光突发交换机(OBS)的结构与性能

2006 3rd International Conference on Broadband Communications, Networks and Systems Pub Date : 2006-10-01 DOI: 10.4108/wobs.2006.8

M. Anan, G. Chaudhry, D. Benhaddou

引用次数: 6

Trade-off between Reliability and Energy Cost for Content-Rich Data Transmission in Wireless Sensor Networks 无线传感器网络中富内容数据传输的可靠性与能耗权衡

2006 3rd International Conference on Broadband Communications, Networks and Systems Pub Date : 2006-10-01 DOI: 10.1109/BROADNETS.2006.4374313

Y. Charfi, N. Wakamiya, M. Murata

{"title":"Trade-off between Reliability and Energy Cost for Content-Rich Data Transmission in Wireless Sensor Networks","authors":"Y. Charfi, N. Wakamiya, M. Murata","doi":"10.1109/BROADNETS.2006.4374313","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374313","url":null,"abstract":"In wireless sensor networks, the power of energy- constrained sensor nodes is largely drained by data communication tasks. Designing energy-efficient data communication mechanisms is, therefore, a major key to maximizing the life-time of wireless sensor networks. This challenge is magnified for visual sensor networks, where the collected and transmitted data is often very large and composed of multiple signals (Infrared signals, audio, video, ...) which have different and varying quality of service requirements (QoS). Motivated by this challenge, we investigate a forward error correction recovery mechanism for multi-path data transmission in wireless sensor networks. Based on this mechanism, we propose a fast algorithm for the trade-off between the end-to-end energy cost and reliability requirement of multi-path data transmission. Under the practical considerations of a fixed transmission power and a realistic modulation scheme, we derive the reliability and expected energy cost metrics of transmission paths. We then demonstrate the efficiency of our algorithm through simulations and discuss future work.","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":"125844789","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}

引用次数: 16

Wavelength and Offset Window Assignment Schemes to Avoid Contention in OBS Rings 避免OBS环中争用的波长和偏移窗分配方案

2006 3rd International Conference on Broadband Communications, Networks and Systems Pub Date : 2006-10-01 DOI: 10.1109/BROADNETS.2006.4374375

A. Agusti-Torra, C. Cervelló-Pastor, M. A. Fiol

引用次数: 5

Approximating Optimal Survivable Scheduled Service Provisioning in WDM Optical Networks with Iterative Survivable Routing 基于可生存迭代路由的WDM光网络可生存计划业务供应逼近

2006 3rd International Conference on Broadband Communications, Networks and Systems Pub Date : 2006-10-01 DOI: 10.1109/BROADNETS.2006.4374348

Tianjian Li, Bin Wang

{"title":"Approximating Optimal Survivable Scheduled Service Provisioning in WDM Optical Networks with Iterative Survivable Routing","authors":"Tianjian Li, Bin Wang","doi":"10.1109/BROADNETS.2006.4374348","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374348","url":null,"abstract":"Survivable service provisioning design has emerged as one of the most important issues in communication networks in recent years. In this work, we study survivable service provisioning with shared protection under a scheduled traffic model in wavelength convertible WDM optical mesh networks. In this model, a set of demands is given, and the setup time and teardown time of a demand are known in advance. Based on different protection schemes used, this problem has been formulated as integer linear programs with different optimization objectives and constraints in our previous work [8, 9]. The problem is shown to be NP- hard. We therefore study time efficient approaches to approximating the optimal solution to the problem. Our proposed approach is based on an iterative survivable routing (ISR) scheme that utilizes a capacity provision matrix and processes demands sequentially using different demand scheduling policies. The objective is to minimize the total network resources (e.g., number of wavelength-links) used by working paths and protection paths of a given set of demands while 100% restorability is guaranteed against any single failure. The proposed algorithm is evaluated against solutions obtained by integer linear programming. Our simulation results indicate that the proposed ISR algorithm is extremely time efficient while achieving excellent performance in terms of total network resources used. The impact of demand scheduling policies on the ISR algorithm is also studied.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"6 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":"121417642","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}

引用次数: 17

On Controlling the Loss Rate in Optical Burst Switching Networks 光突发交换网络中损失率的控制

2006 3rd International Conference on Broadband Communications, Networks and Systems Pub Date : 2006-10-01 DOI: 10.1109/BROADNETS.2006.4374339

M. Jin, O. Yang

引用次数: 5

Triumph of the Bandwidth Commons: Elastic Reservations, Price Incentives, and Request Realignement in LambdaGrids 带宽公地的胜利:弹性保留、价格激励和lambdagrid中的请求重组

2006 3rd International Conference on Broadband Communications, Networks and Systems Pub Date : 2006-10-01 DOI: 10.1109/BROADNETS.2006.4374303

S. Naiksatam, S. Figueira, Stephen A. Chiappari

引用次数: 0