2009 International Conference on High Performance Switching and Routing最新文献_第2页

PI-OBS: a parallel iterative optical burst scheduler for OBS networks PI-OBS: OBS网络的并行迭代光突发调度器

2009 International Conference on High Performance Switching and Routing Pub Date : 2009-06-22 DOI: 10.1109/HPSR.2009.5307426

P. Pavón-Mariño, J. Veiga-Gontán, A. Ortuno-Manzanera, W. Cerroni, J. García-Haro

引用次数: 5

Range Trees with variable length comparisons 具有可变长度比较的范围树

2009 International Conference on High Performance Switching and Routing Pub Date : 2009-06-22 DOI: 10.1109/HPSR.2009.5307427

I. Sourdis, Ruben De Smet, G. Gaydadjiev

引用次数: 5

A novel architecture for a high-performance network processing unit: Flexibility at multiple levels of abstraction 高性能网络处理单元的新体系结构:多层抽象的灵活性

2009 International Conference on High Performance Switching and Routing Pub Date : 2009-06-22 DOI: 10.1109/HPSR.2009.5307421

S. Hauger

引用次数: 5

Compress the route table stored in TCAM by using memory filter 利用内存过滤器对存储在TCAM中的路由表进行压缩

2009 International Conference on High Performance Switching and Routing Pub Date : 2009-06-22 DOI: 10.1109/HPSR.2009.5307440

Dong Lin, M. Hamdi

引用次数: 1

Experimental evaluation of batch versus per-request service interconnection activation in PCE-based Grid networking 基于pce的网格网络中批处理与按请求服务互连激活的实验评估

2009 International Conference on High Performance Switching and Routing Pub Date : 2009-06-22 DOI: 10.1109/HPSR.2009.5307436

Pawel Korus, F. Paolucci, L. Valcarenghi, F. Cugini, P. Castoldi, M. Kantor, K. Wajda

