2011 IEEE 12th International Conference on High Performance Switching and Routing最新文献

On the optimum switch radix in fat tree networks 胖树网络的最优交换基数

2011 IEEE 12th International Conference on High Performance Switching and Routing Pub Date : 2011-07-04 DOI: 10.1109/HPSR.2011.5986002

C. Minkenberg, R. Luijten, G. Rodríguez

引用次数: 7

A GMPLS/OBS network architecture enabling QoS-aware end-to-end burst transport GMPLS/OBS网络架构，支持qos感知的端到端突发传输

2011 IEEE 12th International Conference on High Performance Switching and Routing Pub Date : 2011-07-04 DOI: 10.1109/HPSR.2011.5986005

P. Pedroso, J. Perelló, M. Klinkowski, D. Careglio, S. Spadaro, J. Solé-Pareta

{"title":"A GMPLS/OBS network architecture enabling QoS-aware end-to-end burst transport","authors":"P. Pedroso, J. Perelló, M. Klinkowski, D. Careglio, S. Spadaro, J. Solé-Pareta","doi":"10.1109/HPSR.2011.5986005","DOIUrl":"https://doi.org/10.1109/HPSR.2011.5986005","url":null,"abstract":"This paper introduces a Generalized Multi-Protocol Label Switching (GMPLS)-enabled Optical Burst Switched (OBS) network architecture featuring end-to-end QoS-aware burst transport services. The proposed GMPLS/OBS architecture guarantees specific burst loss probability requirements, independently of the offered network load. This is achieved through the configuration of burst Label Switched Paths (LSPs) over the network which are set-up at the GMPLS control plane level only, while it is the OBS node controller the responsible for eventually committing data plane resources upon burst arrival. In such a way, statistical multiplexing feature is preserved and, at the same time, the end-user QoS demands are met by tightly dimensioning the LSPs. A Mixed Integer Linear Programming (MILP) model is devised to provide the optimal burst LSPs dimensioning according to the offered network load and QoS requirements. Moreover, GMPLS-driven capacity reconfigurations are dynamically triggered whenever unfavorable network conditions are detected. The performance of the proposed architecture is extensively assessed on several network scenarios. Future work on the topic is finally outlined.","PeriodicalId":269137,"journal":{"name":"2011 IEEE 12th International Conference on High Performance Switching and Routing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131206291","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

A problem reduction approach for the design of fault-tolerant wireless-optical access networks 一种容错无线光接入网设计的问题简化方法

2011 IEEE 12th International Conference on High Performance Switching and Routing Pub Date : 2011-07-04 DOI: 10.1109/HPSR.2011.5986024

N. Correia, G. Schütz

引用次数: 0

Group-based two-hop relay with redundancy in MANETs manet中基于组的冗余两跳中继

2011 IEEE 12th International Conference on High Performance Switching and Routing Pub Date : 2011-07-04 DOI: 10.1109/HPSR.2011.5986026

Jiajia Liu, Xiaohong Jiang, Hiroki Nishiyama, N. Kato

{"title":"Group-based two-hop relay with redundancy in MANETs","authors":"Jiajia Liu, Xiaohong Jiang, Hiroki Nishiyama, N. Kato","doi":"10.1109/HPSR.2011.5986026","DOIUrl":"https://doi.org/10.1109/HPSR.2011.5986026","url":null,"abstract":"Two-hop relay is a class of attractive routing protocols for mobile ad hoc networks (MANETs) due to its efficiency and simplicity. This paper extends the conventional two-hop relay and proposes a more general group-based two-hop relay algorithm with redundancy. In such an algorithm with redundancy ƒ and group size g (2HR-(ƒ, g) for short), each packet is delivered to at most ƒ distinct relay nodes and can be accepted by its destination if it is among the group of g packets the destination is currently requesting. The 2HR-(ƒ, g) covers the available two-hop relay protocols as special cases, like the in-order protocols (ƒ ≥ 1, g = 1), the out-of-order protocols with redundancy (ƒ > 1, g = ∞) or without redundancy (ƒ = 1, g = ∞), and it enables a more flexible control of packet delivery process to be made in the challenging MANET environment. A general theoretical framework is further developed to explore how the control parameters ƒ and g affect the expected packet delivery delay in an 2HR-(ƒ, g) MANET, where the important medium contention, interference and traffic contention issues are carefully incorporated into the analysis. Finally, extensive simulation and theoretical results are provided to demonstrate the efficiency of the 2HR-(ƒ, g) scheme and the corresponding theoretical framework.","PeriodicalId":269137,"journal":{"name":"2011 IEEE 12th International Conference on High Performance Switching and Routing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114405757","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

An improved design of optical LIFO buffer with switched delay lines 一种带开关延迟线的光学后进出出缓冲器的改进设计

2011 IEEE 12th International Conference on High Performance Switching and Routing Pub Date : 2011-07-04 DOI: 10.1109/HPSR.2011.5986015

Xiaoliang Wang, Xiaohong Jiang, A. Pattavina

{"title":"An improved design of optical LIFO buffer with switched delay lines","authors":"Xiaoliang Wang, Xiaohong Jiang, A. Pattavina","doi":"10.1109/HPSR.2011.5986015","DOIUrl":"https://doi.org/10.1109/HPSR.2011.5986015","url":null,"abstract":"The lack of optical buffer is still one of the main problems that hinder the development of all optical networks. One approach to this problem is to emulate the behavior of optical buffers by using optical switches and fiber delay lines (SDL). Current works on this topic have demonstrated the feasibility of constructing SDL-based First In First Out (FIFO) buffer, Priority buffer, etc. The Last In First Out (LIFO) buffer is another important network component for congestion control and QoS guarantee, and parallel and cascade architectures have been peoposed for the efficient design of such optical buffer [1], [2]. The recent work in [3] showed that it is possible to use M fiber delay lines (FDLs) to construct a LIFO buffer of size B = (3/2) · 2M/2 − 1 and B = 2(M+1)/2 − 1 when M is even and odd, respectively. In this paper, we improve the work in [3] by providing a more efficient construction of SDL-based optical LIFO buffer. We first show that with a single stage feedback structure consisted of one (M + 1) × (M + 1) crossbar switch and M FDLs connecting M outputs of the crossbar back to M its inputs, we are able to construct a LIFO buffer of size B = 2 · 2M/2 − 2 and B = (3/2) · 2(M+1)/2 − 2 when M is even and odd, respectively. This is achieved through adopting a properly delay length setting for each FDL and a careful packets scheduling among FDLs, as well as exploiting the nice function of simultaneous packet reading and witting a FDL can support. We further show that if we adopt a cascade of smaller switches rather than a single (M+1)×(M+1) big switch, the new LIFO design can be implemented with much lower complexity in terms of the total number of basic 2 × 2 switch elements.","PeriodicalId":269137,"journal":{"name":"2011 IEEE 12th International Conference on High Performance Switching and Routing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124471769","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

RRPD strategies for a T-OBS network architecture T-OBS网络体系结构的RRPD策略

2011 IEEE 12th International Conference on High Performance Switching and Routing Pub Date : 2011-07-04 DOI: 10.1109/HPSR.2011.5986009

O. Pedrola, D. Careglio, M. Klinkowski, J. Solé-Pareta

{"title":"RRPD strategies for a T-OBS network architecture","authors":"O. Pedrola, D. Careglio, M. Klinkowski, J. Solé-Pareta","doi":"10.1109/HPSR.2011.5986009","DOIUrl":"https://doi.org/10.1109/HPSR.2011.5986009","url":null,"abstract":"In this paper, we deal with the physical layer impairments (PLIs) in optical burst switching (OBS). In particular we present a formulation of the routing and regenerator placement and dimensioning (RRPD) problem for a feasible translucent OBS (T-OBS) network architecture. Since addressing the joint RRPD problem results in an extremely complex undertaking, we decouple the problem, and hence, we eventually provide formal models to solve routing and RPD separately in the socalled R+RPD problem. Thus, making use of mixed integer linear programming (MILP) formulations, we first address the routing problem with the aim of minimizing congestion in bottleneck network links, and second, we tackle the issue of performing a sparse placement of electrical regenerators in the network. Since the RPD formulation requires high computational effort for large problem instances, we also propose two alternative heuristic strategies that provide good near-optimal solutions within reasonable time limits. To be precise, we evaluate the trade-off between optimality and complexity provided by these methods. Finally, we conduct a series of simulation experiments on the T-OBS network that prove that the R+RPD strategies effectively deal with burst losses caused by the impact of PLIs, and therefore, ensure that the overall T-OBS network performance remains unaffected.","PeriodicalId":269137,"journal":{"name":"2011 IEEE 12th International Conference on High Performance Switching and Routing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128388570","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

A dynamic on-line path computation algorithm for VNT configuration in GMPLS controlled multi-layer (Ethernet/WSON) network GMPLS控制多层(以太网/WSON)网络中VNT配置的动态在线路径计算算法

2011 IEEE 12th International Conference on High Performance Switching and Routing Pub Date : 2011-07-04 DOI: 10.1109/HPSR.2011.5986028

A. Bukva, R. Casellas, R. Martínez, R. Muñoz

引用次数: 3

FPGA implementation of lookup algorithms 查找算法的FPGA实现

2011 IEEE 12th International Conference on High Performance Switching and Routing Pub Date : 2011-07-04 DOI: 10.1109/HPSR.2011.5986037

Zoran Chicha, L. Milinkovic, A. Smiljanic

引用次数: 8

SDBGP: A scalable, distributed BGP routing protocol implementation SDBGP:一种可扩展的分布式BGP路由协议实现

2011 IEEE 12th International Conference on High Performance Switching and Routing Pub Date : 2011-07-04 DOI: 10.1109/HPSR.2011.5986025

Xiaozhe Zhang, Xicheng Lu, Jinshu Su, Baosheng Wang, Zexin Lu

引用次数: 9

QoS parallel incremental scheduling for optical pseudo-Banyan packet switching system 光学伪榕树分组交换系统的QoS并行增量调度

2011 IEEE 12th International Conference on High Performance Switching and Routing Pub Date : 2011-07-04 DOI: 10.1109/HPSR.2011.5986039

Shih-Hsuan Lin, M. Yuang

引用次数: 0