Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)最新文献_第2页

Service-oriented MPLS network management in a virtual networking environment 虚拟组网环境下面向服务的MPLS网络管理

Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712) Pub Date : 2003-10-20 DOI: 10.1109/ICCCN.2003.1284209

B. Thurm, M. Hennig

引用次数: 1

Single and multipath logical topology design and traffic grooming algorithm in IP over WDM networks IP over WDM网络中单路和多路逻辑拓扑设计及流量疏导算法

Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712) Pub Date : 2003-10-20 DOI: 10.1109/ICCCN.2003.1284150

Kwangil Lee, M. Shayman

{"title":"Single and multipath logical topology design and traffic grooming algorithm in IP over WDM networks","authors":"Kwangil Lee, M. Shayman","doi":"10.1109/ICCCN.2003.1284150","DOIUrl":"https://doi.org/10.1109/ICCCN.2003.1284150","url":null,"abstract":"In this paper we investigate single- and multipath logical topology design and traffic grooming algorithms. Since the problem of the optimal logical topology design for all traffic demands is NP-complete, we design a logical topology by sequentially constructing the shortest path for one source-destination pair at a time. In the single path case, the demand for each source-destination pair must be routed on a single path. In the multipath case, if it is not feasible to route a demand on a single path, the traffic demand is divided into multiple subdemands and a path is provided for each subdemand. Each path is a locally optimized path in the sense that there are no other paths with less hop count that may be constructed from existing links and newly created links. We propose heuristic algorithms for logical topology design and traffic grooming in both the single path and multipath cases. The performance of these algorithms in terms of weighted hop count and throughput is evaluated using the GLASS/SSF simulator. The results indicate that a proposed single path algorithm outperforms other known algorithms in terms of weighted hop count and throughput. Also, we observed that multipath algorithms improve network throughput and a multipath algorithm with widest-shortest paths reduces the weighted hop count compared to single path algorithms.","PeriodicalId":168378,"journal":{"name":"Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)","volume":"71 s300","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113953543","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}

引用次数: 4

MAPS - a generalized scheme for quality of service routing under delay-bandwidth constraints MAPS -延迟带宽约束下服务质量路由的一种通用方案

Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712) Pub Date : 2003-10-20 DOI: 10.1109/ICCCN.2003.1284214

Lei Zhang, J. Muppala, S. Chanson

引用次数: 1

Web server performance in a WAN environment WAN环境中的Web服务器性能

Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712) Pub Date : 2003-10-20 DOI: 10.1109/ICCCN.2003.1284195

Vsevolod Panteleenko, V. Freeh

引用次数: 8

A random graph approach for multicast scheduling and performance analysis 一种随机图方法用于组播调度和性能分析

Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712) Pub Date : 2003-10-20 DOI: 10.1109/ICCCN.2003.1284181

Guowen Han, Yuanyuan Yang

引用次数: 2

Robust sensor localization algorithm in wireless ad-hoc sensor networks 无线自组织传感器网络中的鲁棒传感器定位算法

Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712) Pub Date : 2003-10-20 DOI: 10.1109/ICCCN.2003.1284219

Xiang Ji, H. Zha

{"title":"Robust sensor localization algorithm in wireless ad-hoc sensor networks","authors":"Xiang Ji, H. Zha","doi":"10.1109/ICCCN.2003.1284219","DOIUrl":"https://doi.org/10.1109/ICCCN.2003.1284219","url":null,"abstract":"Wireless ad-hoc sensor networks are being developed to collect data across the area of deployment. To stamp the collected data and facilitate communication protocols, it is necessary to identify the location of each sensor. Most existing localization algorithms make use of trilateration or multilateration based on range measurements obtained from RSSI, TOA, TDOA and AoA. In the paper, we first study some situations that most existing sensor localization methods fail to perform well. An example of such situations is when the topology of a sensor network is anisotropic. We propose a distributed sensor localization method with estimation-comparison-correction paradigm to address these conditions. In detail, multidimensional scaling (MDS) technique is applied to recover a series of local maps for adjacent sensors in two (or three) dimensional space. The maps along the route from an anchor to another anchor are stitched together to estimate the sensors' physical locations. Then, the estimated anchor locations are compared with the anchors' physical locations for correction, and estimated sensor locations are corrected at the same time to approximate their physical locations. By iterative estimation, comparison, and correction, the method reduces sensor localization errors caused by anisotropic network topology and complex terrain, which were seldom addressed in previous research.","PeriodicalId":168378,"journal":{"name":"Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134171075","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}

引用次数: 57

BEAM: a framework for bridge negotiation in Bluetooth scatternets 蓝牙散射网中桥接协商的框架

Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712) Pub Date : 2003-10-20 DOI: 10.1109/ICCCN.2003.1284191

R. Duggirala, R. L. Ashok, D. Agrawal

{"title":"BEAM: a framework for bridge negotiation in Bluetooth scatternets","authors":"R. Duggirala, R. L. Ashok, D. Agrawal","doi":"10.1109/ICCCN.2003.1284191","DOIUrl":"https://doi.org/10.1109/ICCCN.2003.1284191","url":null,"abstract":"Bluetooth is a short-range wireless technology designed to connect various low power, resource constrained devices such as cameras, cell-phones, laptops, handhelds, etc. Devices form autonomous ad hoc networks of up to 8 active devices, referred to as piconets. Piconets may be inter-connected by one or more bridge devices to form a scatternet. The Bluetooth specification is very clear about piconet formation, maintenance, operation and termination, but only mentions the concept of a scatternet. The bridges are the most important part of the scatternet as they bear the responsibility of a switch -relaying traffic from one piconet to another. Generally, the implicit assumption made is that the bridge already exists or that the bridge can be formed in some manner. However, the issues surrounding the bridge are complex and involve the masters of more than one piconet. In this paper we propose a framework - the bridge establishment, adaptation and maintenance (BEAM) - for bridge formation, maintenance, negotiation and termination. We have enunciated the mechanisms by which a node may be made a bridge and how it may be used to add or replace subsequent bridges. The framework has been designed to be flexible so that, it may be used by any of the scatternet formation or performance improvement algorithms. It is a logical step absolutely necessary for real world Bluetooth scatternet working and is simply an enabling mechanism to be used in conjunction with other protocols. It is presented in the form of a design specification or a protocol that may be customized by different implementers, and yet maintain a very high degree of interoperability.","PeriodicalId":168378,"journal":{"name":"Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114482305","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

Study on a noise reduction system of CATV network upstream for data communication 有线电视网络数据通信上游降噪系统的研究

Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712) Pub Date : 2003-10-20 DOI: 10.1109/ICCCN.2003.1284235

M. Nakamura, Yuying Yang, K. Wasaki, Y. Shidama

引用次数: 2

Adaptive marking threshold for assured forwarding services 自适应可靠转发服务标记阈值

Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712) Pub Date : 2003-10-20 DOI: 10.1109/ICCCN.2003.1284189

Xiaolin Chang, J. Muppala

引用次数: 5

Modelling TCP Reno with spurious timeouts in wireless mobile environments 在无线移动环境中用虚假超时建模TCP Reno

Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712) Pub Date : 2003-10-20 DOI: 10.1109/ICCCN.2003.1284199

S. Fu, Mohammed Atiquzzaman

引用次数: 17