Filters








267 Hits in 5.0 sec

Computing Minimal Update Sequences for Graceful Router-Wide Reconfigurations

Francois Clad, Stefano Vissicchio, Pascal Merindol, Pierre Francois, Jean-Jacques Pansiot
2015 IEEE/ACM Transactions on Networking  
We then present and evaluate efficient algorithms that compute minimal sequences of weights enabling disruption-free router reconfigurations.  ...  Compared to singlelink modifications, the router update problem is k-dimensional for a router having k neighbors.  ...  Our algorithms for graceful router-wide updates remain safe in networks with multiple routing domains connected through route redistribution [19] .  ... 
doi:10.1109/tnet.2014.2332101 fatcat:k5xtb4av6vgkze5ji5topqqnue

Graceful router updates in link-state protocols

Francois Clad, Pascal Merindol, Stefano Vissicchio, Jean-Jacques Pansiot, Pierre Francois
2013 2013 21st IEEE International Conference on Network Protocols (ICNP)  
In this paper, we present an efficient algorithm that computes minimal sequences of weights to be configured on the links of the updated node.  ...  As opposed to a single-link modification, the router update problem is kdimensional for a node of degree k.  ...  ACKNOWLEDGMENTS We thank Olivier Bonaventure for insightful comments on a preliminary version of this work.  ... 
doi:10.1109/icnp.2013.6733587 dblp:conf/icnp/CladMVPF13 fatcat:46cjczcwpvezfc7gnsbupesdvu

The Chameleon Architecture for Streaming DSP Applications

Gerard J. M. Smit, André B. J. Kokkeler, Pascal T. Wolkotte, Philip K. F. Hölzenspies, Marcel D. van de Burgwal, Paul M. Heysters
2007 EURASIP Journal on Embedded Systems  
Reconfiguring the device is very fast, for example, loading the coefficients for a 200 tap FIR filter is done within 80 clock cycles.  ...  We introduce a heterogeneous tiled architecture and present the details of a domain-specific reconfigurable tile processor called Montium.  ...  Before reconfiguration, the NI freezes the program counter of the sequencer. The configuration memories are updated and the NI starts the sequencer again.  ... 
doi:10.1155/2007/78082 fatcat:2xpi4gychncg7k7dn4xfiicrfa

The Chameleon Architecture for Streaming DSP Applications

GerardJM Smit, AndréBJ Kokkeler, PascalT Wolkotte, PhilipKF Hölzenspies, MarcelDvande Burgwal, PaulM Heysters
2007 EURASIP Journal on Embedded Systems  
Reconfiguring the device is very fast, for example, loading the coefficients for a 200 tap FIR filter is done within 80 clock cycles.  ...  We introduce a heterogeneous tiled architecture and present the details of a domain-specific reconfigurable tile processor called Montium.  ...  Before reconfiguration, the NI freezes the program counter of the sequencer. The configuration memories are updated and the NI starts the sequencer again.  ... 
doi:10.1186/1687-3963-2007-078082 fatcat:ndfg5ngxz5g6dlvsqevp7pse7e

Improving Network Agility With Seamless BGP Reconfigurations

Stefano Vissicchio, Laurent Vanbever, Cristel Pelsser, Luca Cittadini, Pierre Francois, Olivier Bonaventure
2013 IEEE/ACM Transactions on Networking  
To enable lossless reconfigurations, we propose a framework that extends current features of carrier-grade routers to run two BGP control planes in parallel.  ...  Due to the complexity of BGP and to the lack of methodologies and tools, maintaining service availability during reconfigurations that involve BGP is a challenge for operators.  ...  Some recent work addressed network-wide link-state IGP reconfigurations [2] , [41] .  ... 
doi:10.1109/tnet.2012.2217506 fatcat:zutaggzp4vdvzgdvlsj6diloky

Graceful Convergence in Link-State IP Networks: A Lightweight Algorithm Ensuring Minimal Operational Impact

Francois Clad, Pascal Merindol, Jean-Jacques Pansiot, Pierre Francois, Olivier Bonaventure
2014 IEEE/ACM Transactions on Networking  
The evaluation of our implementation also reveals that these minimal sequences can be computed in a reasonable time.  ...  ., to shut it down for maintenance operations or to perform traffic engineering), our algorithm iteratively changes this weight, splitting the modification into a sequence of loop-free transitions.  ...  Finally, router will stop using to reach by using both and when . The sequence is a minimal loop-free sequence for destination .  ... 
doi:10.1109/tnet.2013.2255891 fatcat:npwz5kcajjhnbndcncvvjlb3um

Lossless Migrations of Link-State IGPs

Laurent Vanbever, Stefano Vissicchio, Cristel Pelsser, Pierre Francois, Olivier Bonaventure
2012 IEEE/ACM Transactions on Networking  
However, such migrations are an important source of concerns for network operators as the reconfiguration campaign can lead to long, service-disrupting outages.  ...  Network-wide migrations of a running network, such as the replacement of a routing protocol or the modification of its configuration, can improve the performance, scalability, manageability, and security  ...  Quoitin for their help in improving the paper.  ... 
doi:10.1109/tnet.2012.2190767 fatcat:w6frgnm3iba4nedsyikjp34524

Seamless network-wide IGP migrations

