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

Optimal Bandwidth Allocation for Dynamically Priced Network Services 动态定价网络服务的最优带宽分配

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

Steven Shelford, G. Shoja, E. Manning

引用次数: 5

Loss Rate Estimation in General Topologies 一般拓扑中的损失率估计

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

Weiping Zhu

{"title":"Loss Rate Estimation in General Topologies","authors":"Weiping Zhu","doi":"10.1109/BROADNETS.2006.4374354","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374354","url":null,"abstract":"Loss tomography as a key component of network tomography receives considerable attention in recent years and a number of methods based on maximum likelihood estimate (MLE) and Bayesian estimate have been proposed. However, most methods proposed so far only target a treelike network, their application in practice is limited because of this. To overcome this limitation, we in this paper propose three estimation methods for networks with a general topology. We start our description from the tree structure and provide the insight into the connection between observations and loss rates, and present a closed form MLE that is obtained by solving a set of log-likelihood equations. In addition, a top down algorithm based on the closed form MLE is developed to estimate link-level loss rates from observation. Then, the closed form MLE is extended to cover a general topology consisting of a number of intersected trees. Finally, the three approximating methods, called modified weighted average, combine probe top down (CPTD) and hybrid bottom up and top down (IIBT), are proposed to estimate the loss rates of a general network. All algorithms proposed in this paper are analyzed mathematically and evaluated through simulations which show the efficiency and accuracy of the methods.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"44 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":"131832962","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}

引用次数: 5

Performance Evaluation of TCP Vegas over Optical Burst Switched Networks 光突发交换网络中TCP Vegas的性能评价

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

B. Shihada, Qiong Zhang, P. Ho

引用次数: 4

A Statistical Approach to Anomaly Detection in Interdomain Routing 域间路由异常检测的统计方法

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

S. Deshpande, M. Thottan, T. Ho, B. Sikdar

