scholarly journals Scheduling Congestion- and Loop-Free Network Update in Timed SDNs

2017 ◽  
Vol 35 (11) ◽  
pp. 2542-2552 ◽  
Author(s):  
Jiaqi Zheng ◽  
Guihai Chen ◽  
Stefan Schmid ◽  
Haipeng Dai ◽  
Jie Wu ◽  
...  
Keyword(s):  
Free Network ◽  
Network Update

scholarly journals Feasibility Analysis of the Algorithms: Secured and Efficient Routing Path Update in Software Defined Networking (SDN)

2019 ◽  
Vol 7 (6) ◽  
pp. 59-64
Author(s):  
Mohammad Ashraful Hoque ◽  
MD Shibli Mollah ◽  
MD. Razu
Keyword(s):  
Software Defined Networking ◽  
Feasibility Analysis ◽  
Main Concern ◽  
Network System ◽  
Bandwidth Utilization ◽  
Maximum Security ◽  
Free Network ◽  
Network Update ◽  
The Town

Software-defined networking is the talk of the town in today’s networking industry. Because of the limitations of traditional networking, SDN is getting more popular every year. Lots of researches are taking place to improve the efficiency and overcome the challenges of SDN though it has many advantages. Hence one key problem of SDN is the network update. If the route update does not perform well, it causes congestion and inconsistencies in the network system whereas bandwidth utilization and security is our main concern. We have compared two pre-built algorithms especially for routing path update and proposed a new algorithm with maximum security and loop-free network.

scholarly journals Towards Causal Consistent Updates in Software-Defined Networks

2020 ◽  
Vol 10 (6) ◽  
pp. 2081
Author(s):  
Amine Guidara ◽  
Saúl E. Pomares Hernández ◽  
Lil María X. Rodríguez Henríquez ◽  
Hatem Hadj Kacem ◽  
Ahmed Hadj Kacem
Keyword(s):  
Formal Model ◽  
Centralized Control ◽  
Control Logic ◽  
Temporal Reference ◽  
Transmission Delays ◽  
Free Network ◽  
Network Update ◽  
Event Order ◽  
Order Execution ◽  
Network Updates

A network paradigm called the Software-Defined Network (SDN) has recently been introduced. The idea of SDN is to separate the control logic from forwarding devices to enable a centralized control platform. However, SDN is still a distributed and asynchronous system: events can be triggered by any network entity, while messages and packets are prone to arbitrary and unpredictable transmission delays. Moreover, the absence of a global temporal reference results in a broad combinatorial range space of event order. During network updates, an out-of-order execution of events may result in a deviation from desirable consistent network update properties, leading, for example, to forwarding loops and forwarding black holes, among others. In this paper, we introduce a study of the Transient Forwarding Loop (TFL) phenomenon during SDN updates; for this, we define a formal model of the TFL based on causal dependencies that capture the conditions under which it may occur. Based on this model, we introduce an algorithm that ensures the causal dependencies of the system oriented toward TFL-free SDN updating. We formally prove that it is sufficient to ensure the causal dependencies in order to guarantee TFL-free network updates. Finally, we analytically evaluate our algorithm and discuss how it outperforms the state-of-the-art in terms of updating overhead.

Research on new evolution model of scale-free network

2009 ◽  
Vol 29 (5) ◽  
pp. 1230-1232
Author(s):  
Hao RAO ◽  
Chun YANG ◽  
Shao-hua TAO
Keyword(s):  
Evolution Model ◽  
Scale Free Network ◽  
Scale Free ◽  
Free Network

scholarly journals Energy Efficiency Maximization in RIS-Aided Cell-Free Network with Limited Backhaul

2021 ◽  
pp. 1-1
Author(s):  
Quang Nhat Le ◽  
Van-Dinh Nguyen ◽  
Octavia A. Dobre ◽  
Ruiqin Zhao
Keyword(s):  
Energy Efficiency ◽  
Free Network

scholarly journals ASEG Young Professionals Network: Update

Preview ◽  
2021 ◽  
Vol 2021 (211) ◽  
pp. 5-5
Author(s):  
Jarrod Dunne
Keyword(s):  
Young Professionals ◽  
Network Update

scholarly journals An Anchor-Free Siamese Network with Multi-Template Update for Object Tracking

Electronics ◽  
2021 ◽  
Vol 10 (9) ◽  
pp. 1067
Author(s):  
Tongtong Yuan ◽  
Wenzhu Yang ◽  
Qian Li ◽  
Yuxia Wang
Keyword(s):  
Object Tracking ◽  
Correlation Energy ◽  
Feature Maps ◽  
Siamese Network ◽  
Template Update ◽  
Free Network ◽  
Multiple Prediction ◽  
Bounding Boxes ◽  
High Level ◽  
Speed And Accuracy

Siamese trackers are widely used in various fields for their advantages of balancing speed and accuracy. Compared with the anchor-based method, the anchor-free-based approach can reach faster speeds without any drop in precision. Inspired by the Siamese network and anchor-free idea, an anchor-free Siamese network (AFSN) with multi-template updates for object tracking is proposed. To improve tracking performance, a dual-fusion method is adopted in which the multi-layer features and multiple prediction results are combined respectively. The low-level feature maps are concatenated with the high-level feature maps to make full use of both spatial and semantic information. To make the results as stable as possible, the final results are obtained by combining multiple prediction results. Aiming at the template update, a high-confidence multi-template update mechanism is used. The average peak to correlation energy is used to determine whether the template should be updated. We use the anchor-free network to implement object tracking in a per-pixel manner, which computes the object category and bounding boxes directly. Experimental results indicate that the average overlap and success rate of the proposed algorithm increase by about 5% and 10%, respectively, compared to the SiamRPN++ algorithm when running on the dataset of GOT-10k (Generic Object Tracking Benchmark).

Sign in / Sign up

Export Citation Format

Share Document