Laurent Vanbever, Stefano Vissicchio, Cristel Pelsser, Pierre Francois, Olivier Bonaventure
2011 Proceedings of the ACM SIGCOMM 2011 conference on SIGCOMM - SIGCOMM '11  
However, such migrations are an important source of concerns for network operators as the reconfiguration campaign can lead to long and service-affecting outages.  ...  Network-wide migrations of a running network, such as the replacement of a routing protocol or the modification of its configuration, can improve the performance, scalability, manageability, and security  ...  ACKNOWLEDGEMENTS We thank Luca Cittadini, Randy Bush, Bruno Quoitin, Virginie van den Schriek and our shepherd, Walter Willinger, for their help in improving the paper.  ... 
doi:10.1145/2018436.2018473 dblp:conf/sigcomm/VanbeverVPFB11 fatcat:bfap6cpl6rhfjfz4cfco3yk2ra

Seamless network-wide IGP migrations

Laurent Vanbever, Stefano Vissicchio, Cristel Pelsser, Pierre Francois, Olivier Bonaventure
2011 Computer communication review  
However, such migrations are an important source of concerns for network operators as the reconfiguration campaign can lead to long and service-affecting outages.  ...  Network-wide migrations of a running network, such as the replacement of a routing protocol or the modification of its configuration, can improve the performance, scalability, manageability, and security  ...  ACKNOWLEDGEMENTS We thank Luca Cittadini, Randy Bush, Bruno Quoitin, Virginie van den Schriek and our shepherd, Walter Willinger, for their help in improving the paper.  ... 
doi:10.1145/2043164.2018473 fatcat:wt62j7apefg6dp62ehb56jd45m

A flexible approach for a fault-tolerant router [chapter]

Andreas C. Döring, Wolfgang Obelöer, Gunther Lustig, Erik Maehle
1998 Lecture Notes in Computer Science  
Cluster systems gain more and more importance as a platform for parallel computing.  ...  This paper shows how to build a flexible and faulttolerant router, the main building part of a network. In addition the overhead for the execution of fault-tolerant routing algorithms is examined.  ...  Rule-based Routing Traditionally routers with flexibility as required for fault-tolerant networks are controlled either by large tables or by software, i.e. a sequence of simple commands.  ... 
doi:10.1007/3-540-64359-1_736 fatcat:r7n3m5gj2jfodeh3gigxzvh2rm

A Fault tolerant mechanism for handling Permanent and Transient Failures in a Network on Chip

Muhammad Ali, Michael Welzl, Sven Hessler
2007 Fourth International Conference on Information Technology (ITNG'07)  
link and/or router failure on-chip.  ...  We hereby propose a comprehensive fault tolerant mechanism for packet based NoCs to deal with packet losses or corruption due to transient faults as well as a dynamic routing mechanism to deal with permanent  ...  The figure 4 shows that using a buffer size of 10 minimizes the overhead for most of the examined error rates.  ... 
doi:10.1109/itng.2007.5 dblp:conf/itng/AliWH07 fatcat:2t3hkh4ltzbmnizbwy5okr24nu

Improving Convergence Speed and Scalability in OSPF: A Survey

M. Goyal, M. Soperi, E. Baccelli, G. Choudhury, A. Shaikh, H. Hosseini, K. Trivedi
2012 IEEE Communications Surveys and Tutorials  
Wide spread deployment and years of experience running the protocol have motivated continuous improvements in its operation as the nature and demands of the routing infrastructures have changed.  ...  is minimized.  ...  Section VII describes the graceful restart mechanism that allows a planned control plane reboot in a router to proceed without requiring network-wide dissemination of information about the reboot.  ... 
doi:10.1109/surv.2011.011411.00065 fatcat:mirlzrgz75bataujvsdx42m4ei

Graceful Network Operations

S. Raza, Y. Zhu, C.-N. Chuah
2009 IEEE INFOCOM 2009 - The 28th Conference on Computer Communications  
This paper introduces a general class of Graceful Network Operation (GNO) problems, where the goal is to discover the optimal sequence of operations that progressively transition the network from its initial  ...  to a desired final state while minimizing the overall performance disruption.  ...  Dynamic Programming Solution We define a dynamic programming formulation to compute the optimal sequence for GNO.  ... 
doi:10.1109/infcom.2009.5061932 dblp:conf/infocom/RazaZC09 fatcat:hrjc76nk5ndszjkupu4zogkg4q

Telephony over Metropolitan Area Ad Hoc Networks: From Concept to Field Test

E. Glatz, U. Fiedler
2009 2009 IEEE International Conference on Communications Workshops  
The architecture relies on commercially available IEEE 802.16-2004 (WiMAX) equipment that can be employed to build routers and gateways to a wired network.  ...  Fig. 7 . 7 The packet delivery ratio of an initial (reconfigured) topology is compared with the results obtained for networks that have been extended by joining routers.  ...  The Hello and Leave Protocol In addition the protocol has a hello sub-protocol to detect dead links and a leave sub-protocol for graceful leaves. V.  ... 
doi:10.1109/iccw.2009.5208119 fatcat:33zmexrdcfc33i4dxcx6guozhu

Distributed Function Chaining with Anycast Routing [article]

Adrien Wion, Mathieu Bouet, Luigi Iannone, Vania Conan
2018 arXiv   pre-print
As such, delivering these services requires that the traffic be steered through the desired sequence of virtual appliances.  ...  Based on this topology, it computes WCMP weights and updates them on the connector. VI.  ...  Indeed, the NFV nodes can be considered as classic routers that compute the next hop(s) for the best path(s), depending on the metrics, to the different prefixes, which are in our case different network  ... 
arXiv:1810.03355v1 fatcat:6t543dzmi5d6nfjc37zwnvbufu
« Previous Showing results 1 — 15 out of 267 results