Results 21 to 30 of about 14,247 (220)
A Fast Failure Recovery Scheme for Fibbing Networks
IEEE Open Journal of the Communications Society, 2020 Fibbing is a network technology that can provide flexible routing in IP networks. In a Fibbing network, the network controller cleverly broadcasts link state advertisements (LSAs) of the open shortest path first (OSPF) protocol to generate fake nodes ...
Steven S. W. Lee +3 more
doaj +1 more source
Types of triangle in plane Hamiltonian triangulations and applications to domination and k-walks [PDF]
, 2019 We investigate the minimum number t(0)(G) of faces in a Hamiltonian triangulation G so that any Hamiltonian cycle C of G has at least t(0)(G) faces that do not contain an edge of C.
Brinkmann, Gunnar +2 more
core +2 more sources
Hierarchical Method of Inter-Area Fast Rerouting
Transport and Telecommunication, 2017 In this paper, in order to increase the scalability and fault-tolerance of routing solutions the hierarchical method of inter-area fast rerouting in communication networks was presented.
Lemeshko Oleksandr +2 more
doaj +1 more source
Dynamic circulating-loop methods for transmission experiments in optically transparent networks [PDF]
, 2008 Recent experiments incorporating multiple fast switching elements and automated system configuration in a circulating loop apparatus have enabled the study of aspects of long-haul WDM transmission unique to optically transparent networks.
Barry, Liam P. +3 more
core +1 more source
Dimensioning backbone networks for multi-site data centers: exploiting anycast routing for resilience [PDF]
, 2015 In the current era of big data, applications increasingly rely on powerful computing infrastructure residing in large data centers (DCs), often adopting cloud computing technology.
Develder, Chris, Jaumard, B
core +1 more source
Short Schedules for Fast Flow Rerouting
CoRR, 2018 This paper studies the fundamental problem of how to reroute $k$ unsplittable flows of a certain demand in a capacitated network from their current paths to their respective new paths, in a congestion-free manner and fast. This scheduling problem has applications in traffic engineering in communication networks and has recently received much attention ...
Saeed Akhoondian Amiri +4 more
openaire +2 more sources
Fast heuristics for delay management with passenger rerouting [PDF]
Public Transport, 2013 Delay management models determine which connections should be maintained in case of a delayed feeder train. Recently, delay management models are developed that take into account that passengers will adjust their routes when they miss a connection. However, for large-scale real-world instances, these extended models become too large to be solved with ...
Twan Dollevoet, Dennis Huisman
openaire +3 more sources
Traffic Prediction-Based Fast Rerouting Algorithm for Wireless Multimedia Sensor Networks
International Journal of Distributed Sensor Networks, 2013 Rerouting has become an important challenge to Wireless Multimedia Sensor Networks (WMSNs) due to the constraints on energy, bandwidth, and computational capabilities of sensor nodes and frequent node and link failures.
Zhiyuan Li, Junlei Bi, Siguang Chen
doaj +1 more source
Fast emergency paths schema to overcome transient link failures in ospf routing
, 2012 A reliable network infrastructure must be able to sustain traffic flows, even when a failure occurs and changes the network topology. During the occurrence of a failure, routing protocols, like OSPF, take from hundreds of milliseconds to various seconds ...
Barreto, Fernando +2 more
core +1 more source
Crossfire Attack Defense Method Based on Software Defined Network [PDF]
Jisuanji gongchengUnlike conventional Distributed Denial of Service(DDoS) attacks, Crossfire attacks launched by botnets are low-speed and indistinguishable, making them difficult for traditional intrusion detection systems to defend against.
GUO Lei, JING Shan, WEI Liang, ZHAO Chuan
doaj +1 more source