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

筛选
英文 中文
Power control for interference mitigation between coexisting UWB systems 共存超宽带系统间的干扰控制
2006 3rd International Conference on Broadband Communications, Networks and Systems Pub Date : 2006-10-01 DOI: 10.1109/BROADNETS.2006.4374365
Yongjing Zhang, Haitao Wu, Qian Zhang, Ping Zhang
{"title":"Power control for interference mitigation between coexisting UWB systems","authors":"Yongjing Zhang, Haitao Wu, Qian Zhang, Ping Zhang","doi":"10.1109/BROADNETS.2006.4374365","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374365","url":null,"abstract":"In this paper, we investigate the coexistence issue of two type of ultra-wideband (UWB) systems under IEEE 802.15.3a, i.e. Direct-Sequence UWB and MultiBand-Orthogonal Frequency Division Multiplexing UWB. The mutual interference of such coexistence scenarios is analyzed by physical layer Monte Carlo simulations. We observe severe and asymmetric performance degradation due to the mutual interference between the two systems. Therefore, we propose the goodput-oriented utility-based transmit power control (GUTPC) algorithm to improve the performance. The feasible condition and the convergence property of GUTPC are investigated, and the choice of the coefficients is discussed for fairness and efficiency. Numerical results demonstrate that GUTPC improves the goodput of the coexisting systems effectively and fairly.","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":"115435866","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}
引用次数: 1
Performance Evaluation of Mobile Ad Hoc Networks In the Presence of Energy-based Selfishness 能量自私自利下移动自组网的性能评价
2006 3rd International Conference on Broadband Communications, Networks and Systems Pub Date : 2006-10-01 DOI: 10.1109/BROADNETS.2006.4374408
Ehsan Ataie, A. Movaghar
{"title":"Performance Evaluation of Mobile Ad Hoc Networks In the Presence of Energy-based Selfishness","authors":"Ehsan Ataie, A. Movaghar","doi":"10.1109/BROADNETS.2006.4374408","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374408","url":null,"abstract":"Cooperation of nodes for routing and packet forwarding is inevitable in a mobile ad hoc network. Selfishness in such networks is a significant challenge and can cause network performance to noticeably degrade. In this paper, we propose some new selfishness models elicited from psychological behavior of human beings. We also evaluate performance of MANET in the presence of different percentages of selfish nodes that act based on our selfishness models. Results show that energy-based selfishness is a serious problem that could affect performance depends on mobility of nodes, density of network, and time of simulation. This kind of selfishness needs a comprehensive mechanism to cope with and we have planned to publish such mechanism in early future.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"40 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":"116713852","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
Segment-Based Partial Protection Scheme for Routing Reliability Guaranteed Connections in WDM Optical Networks WDM光网络中路由可靠性保证连接的分段部分保护方案
2006 3rd International Conference on Broadband Communications, Networks and Systems Pub Date : 2006-10-01 DOI: 10.1109/BROADNETS.2006.4374321
C. Saradhi, G. Mohan, Luying Zhou
{"title":"Segment-Based Partial Protection Scheme for Routing Reliability Guaranteed Connections in WDM Optical Networks","authors":"C. Saradhi, G. Mohan, Luying Zhou","doi":"10.1109/BROADNETS.2006.4374321","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374321","url":null,"abstract":"In this paper, we consider the reliability of a connection as a parameter to denote different levels of fault- tolerance and propose a segment-based partial protection scheme for routing reliability-guaranteed connections in a resource efficient manner. In this scheme we try to provide a partial protection path instead of an end-to-end protection path to improve the reliability of a connection. To provide partial protection path, we need to identify primary segments which are less (more) reliable (vulnerable) to failures and select a suitable primary segment to provide a protection segment. However, identifying less-reliable primary segments which really contribute to achieve the required reliability and selection of resource-efficient protection segment among several possible segments are not trivial problems. In this paper, we develop efficient methods to address these problems. Apart from providing the reliability guarantee, the proposed scheme is able to recover all failures immediately, except the failures which are not covered by the protection segment. In this case the failed connections cannot be rerouted on to the protection segment and we initiate our proposed recovery process which handles all possible failure scenarios. We conduct extensive simulation experiments to evaluate the effectiveness of the proposed scheme on different network configurations with respect to three performance metrics: average spare wavelength usage, average recovery time, and average recovery ratio.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"11 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":"116097940","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
Traffic Engineering and Restoration in Optical Packet Switching Networks by means of Ant Colony Optimization 基于蚁群优化的光分组交换网络流量工程与恢复
2006 3rd International Conference on Broadband Communications, Networks and Systems Pub Date : 2006-10-01 DOI: 10.1109/BROADNETS.2006.4374329
G. S. Pavani, H. Waldman
{"title":"Traffic Engineering and Restoration in Optical Packet Switching Networks by means of Ant Colony Optimization","authors":"G. S. Pavani, H. Waldman","doi":"10.1109/BROADNETS.2006.4374329","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374329","url":null,"abstract":"In this paper, we propose an ACO-based algorithm that can adaptively balance the network load to mitigate congestion, and hence reduce the overall loss of packets in an OPS network. In addition, the proposed algorithm is fault-tolerant, with the recovery from a failed link or node starting even before detection and localization of the failure event. Since both routing and restoration rely on pheromone levels laid by ant-like agents, any failure will be promptly perceived by some ants, which will then try to circumvent the affected part of the network, thus adapting the routing to the new topology.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"20 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":"124972697","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}
引用次数: 24
Routing and Wavelength Assignment for Prioritized Demands Under a Scheduled Traffic Model 调度流量模型下优先需求的路由和波长分配
2006 3rd International Conference on Broadband Communications, Networks and Systems Pub Date : 2006-10-01 DOI: 10.1109/BROADNETS.2006.4374414
A. Jaekel, Ying Chen
{"title":"Routing and Wavelength Assignment for Prioritized Demands Under a Scheduled Traffic Model","authors":"A. Jaekel, Ying Chen","doi":"10.1109/BROADNETS.2006.4374414","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374414","url":null,"abstract":"In the scheduled traffic model, the design problem is to allocate resources to a set of demands whose setup and teardown times are known in advance. A number of integer linear program (ILP) solutions for this problem have been presented in the literature. In this paper we present a new ILP formulation for routing and wavelength allocation, under the scheduled traffic model that minimizes the congestion of the network. We propose two levels of service, where idle backup resources can be used to carry low priority traffic, under fault-free conditions. When a fault occurs, and resources for a backup path need to be reclaimed, any low priority traffic on the affected channels is dropped. The results demonstrate that this can lead to significant improvements over single service level models. We are able to generate optimal solutions for moderate sized networks, within a reasonable amount of time. Finally, we present a simple and fast heuristic that can quickly generate good solutions for much larger networks.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"31 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":"129656648","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}
引用次数: 15
Data-driven traffic engineering: techniques, experiences and challenges 数据驱动交通工程:技术、经验和挑战
2006 3rd International Conference on Broadband Communications, Networks and Systems Pub Date : 2006-10-01 DOI: 10.1109/BROADNETS.2006.4374362
M. Johansson, A. Gunnar
{"title":"Data-driven traffic engineering: techniques, experiences and challenges","authors":"M. Johansson, A. Gunnar","doi":"10.1109/BROADNETS.2006.4374362","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374362","url":null,"abstract":"This paper presents a global view of measurement-driven traffic engineering, explores the interplay between traffic matrix estimation and routing optimization and demonstrates how demand uncertainties can be accounted for in the optimization step to guarantee a robust and reliable result. Based on a unique data set of complete measured traffic matrices, we quantify the demand uncertainties in an operational IP network and demonstrate how a number of robust optimization schemes allow to find fixed MPLS configurations that are close to the performance limits given by time-varying routing under full demand knowledge. We present a novel scheme for computing a sparse MPLS mesh to complement a baseline routing, and explore how the performance depends on the size of the partial mesh. Corresponding methods for robust OSPF optimization are discussed and a number of challenges are detailed.","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":"116200169","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}
引用次数: 25
On Traffic Grooming Choices for IP over WDM networks 基于WDM网络的IP流量疏导选择
2006 3rd International Conference on Broadband Communications, Networks and Systems Pub Date : 2006-10-01 DOI: 10.1109/BROADNETS.2006.4374410
Srivatsan Balasubramanian, Arun Kumar Somani
{"title":"On Traffic Grooming Choices for IP over WDM networks","authors":"Srivatsan Balasubramanian, Arun Kumar Somani","doi":"10.1109/BROADNETS.2006.4374410","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374410","url":null,"abstract":"Traffic grooming continues to be a rich area of research in the context of WDM optical networks. We provide an overview of the optical and electronic grooming techniques available with focus on IP as the client layer. We discuss the various architectural alternatives available: peer, overlay and augmented models. We first provide a survey on the research work in the area of traffic grooming in optical circuit switched networks. We then identify problems with electronic grooming in terms of high speed router design and bring out the merits of optical grooming. Next, we describe the shared wavelength optical network technology called light-trails and compare its performance with electronic grooming networks for both the peer and overlay models. Based on our simulations on random graphs of various diameters, we identify the threshold router speeds at which light-trails can compete with the electronic grooming solution for a given network scenario. We conclude that since the present router capacities are below the threshold speed or such routers are likely to remain expensive for some time, light-trails is an appealing candidate solution.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"44 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":"125686895","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
Design considerations for photonic routers supporting application-driven bandwidth reservations at sub-wavelength granularity 支持应用驱动的亚波长粒度带宽保留的光子路由器的设计考虑
2006 3rd International Conference on Broadband Communications, Networks and Systems Pub Date : 2006-10-01 DOI: 10.1109/BROADNETS.2006.4374333
D. Simeonidou, G. Zervas, R. Nejabati
{"title":"Design considerations for photonic routers supporting application-driven bandwidth reservations at sub-wavelength granularity","authors":"D. Simeonidou, G. Zervas, R. Nejabati","doi":"10.1109/BROADNETS.2006.4374333","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374333","url":null,"abstract":"This paper presents hybrid optical router architectures (both edge and core) to support user-defined bandwidth reservations for emerging and evolving applications over wavelength channels (circuit), optical bursts or even optical packets. The edge router is based on the deployment of application-aware IP packet classification and burst/packet aggregation algorithms as well as agile and intelligent optical resource allocation. The mechanism is responsible for per application switching (OCS/OBS/OPS) service selection and Differentiated Service (DiffServ) provisioning. The optical core router can support all the abovementioned switching technologies. Both are generic and able to support any type of current or future application.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"10 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":"125724067","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
Proportional Service Differentiation for Multichannel Wireless Networks 多通道无线网络的比例业务分异
2006 3rd International Conference on Broadband Communications, Networks and Systems Pub Date : 2006-10-01 DOI: 10.1109/BROADNETS.2006.4374376
Sugam Pandey, Niranjan, A. Ganz
{"title":"Proportional Service Differentiation for Multichannel Wireless Networks","authors":"Sugam Pandey, Niranjan, A. Ganz","doi":"10.1109/BROADNETS.2006.4374376","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374376","url":null,"abstract":"In this paper, we propose multi-channel time division multiple access (MC/TDMA) scheme which provides proportional service differentiation while achieving high throughput in a multichannel wireless network. Proportional service differentiation is achieved by scheduling traffic over multiple non- overlapping channels using the modified open-shop scheduling problem analogy. This analogy allows us to use known optimal algorithms that have been previously developed for the open-shop scheduling problem. With extensive performance evaluation using OPNET simulator, we show that the proposed MC/TDMA scheme provides proportional service differentiation while achieving high throughput. To the best of our knowledge, this is the first work for provisioning proportional service differentiation in wireless networks using multiple channels.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"55 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":"121729750","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}
引用次数: 1
Quantifying the Impact of Wavelength Conversion on the Performance of Fiber Delay Line Buffers 量化波长转换对光纤延迟线缓冲器性能的影响
2006 3rd International Conference on Broadband Communications, Networks and Systems Pub Date : 2006-10-01 DOI: 10.1109/BROADNETS.2006.4374330
W. Rogiest, K. Laevens, D. Fiems, H. Bruneel
{"title":"Quantifying the Impact of Wavelength Conversion on the Performance of Fiber Delay Line Buffers","authors":"W. Rogiest, K. Laevens, D. Fiems, H. Bruneel","doi":"10.1109/BROADNETS.2006.4374330","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374330","url":null,"abstract":"We present a performance model for fiber delay line (FDL) buffers having access to multiple wavelengths on an output fiber. In optical burst switching and optical packet switching, contending bursts (or packets) need to be dealt with in an effective way, and both wavelength conversion and optical buffering are viable solutions. The buffer studied here includes both solutions, with full wavelength conversion. It is situated at the output, and handles independent arrivals. We apply an analytic discrete-time queueing model to evaluate performance in terms of loss. We mainly consider the impact of burst size (fixed or varying), scheduling policy, and buffer size. Several numerical examples assess the accuracy of our approximation, and show that our approach is applicable when burst sizes are fixed, and, when a round-robin scheduling policy is adopted, also when burst sizes vary.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"7 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113936140","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
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学术官方微信