{"title":"Experimental evaluation of batch versus per-request service interconnection activation in PCE-based Grid networking","authors":"Pawel Korus, F. Paolucci, L. Valcarenghi, F. Cugini, P. Castoldi, M. Kantor, K. Wajda","doi":"10.1109/HPSR.2009.5307436","DOIUrl":"https://doi.org/10.1109/HPSR.2009.5307436","url":null,"abstract":"When dynamic service interconnection requests are managed by a centralized system (e.g., a network management system — NMS), the time required for the connections to be fully operational might be heavily impacted by the policy utilized to serve them. The policies must be devised for mitigating issues that increase this time, such as commercial router irresponsiveness to configuration commands during configuration commit. In this paper a batch provisioning policy is proposed to be implemented in a Grid-augmented NMS (GNMS) to serve grid computing clients interconnection requests and mitigate router irresposiveness. Based on the proposed policy, requests are queued in the GNMS and they are activated in a batch, based on a time-out. The proposed batch provisioning policy is experimentally compared to a per-request provisioning policy that serves the requests as soon as they are received by the GNMS. Experimental evaluation results show that, when connection requests are not rare, the average time elapsing between the reception of a connection request by the GNMS and the connection being fully operational (i.e., the service time) is much shorter, on average, if batch provisioning policy is utilized.","PeriodicalId":251545,"journal":{"name":"2009 International Conference on High Performance Switching and Routing","volume":"30 13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125589217","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}

引用次数: 3

Optics vs. electronics in future high-capacity switches/routers 光学与电子在未来高容量交换机/路由器

2009 International Conference on High Performance Switching and Routing Pub Date : 2009-06-22 DOI: 10.1109/HPSR.2009.5307441

A. Bianco, Daniela Camerino, D. Cuda, F. Neri

引用次数: 4

Region-based connectivity - a new paradigm for design of fault-tolerant networks 基于区域的连通性——容错网络设计的新范式

2009 International Conference on High Performance Switching and Routing Pub Date : 2009-06-22 DOI: 10.1109/HPSR.2009.5307417

Arunabha Sen, S. Murthy, Sujogya Banerjee

{"title":"Region-based connectivity - a new paradigm for design of fault-tolerant networks","authors":"Arunabha Sen, S. Murthy, Sujogya Banerjee","doi":"10.1109/HPSR.2009.5307417","DOIUrl":"https://doi.org/10.1109/HPSR.2009.5307417","url":null,"abstract":"The studies in fault-tolerance in networks mostly focus on the connectivity of the graph as the metric of faulttolerance. If the underlying graph is k-connected, it can tolerate up to k — 1 failures. In measuring the fault tolerance in terms of connectivity, no assumption regarding the locations of the faulty nodes are made - the failed nodes may be close to each other or far from each other. In other words, the connectivity metric has no way of capturing the notion of locality of faults. However in many networks, faults may be highly localized. This is particularly true in military networks, where an enemy bomb may inflict massive but localized damage to the network. To capture the notion of locality of faults in a network, a new metric region-based connectivity (RBC) was introduced in [1]. It was shown that RBC can achieve the same level of fault-tolerance as the metric connectivity, with much lower networking resources. The study in [1] was restricted to single region fault model (SRFM), where faults are confined to one region only. In this paper, we extend the notion of RBC to multiple region fault model (MRFM), where faults are no longer confined to a single region. As faults in MRFM are still confined to regions, albeit multiple of them, it is different from unconstrained fault model where no constraint on locality of faults is imposed. The MRFM leads to several new concepts, such as region-disjoint paths and region cuts. We show that the classical result, the maximum number of node-disjoint paths between a pair of nodes is equal to the minimum number of nodes whose removal disconnects the pair, is no longer valid when region-disjoint paths and region cuts are considered. We prove that the problems of finding (i) the maximum number of region-disjoint paths between a pair of nodes, and (ii) minimum number of regions whose removal disconnect a pair of nodes, are both NP-complete. We provide heuristic solution to these two problems and evaluate their efficacy by comparing the results with optimal solutions.","PeriodicalId":251545,"journal":{"name":"2009 International Conference on High Performance Switching and Routing","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125108658","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}

引用次数: 101

A Heuristic and Hybrid Hash-based approach to fast lookup 一种基于启发式和混合哈希的快速查找方法

2009 International Conference on High Performance Switching and Routing Pub Date : 2009-06-22 DOI: 10.1109/HPSR.2009.5307428

G. Antichi, A. di Pietro, D. Ficara, S. Giordano, G. Procissi, F. Vitucci

引用次数: 4

Combined space and time analysis of Banyan networks 榕树网络的时空结合分析

2009 International Conference on High Performance Switching and Routing Pub Date : 2009-06-22 DOI: 10.1109/HPSR.2009.5307425

O. Zadedyurina, Y. Ofek, A. Pattavina

引用次数: 0

A distributed and scalable RSVP-TE architecture for next generation IP routers 面向下一代IP路由器的分布式可扩展RSVP-TE架构

2009 International Conference on High Performance Switching and Routing Pub Date : 2009-06-22 DOI: 10.1109/HPSR.2009.5307434

K. Nguyen, B. Jaumard

{"title":"A distributed and scalable RSVP-TE architecture for next generation IP routers","authors":"K. Nguyen, B. Jaumard","doi":"10.1109/HPSR.2009.5307434","DOIUrl":"https://doi.org/10.1109/HPSR.2009.5307434","url":null,"abstract":"Routers, whose main tasks include forwarding and best route computing, have undergone several design architectures in the last years in order to deal with the explosion of traffic in the Internet. Next generation routers are made with enhanced memory capacity and computing resources, distributed across a very high speed switching fabric. However, the current routing software products, particularly those built by thirdparty developers, are not able to fully exploit the new hardware platform of these routers due to their centralized architectures with a solely control card being responsible for all routing and management tasks. This paper proposes a first fully distributed software architecture of the RSVP-TE module for next generation routers in order to scale with the stringent requirements of the MPLS signaling. The components of the current centralized architecture of RSVP-TE module are offloaded onto line cards in order to share the load between the control card and the line cards. Such a distributed architecture meets the scalability requirements, e.g., high volume of traffic of next generation routers. The robustness and resiliency are also improved. We propose an estimation of the scalability of the distributed RSVP-TE architecture based on the CPU utilization.","PeriodicalId":251545,"journal":{"name":"2009 International Conference on High Performance Switching and Routing","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115176413","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