The Experts below are selected from a list of 48321 Experts worldwide ranked by ideXlab platform
Luyong Zhang - One of the best experts on this subject based on the ideXlab platform.
-
A Strategy of Dynamic Routing Based on SDN
viXra, 2018Co-Authors: Lei Cai, Dianjun Chen, Luyong ZhangAbstract:Decoupling characteristics of Software Defined Network(SDN) control plane and data plane provides us with a new idea to improve Dynamic Routing. SDN controllers can easily obtain the global situation of the whole network. The network topology information and bandwidth data are applied to the classical Dijstra algorithm.
-
A Strategy of Dynamic Routing Based on SDN
DEStech Transactions on Computer Science and Engineering, 2018Co-Authors: Lei Cai, Dianjun Chen, Luyong ZhangAbstract:Decoupling characteristics of Software Defined Network(SDN) control plane and data plane provides us with a new idea to improve Dynamic Routing. SDN controllers can easily obtain the global situation of the whole network. The network topology information and bandwidth data are applied to the classical Dijstra algorithm. During the computation of the optimal path, the bandwidth of the path in the entire topology is Dynamically updated. Differed from the normal Dynamic Routing strategy, the Routing strategy releases the occupied bandwidth in the shortest possible time according to the transmission delay. The simulation results demonstrate that the Dynamic Routing strategy can greatly improve the bandwidth utilization and quality of service.
Sheng-kun Chan - One of the best experts on this subject based on the ideXlab platform.
-
Dynamic Routing with Security Considerations
IEEE Transactions on Parallel and Distributed Systems, 2009Co-Authors: Chin Fu Kuo, Ai Chun Pang, Sheng-kun ChanAbstract:Security has become one of the major issues for data communication over wired and wireless networks. Different from the past work on the designs of cryptography algorithms and system infrastructures, we aim at the proposing of a Dynamic Routing algorithm that could randomize delivery paths for data transmission. The algorithm is easy to implement and compatible with popular Routing protocols, such as Routing information protocol in wired networks and destination-sequenced distance vector protocol in wireless networks, without introducing extra control messages. An analytic study on the proposed algorithm is presented, and a series of simulation experiments are conducted to verify the analytic results and to show the capability of the proposed algorithm.
Sun Y - One of the best experts on this subject based on the ideXlab platform.
-
Research on Dynamic Routing Strategy of Nonhierarchical Telecommunication Network
Computer Science, 2004Co-Authors: Wan Hai, Sun YAbstract:The Dynamic Routing of nonhierarchical telecommunication network is an efficient solution to high traffic loss rate. This paper presents and introduces a concentrated,global optimization Dynamic Routing strategy selection system used in nonhierarchical telecommunication network, analyzes the four algorithms of computation Routing scheme, introduces the implementation of the algorithms and states the result of simulations. This system is used well in Guangdong long-distance telecommunication network.
Lei Cai - One of the best experts on this subject based on the ideXlab platform.
-
A Strategy of Dynamic Routing Based on SDN
viXra, 2018Co-Authors: Lei Cai, Dianjun Chen, Luyong ZhangAbstract:Decoupling characteristics of Software Defined Network(SDN) control plane and data plane provides us with a new idea to improve Dynamic Routing. SDN controllers can easily obtain the global situation of the whole network. The network topology information and bandwidth data are applied to the classical Dijstra algorithm.
-
A Strategy of Dynamic Routing Based on SDN
DEStech Transactions on Computer Science and Engineering, 2018Co-Authors: Lei Cai, Dianjun Chen, Luyong ZhangAbstract:Decoupling characteristics of Software Defined Network(SDN) control plane and data plane provides us with a new idea to improve Dynamic Routing. SDN controllers can easily obtain the global situation of the whole network. The network topology information and bandwidth data are applied to the classical Dijstra algorithm. During the computation of the optimal path, the bandwidth of the path in the entire topology is Dynamically updated. Differed from the normal Dynamic Routing strategy, the Routing strategy releases the occupied bandwidth in the shortest possible time according to the transmission delay. The simulation results demonstrate that the Dynamic Routing strategy can greatly improve the bandwidth utilization and quality of service.
Byrav Ramamurthy - One of the best experts on this subject based on the ideXlab platform.
-
Dynamic Routing in translucent wdm optical networks the intradomain case
Journal of Lightwave Technology, 2005Co-Authors: Xi Yang, Byrav RamamurthyAbstract:Translucent wavelength-division multiplexing optical networks use sparse placement of regenerators to overcome physical impairments and wavelength contention introduced by fully transparent networks, and achieve a performance close to fully opaque networks at a much less cost. In previous studies, we addressed the placement of regenerators based on static schemes, allowing for only a limited number of regenerators at fixed locations. This paper furthers those studies by proposing a Dynamic resource allocation and Dynamic Routing scheme to operate translucent networks. This scheme is realized through Dynamically sharing regeneration resources, including transmitters, receivers, and electronic interfaces, between regeneration and access functions under a multidomain hierarchical translucent network model. An intradomain Routing algorithm, which takes into consideration optical-layer constraints as well as Dynamic allocation of regeneration resources, is developed to address the problem of translucent Dynamic Routing in a single Routing domain. Network performance in terms of blocking probability, resource utilization, and running times under different resource allocation and Routing schemes is measured through simulation experiments.
-
inter domain Dynamic Routing in multi layer optical transport networks
Global Communications Conference, 2003Co-Authors: Xi Yang, Byrav RamamurthyAbstract:Next-generation optical transport networks will automatically and Dynamically provision end-to-end connections. In this paper, we study the problem of inter-domain Dynamic Routing under a multi-layer multi-domain network model, which allows the end-to-end connections to be set up not only across multiple Routing domains but also through two transport layers: the optical layer and the digital layer. In this model, a connection can traverse the domain boundary either through optical bypass or through optical-electrical-optical (O/E/O) processing. We propose an inter-domain Dynamic Routing scheme with modest time complexity to address the problem from an algorithmic perspective.
