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

筛选
英文 中文
Wavelength Assignment in Optical Networks with Imprecise Network State Information 网络状态信息不精确的光网络中的波长分配
2006 3rd International Conference on Broadband Communications, Networks and Systems Pub Date : 2006-10-01 DOI: 10.1109/BROADNETS.2006.4374394
S. Ahuja, M. Krunz, S. Ramasubramanian
{"title":"Wavelength Assignment in Optical Networks with Imprecise Network State Information","authors":"S. Ahuja, M. Krunz, S. Ramasubramanian","doi":"10.1109/BROADNETS.2006.4374394","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374394","url":null,"abstract":"Efficient routing and wavelength assignment (RWA) in wavelength-routed all-optical networks is critical for achieving high efficiency over the backbone links. Extensive research has been conducted to find strategies to solve the RWA problem with exact network state available at the time of path selection. We consider the problem of minimizing the blocking probability in an all-optical network with partial wavelength conversion and with imprecise network state information. We model imprecision in link-state information (wavelength availability) probabilistically and use Markovian analysis to predict the availability of each link based on its previous advertisement and the estimated average traffic over the link. The estimated probabilities are then used to find the most probable path between a source destination pair. We also consider the problem of lightpath establishment with 1+1 protection. We use the same Markovian model to predict the link availability and then use the probabilistic estimate and a modified version of flow algorithm to find two link-disjoint paths between the source and destination. Simulations are conducted to compare the performance of random-fit and the proposed wavelength assignment schemes. We have also performed extensive simulations to study the performance of the proposed flow algorithm. It is observed that the proposed wavelength assignment scheme performs significantly better in terms of blocking probability than conventional wavelength assignment schemes.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"171 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":"132480224","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}
引用次数: 0
Efficient Integration of Web Services in Ambient-aware Sensor Network Applications 环境感知传感器网络应用中Web服务的高效集成
Isaac Amundson, Manish Kushwaha, X. Koutsoukos, S. Neema, J. Sztipanovits
{"title":"Efficient Integration of Web Services in Ambient-aware Sensor Network Applications","authors":"Isaac Amundson, Manish Kushwaha, X. Koutsoukos, S. Neema, J. Sztipanovits","doi":"10.4108/basenets.2006.5","DOIUrl":"https://doi.org/10.4108/basenets.2006.5","url":null,"abstract":"Sensor Webs are heterogeneous collections of sensor devices that collect information and interact with the environment. They consist of wireless sensor networks that are ensembles of small, smart, and cheap sensing and computing devices that permeate the environment as well as high-bandwidth rich sensors such as satellite imaging systems, meteorological stations, air quality stations, and security cameras. Emergency response, homeland security, and many other applications have a very real need to interconnect such diverse networks and access information in real-time. While Internet protocols and Web standards provide well-developed mechanisms for accessing this information, linking such mechanisms with resource-constrained sensor networks is very challenging because of the volatility of the communication links. This paper presents a service-oriented programming model for sensor networks which permits discovery and access of Web services. Sensor network applications are realized as graphs of modular and autonomous services with well-defined interfaces that allow them to be described, published, discovered, and invoked over the network providing a convenient way for integrating services from heterogeneous sensor systems. Our approach provides dynamic discovery, composition, and binding of services based on an efficient localized constraint satisfaction algorithm that can be used for developing ambient-aware applications that adapt to changes in the environment. A tracking application that employs many inexpensive sensor nodes, as well as a Web service, is used to illustrate the approach. Our results demonstrate the feasibility of ambient-aware applications that interconnect wireless sensor networks and Web services.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"14 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":"133944862","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}
引用次数: 22
Minimum Rejection Scheduling in All-Photonic Networks 全光子网络中的最小拒绝调度
2006 3rd International Conference on Broadband Communications, Networks and Systems Pub Date : 2006-10-01 DOI: 10.1109/BROADNETS.2006.4374357
N. Saberi, M. Coates
{"title":"Minimum Rejection Scheduling in All-Photonic Networks","authors":"N. Saberi, M. Coates","doi":"10.1109/BROADNETS.2006.4374357","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374357","url":null,"abstract":"Internal switches in all-photonic networks do not perform data conversion into the electronic domain, thereby eliminating a potential capacity bottleneck, but the inability to perform efficient optical buffering introduces network scheduling challenges. In this paper we focus on the problem of scheduling fixed-length frames in all-photonic star-topology networks with the goal of minimizing rejected demand. We formulate the task as an optimization problem and characterize its complexity. We describe the minimum rejection algorithm (MRA), which minimizes total rejection, and demonstrate that the fair matching algorithm (FMA) minimizes the maximum percentage rejection of any connection. We analyze through OPNET simulation the rejection and delay performance.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"34 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":"131731286","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}
引用次数: 10
A Study on Vertical Handoff for Integrated WLAN and WWAN with Micro-Mobility Prediction 基于微移动性预测的WLAN和WWAN集成垂直切换研究
2006 3rd International Conference on Broadband Communications, Networks and Systems Pub Date : 2006-10-01 DOI: 10.1109/BROADNETS.2006.4374352
P. Ho, Y. Wang, Fen Hou, Xuemin Shen
{"title":"A Study on Vertical Handoff for Integrated WLAN and WWAN with Micro-Mobility Prediction","authors":"P. Ho, Y. Wang, Fen Hou, Xuemin Shen","doi":"10.1109/BROADNETS.2006.4374352","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374352","url":null,"abstract":"The integration of the third generation (3G) wireless wide-area networks (WWAN) and the IEEE 802.11 wireless local-area networks (WLAN) has drawn much attention from both industry and academia. To achieve an effective and efficient integration between the two networks with very different characteristics, nonetheless, is still an open issue. One of the challenges is to provide an integrated strategy for achieving a seamless vertical handoff of mobile users roaming between the two network domains where the delay, delay jitter, and packet loss probability can be well controlled. This paper is committed to study a two-step vertical handoff mechanism based on linear regression which is further modeled through an analytical approach. The proposed vertical handoff scheme is characterized by its adaptability to different quality of service (QoS) requirements by manipulating a threshold on the expected handoff instant. A new approach of mobility analysis is introduced to facilitate modeling of vertical handoff delay by taking advantage of Markov chain techniques. We have seen merits gained in our scheme in achieving a good trade-off between the average handoff delay and the multi-tunnel time by manipulating a threshold value, where both analytical and simulation results prove the effectiveness.","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":"131252371","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}
引用次数: 13
Robust Demand-Driven Video Multicast over Ad hoc Wireless Networks 基于自组织无线网络的鲁棒需求驱动视频多播
2006 3rd International Conference on Broadband Communications, Networks and Systems Pub Date : 2006-10-01 DOI: 10.1109/BROADNETS.2006.4374398
Devesh Agrawal, T. B. Reddy, C. Murthy
{"title":"Robust Demand-Driven Video Multicast over Ad hoc Wireless Networks","authors":"Devesh Agrawal, T. B. Reddy, C. Murthy","doi":"10.1109/BROADNETS.2006.4374398","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374398","url":null,"abstract":"In this paper, we address the problem of video multicasting in ad hoc wireless networks. The salient characteristics of video traffic make conventional multicasting protocols perform quite poorly, hence warranting application-centric approaches in order to increase robustness to packet losses and lower the overhead. By exploiting the path-diversity and the error resilience properties of multiple description coding (MDC), we propose a robust demand-driven video multicast routing (RDVMR) protocol. Our protocol uses a novel path based Steiner tree heuristic to reduce the number of forwarders in each tree, and constructs multiple trees in parallel with reduced number of common nodes among them. Moreover, unlike other on-demand multicast protocols, RDVMR specifically attempts to reduce the periodic (non on-demand) control traffic. We extensively evaluate RDVMR in the NS2 simulation framework and show that it outperforms existing single-tree and two-tree multicasting protocols.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"9 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":"115356080","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}
引用次数: 29
The Design and Demonstration of the Ultralight Testbed 超轻型试验台的设计与论证
2006 3rd International Conference on Broadband Communications, Networks and Systems Pub Date : 2006-10-01 DOI: 10.1109/BROADNETS.2006.4374312
H. Newman, D. Bourilkov, J. Bunn, R. Cavanaugh, I. Legrand, S. Low, S. McKee, D. Nae, S. Ravot, C. Steenberg, X. Su, Michael Thomas, F. V. Lingen, Yang Xia
{"title":"The Design and Demonstration of the Ultralight Testbed","authors":"H. Newman, D. Bourilkov, J. Bunn, R. Cavanaugh, I. Legrand, S. Low, S. McKee, D. Nae, S. Ravot, C. Steenberg, X. Su, Michael Thomas, F. V. Lingen, Yang Xia","doi":"10.1109/BROADNETS.2006.4374312","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374312","url":null,"abstract":"In this paper we present the motivation, the design, and a recent demonstration of the UltraLight testbed at SC|05. The goal of the Ultralight testbed is to help meet the data-intensive computing challenges of the next generation of particle physics experiments with a comprehensive, network- focused approach. UltraLight adopts a new approach to networking: instead of treating it traditionally, as a static, unchanging and unmanaged set of inter-computer links, we are developing and using it as a dynamic, configurable, and closely monitored resource that is managed from end-to-end. To achieve its goal we are constructing a next-generation global system that is able to meet the data processing, distribution, access and analysis needs of the particle physics community. In this paper we will first present early results in the various working areas of the project. We then describe our experiences of the network architecture, kernel setup, application tuning and configuration used during the bandwidth challenge event at SC|05. During this Challenge, we achieved a record-breaking aggregate data rate in excess of 150 Gbps while moving physics datasets between many Grid computing sites.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"36 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":"117184108","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}
引用次数: 0
Jitter-based analysis and discussion of burst assembly algorithms 基于抖动的突发装配算法分析与讨论
2006 3rd International Conference on Broadband Communications, Networks and Systems Pub Date : 2006-10-01 DOI: 10.1109/BROADNETS.2006.4374331
J. Aracil, J. Hernández, K. Vlachos, Emmanouel Varvarigos
{"title":"Jitter-based analysis and discussion of burst assembly algorithms","authors":"J. Aracil, J. Hernández, K. Vlachos, Emmanouel Varvarigos","doi":"10.1109/BROADNETS.2006.4374331","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374331","url":null,"abstract":"This work provides a jitter analysis of size-based burst assembly algorithms and also discusses other burst assembly algorithms that use the packet delay as the assembly threshold to provide a bound on jitter.","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":"125798623","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}
引用次数: 0
Evaluation of OCDM-Switching and Code Conversion for All-Optical End-to-End Path Provisioning in Multi-granularity Networks 多粒度网络中全光端到端路径配置的ocdm交换和码转换评估
2006 3rd International Conference on Broadband Communications, Networks and Systems Pub Date : 2006-10-01 DOI: 10.1109/BROADNETS.2006.4374417
Shaowei Huang, K. Baba, M. Murata, K. Kitayama
{"title":"Evaluation of OCDM-Switching and Code Conversion for All-Optical End-to-End Path Provisioning in Multi-granularity Networks","authors":"Shaowei Huang, K. Baba, M. Murata, K. Kitayama","doi":"10.1109/BROADNETS.2006.4374417","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374417","url":null,"abstract":"In this paper, an OCDM-based multi- granularity optical cross-connect (MG-OXC) is proposed to enable the optical path switching in bandwidth granularity finer than the wavelength-based path. Such an optical path switched by OCDM-based MG-OXC is called OCDM label-switched path (OCDM-LSP), which is capable of hybrid optical code (OC)/wavelength conversion along the path from a source to destination. With distinct OCs, OCDM-LSPs can share a single wavelength without any synchronization mechanism and be discriminated by ultra- fast optical correlation. The asynchronous ability and OC conversion distinguish the OCDM-LSP from Packet-LSP or TDM-LSP in resolving granularity problem in wavelength- based path. Based upon our proposal, all-optical optical path provisioning including F-LSP, WB-LSP, L-LSP and OCDM- LSP can be realized in the transport layer. Simulation is conducted and the results show the proposed OCDM-switching has gained a 2 order of blocking probability reduction even though only 5 OCs are employed. Furthermore, OC conversion in OCDM-LSP is proved to be another benefit for high flexibility in optical path provisioning and blocking performance improvement comparing to TDM-LSP.","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":"129848893","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}
引用次数: 7
TeraPaths: End-to-End Network Path QoS Configuration Using Cross-Domain Reservation Negotiation terapath:端到端网络路径QoS配置,采用跨域预留协商
2006 3rd International Conference on Broadband Communications, Networks and Systems Pub Date : 2006-10-01 DOI: 10.1109/BROADNETS.2006.4374426
B. Gibbard, D. Katramatos, Dantong Yu, S. McKee
{"title":"TeraPaths: End-to-End Network Path QoS Configuration Using Cross-Domain Reservation Negotiation","authors":"B. Gibbard, D. Katramatos, Dantong Yu, S. McKee","doi":"10.1109/BROADNETS.2006.4374426","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374426","url":null,"abstract":"TeraPaths is a DOE MICS/SciDAC-fundedproject conceived to address the needs of the high energy and nuclear physics scientific community for effectively protecting data flows of various levels of priority through modern high-speed networks. TeraPaths is rapidly evolving from a last-mile, LAN QoS provider to a distributed end-to-end network path QoS negotiator through multiple administrative domains. Developed as a web service-based software system, TeraPaths automates the establishment of network paths with QoS guarantees between end sites by configuring their corresponding LANs and requesting MPLS paths through WANs on behalf of end users. The primary mechanism for the creation of such paths is the negotiation and placement of advance reservations across all involved domains. This paper describes the status of the project, our experiences so far, as well as the directions of our continued work.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"16 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":"125437554","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}
引用次数: 26
A New Approach to Loss-Free Packet/Burst Transmission in All-Optical Networks 全光网络中无丢包/突发传输的新方法
2006 3rd International Conference on Broadband Communications, Networks and Systems Pub Date : 2006-10-01 DOI: 10.1109/BROADNETS.2006.4374319
A. Agusti-Torra, C. Cervelló-Pastor, M. A. Fiol
{"title":"A New Approach to Loss-Free Packet/Burst Transmission in All-Optical Networks","authors":"A. Agusti-Torra, C. Cervelló-Pastor, M. A. Fiol","doi":"10.1109/BROADNETS.2006.4374319","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374319","url":null,"abstract":"This work introduces a new approach to get loss-free burst/packet transmission in optical burst and packet switched networks. To this end, our proposal defines (1) a routing and wavelength assignment (RWA) scheme based on the concept of wavelength tree, and (2) a simple contention resolution mechanism that solves contention using a limited number of fiber delay lines. We show that using the proposed scheme, for a 2-link-connected network with n nodes, there exists communication between any pair of nodes with [n/2] wavelengths. We apply this approach to address the problem of finding (conflict-free) transmission schemes in iterated line digraphs. Such digraphs have proved to be very useful models for dense, easily mutable, and fault tolerant communication networks. Examples of such networks are the well-known De Bruijn and Kautz digraphs and the wrapped butterfly networks. Our study leads us to define a useful tool for obtaining wavelength trees. By way of example, we illustrate the scheme operation for the 2-regular Kautz digraph. Simulation results show a good behavior in terms of transmission delay and resources utilization.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"1218 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113994829","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}
引用次数: 8
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信