2nd International Conference on Broadband Networks, 2005.最新文献_第3页

Application of cluster computing in medical image processing 集群计算在医学图像处理中的应用

2nd International Conference on Broadband Networks, 2005. Pub Date : 2005-10-03 DOI: 10.1109/ICBN.2005.1589714

N. Srinivasan, V. Vaidehi

引用次数: 6

On the resource efficiency of virtual concatenation in next-generation SDH networks 下一代SDH网络中虚拟连接的资源效率研究

2nd International Conference on Broadband Networks, 2005. Pub Date : 2005-10-03 DOI: 10.1109/ICBN.2005.1589603

J. Kuri, M. Gagnaire, N. Puech, R. Douville, O. Audouin

{"title":"On the resource efficiency of virtual concatenation in next-generation SDH networks","authors":"J. Kuri, M. Gagnaire, N. Puech, R. Douville, O. Audouin","doi":"10.1109/ICBN.2005.1589603","DOIUrl":"https://doi.org/10.1109/ICBN.2005.1589603","url":null,"abstract":"Virtual concatenation (VCAT) is an SDH/SONET network functionality recently standardized by the ITU-T. VCAT provides the flexibility required to efficiently allocate network resources to Ethernet, fiber channel, ESCON and other important data traffic signals. The aim of this paper is to quantify the savings in network resources provided by VCAT, with respect to contiguous concatenation (CCAT), in SDH/SONET mesh transport networks bearing protected scheduled connection demands (SCDs). We define mathematical models to quantify the add/drop and transmission resources required to instantiate a set of protected SCDs in either a VCAT-capable or a CCAT-capable network. Quantification of transmission resources requires a routing and slot assignment (RSA) problem to be solved. We formulate the RSA problem in VCATand CCAT-capable networks as two different combinatorial optimization problems: RSAv and RSAc, respectively. Protection of the SCDs is considered in the formulations using a shared backup path protection (SBPP) technique. We propose a simulated annealing (SA) based meta-heuristic algorithm to compute approximate solutions to these problems (i.e., solutions whose cost is close to the cost of the optimal ones). The gain in transmission resources and the cost structure of add/drop resources making VCAT-capable networks more economical are analyzed for different realistic traffic types (ESCON, GbE, fibre channel, voice).","PeriodicalId":113201,"journal":{"name":"2nd International Conference on Broadband Networks, 2005.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131292674","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

Multiple-quality of protection classes including dual-failure survivable services in p-cycle networks p环网络中包含双故障可存活业务的多质量保护等级

2nd International Conference on Broadband Networks, 2005. Pub Date : 2005-10-03 DOI: 10.1109/ICBN.2005.1589619

A. Kodian, W. Grover

引用次数: 34

Privacy enhanced access control in pervasive computing environments 普适计算环境中的隐私增强访问控制

2nd International Conference on Broadband Networks, 2005. Pub Date : 2005-10-03 DOI: 10.1109/ICBN.2005.1589638

K. Ren, W. Lou

引用次数: 11

CyBorg: a novel packet-aware transport architecture CyBorg:一种新颖的数据包感知传输架构

2nd International Conference on Broadband Networks, 2005. Pub Date : 2005-10-03 DOI: 10.1109/ICBN.2005.1589606

B. Gupta, S. Acharya

{"title":"CyBorg: a novel packet-aware transport architecture","authors":"B. Gupta, S. Acharya","doi":"10.1109/ICBN.2005.1589606","DOIUrl":"https://doi.org/10.1109/ICBN.2005.1589606","url":null,"abstract":"The rapid growth of data applications is forcing service providers to seek efficient means of carrying packet data over their legacy SONET/SDH networks, designed for circuit-switched voice traffic. This problem is exacerbated by the increased deployment of new Ethernet-based VPN services over their metro networks. To support Ethernet traffic, two packet-aware SONET/SDH transport architectures have been proposed-Ethernet-over-SONET/SDH (EoS) and packet-rings (PR). In this paper, we argue that both architectures make inherent tradeoffs that limit the volume of data traffic that may be supported. Instead, we propose a hybrid architecture called CyBorg that makes selective use of EoS pipes in conjunction with a PR capability. We formulate and propose a solution to the setup failure re-arrangement problem that dynamically creates EoS pipes to supplement the existing PR if the system fails to satisfy incoming demands. We show through extensive simulations that by doing so, this novel architecture not only enables higher data traffic loads but achieves it with lower data switching capacity. We believe that this hybrid architecture and the efficiency it provides, makes for a cost-effective solution for the dilemma facing service providers.","PeriodicalId":113201,"journal":{"name":"2nd International Conference on Broadband Networks, 2005.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114607580","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

Physical layer limitations in high-speed electro/optical nodes. The European approach 高速电/光节点的物理层限制。欧洲的做法

2nd International Conference on Broadband Networks, 2005. Pub Date : 2005-10-03 DOI: 10.1109/ICBN.2005.1589753

S. Sales, P. Beneit, Christina Politi

引用次数: 1

A feedback-based contention resolution mechanism for slotted optical burst switching 一种基于反馈的槽型光突发交换争用解决机制

2nd International Conference on Broadband Networks, 2005. Pub Date : 2005-10-03 DOI: 10.1109/ICBN.2005.1589629

T. Abe, Han Koto, H. Tanida, Youngbok Choi, H. Okada

引用次数: 1

Hardware design & compression issues in compact Bluetooth enabled wireless telecardiology system 紧凑型蓝牙无线心电系统的硬件设计和压缩问题

2nd International Conference on Broadband Networks, 2005. Pub Date : 2005-10-03 DOI: 10.1109/ICBN.2005.1589716

J. Choi, R. Istepanian, Á. Alesanco, H. Wang

引用次数: 6

Routing and QoS in an all-optical packet network 全光分组网络中的路由和QoS

2nd International Conference on Broadband Networks, 2005. Pub Date : 2005-10-03 DOI: 10.1109/ICBN.2005.1589725

D. Barth, J. Fourneau, D. Nott, D. Chiaroni

{"title":"Routing and QoS in an all-optical packet network","authors":"D. Barth, J. Fourneau, D. Nott, D. Chiaroni","doi":"10.1109/ICBN.2005.1589725","DOIUrl":"https://doi.org/10.1109/ICBN.2005.1589725","url":null,"abstract":"We present the ROMEO project, a collaboration between Alcatel and French Universities to design all optical core and access networks. Inside the core, the QoS requirements are a high throughput, low latency and bounded transport delays. Our new routing algorithm combines deflection routing and convergence routing. Deflection routing is known to avoid deadlocks but some packets never reach their destination within a finite delay while convergence routing provides a deterministic bounded delay for transport but has in general a very low network throughput. The mixed strategies we design allow an ending guarantee and are almost as efficient as deflection routing. We study the performance guarantees provided by this new algorithm using graph arguments for the ending property and simulations to give some insights into the throughput and the distribution of delays. We also show how we can optimize the two main components of the algorithm. Finally, we present how bursts are implemented inside the ROMEO core network. ROMEO bursts are not based on the usual reservation without acknowledgment mechanism. Using an Eulerian decomposition of the network topology and our routing algorithm, the bursts arrive with a probability one within a bounded delay, once they have been inserted","PeriodicalId":113201,"journal":{"name":"2nd International Conference on Broadband Networks, 2005.","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122379299","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

Stream assignment for grid network with joint communication and computation constraints 具有联合通信和计算约束的网格网络流分配

2nd International Conference on Broadband Networks, 2005. Pub Date : 2005-10-03 DOI: 10.1109/ICBN.2005.1589779

J. Khan, K. Palanisamy

引用次数: 1