{"title":"A Statistical Approach to Anomaly Detection in Interdomain Routing","authors":"S. Deshpande, M. Thottan, T. Ho, B. Sikdar","doi":"10.1109/BROADNETS.2006.4374397","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374397","url":null,"abstract":"A number of events such as hurricanes, earthquakes, power outages can cause large-scale failures in the Internet. These in turn cause anomalies in the interdomain routing process. The policy-based nature of border gateway protocol (BGP) further aggravates the effect of these anomalies causing severe, long lasting route fluctuations. In this work we propose an architecture for anomaly detection that can be implemented on individual routers. We use statistical pattern recognition techniques for extracting meaningful features from the BGP update message data. A time-series segmentation algorithm is then carried out on the feature traces to detect the onset of an instability event The performance of the proposed algorithm is evaluated using real Internet trace data. We show that instabilities triggered by events like router mis-configurations, infrastructure failures and worm attacks can be detected with a false alarm rate as low as 0.0083 alarms per hour. We also show that our learning based mechanism is highly robust as compared to methods like exponentially weighted moving average (EWMA) based detection.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"148 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":"115821084","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

Modeling and Analysis of a Shared Channel Architecture for Performance Improvement in Optical Burst Switched Networks 用于光突发交换网络性能改进的共享信道结构建模与分析

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

Wyatt Chaffee, Bin Wang, Haining Wang

{"title":"Modeling and Analysis of a Shared Channel Architecture for Performance Improvement in Optical Burst Switched Networks","authors":"Wyatt Chaffee, Bin Wang, Haining Wang","doi":"10.1109/BROADNETS.2006.4374323","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374323","url":null,"abstract":"Existing optical burst switching (OBS) architecture has assumed the separated transfer of burst header packets and data bursts. To deal with burst contention and blocking, various approaches have been proposed such as using deflection routing, fiber delay line buffering, wavelength conversion, and burst segmentation. In this paper, we investigate a shared channel architecture that allows the transfer of both burst header packets and data bursts on the same wavelength channel with some modifications on the current OBS architecture. The new shared channel based OBS architecture is expected to have better flexibility in resource utilization and improved burst blocking performance. Based on the reduced load fixed point approximation, we provide an analytic model for burst blocking probability analysis under the proposed architecture which employs the just-enough-time signaling and fixed routing. The accuracy of the analytic model is validated via extensive simulation. Overall, our analysis and simulation show that the proposed architecture achieves a significantly lower burst blocking probability than the conventional architecture.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"42 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":"115876939","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

Dynamic Wavelength Assignment Using Wavelength Spectrum Separation for Crosstalk Limited Networks 基于波长频谱分离的串扰有限网络动态波长分配

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

Jun He, M. Brandt-Pearce

引用次数: 23

Capacity Requirements for the One-to-One Backup Option in MPLS Fast Reroute MPLS快速路由中一对一备份的容量需求

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

Rüdiger Martin, M. Menth, K. Canbolat

引用次数: 13

Network-coding Based Topology Design for Multicast Networks 基于网络编码的多播网络拓扑设计

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

Kaikai Chi, Xiaohong Jiang, S. Horiguchi

{"title":"Network-coding Based Topology Design for Multicast Networks","authors":"Kaikai Chi, Xiaohong Jiang, S. Horiguchi","doi":"10.1109/BROADNETS.2006.4374359","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374359","url":null,"abstract":"The future communication networks should have a good capability to support the rapidly growing multicast applications. It is notable, however, that the conventional algorithms for network design are mainly unicast-oriented, and they can not be adopted directly for the efficient topology design of multicast-capable networks by simply treating each multicast as multiple unicasts. The network coding technique proposed recently has the potential to efficiently support multicast transmissions with lower bandwidth requirement. In this paper we study the network-coding based network topology design problem with the consideration of efficiently supporting multicast traffic. Based on the characteristics of multicast and network coding, we first formulate this problem as a nonlinear integer programming problem, which is NP-hard. We then propose a heuristic algorithm for it. The efficiency of our algorithm is demonstrated by extensive simulation results under different traffic patterns. We conclude that our network-coding based topology design algorithm can be used to design multicast-capable networks with significantly lower cost than that of conventional unicast-oriented algorithms.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"84 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":"123387661","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

Optimal Load Balanced Clustering in Two-Tiered Sensor Networks 双层传感器网络的最优负载均衡聚类

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

A. Bari, A. Jaekel, S. Bandyopadhyay

{"title":"Optimal Load Balanced Clustering in Two-Tiered Sensor Networks","authors":"A. Bari, A. Jaekel, S. Bandyopadhyay","doi":"10.1109/BROADNETS.2006.4374424","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374424","url":null,"abstract":"In hierarchical sensor networks, sensor nodes are arranged in clusters, and higher-powered relay nodes can be used as cluster heads. The scalability and the lifetime of sensor networks are affected by the limited transmission range and battery power of the nodes. Proper techniques for assigning sensor nodes to clusters have been shown to improve the lifetime of the network. Previous approaches to clustering focus on different heuristics to achieve load balancing. In this paper, we have proposed two fast and efficient integer linear program (ILP) formulations for assigning sensor nodes to clusters in a two-tiered network, where the relay nodes are used as cluster heads. The first is for single hop routing and the second is a generalized formulation that can be used with any multi-hop routing strategy. The objective, in both cases, is to maximize the lifetime of the relay node network. We have tested our formulations with a number of different routing strategies, and for each case, we have compared our formulation to several existing heuristics for clustering. The results demonstrate that our ILP's consistently outperform the heuristics and are fast enough to be used for practical networks with hundreds of sensor nodes.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"62 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":"123449713","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}

引用次数: 12

TCP Performance over OBS Networks with Multiple Flows Input 多流输入的OBS网络TCP性能研究

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

Xiang Yu, C. Qiao

引用次数: 6