Results 41 to 50 of about 250,056 (317)
Green-Aware Routing in GMPLS Networks [PDF]
, 2011 The increasing amount of traffic in the Internet has been accommodated by the exponential growth of bandwidth provided by the optical networks technologies. However, such a growth has been also accompanied by an increase in the energy consumption and the
Careglio, D. +5 more
core +2 more sources
QoS Routing Algorithm Based on Entropy Granularity in the Network Transmission
Cybernetics and Information Technologies, 2019 With the rapid development of computer networks, more hosts are connected to the Internet where they could communicate with each other. The need for network service has exceeded the service capacity of the network, and the Quality of Service (QoS) is ...
Li Xiaoling, Hu Hai
doaj +1 more source
A Bio-Inspired Method for the Constrained Shortest Path Problem
The Scientific World Journal, 2014 The constrained shortest path (CSP) problem has been widely used in transportation optimization, crew scheduling, network routing and so on. It is an open issue since it is a NP-hard problem.
Hongping Wang +4 more
doaj +1 more source
Proposal of Load Aware Routing for OSPF Routing Protocol
Communications, 2013 This paper deals with route cost assignment using one of the most commonly used routing protocols - Open Shortest Path First (OSPF). The limitation of this protocol is that the algorithm does not take actual link load into consideration.
Tomas Macha, Radko Krkos, Vit Novotny
doaj +1 more source
Design and Simulation of AI-Enabled Digital Twin Model for Smart Industry 4.0
Engineering Proceedings, 2023 One of the core ideas of Industry 4.0 has been the use of digital twin networks (DTNs). A DTN facilitates the co-evolution of real and virtual things through the use of DT modelling, interactions, computation, and information analysis systems.
Md. Humayun Kabir +5 more
doaj +1 more source
Approximate Euclidean shortest paths in polygonal domains [PDF]
, 2019 Given a set $\mathcal{P}$ of $h$ pairwise disjoint simple polygonal obstacles in $\mathbb{R}^2$ defined with $n$ vertices, we compute a sketch $\Omega$ of $\mathcal{P}$ whose size is independent of $n$, depending only on $h$ and the input parameter ...
Inkulu, R, Kapoor, Sanjiv
core +2 more sources
GOSPF: An energy efficient implementation of the OSPF routing protocol [PDF]
, 2016 Energy saving iscurrently one of the most challenging issues for the Internet research community. In- deed, the exponential growth of applications and services induces a remarkable increase in power consumption and hence calls for novel solutions which
D'ARIENZO, MAURIZIO +1 more
core +1 more source
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
Network Centrality Assessment (NCA): Assessing the Transport Network Resilience to Urban Flooding
Journal of South Asian Logistics and Transport, 2021 This study presents a methodology to assess transport network resilience to urban flooding. The proposed methodology is developed based on the centrality measures and graph theory.
L.D.C.H.N. Kalpana +3 more
doaj +1 more source
On Minimum Average Stretch Spanning Trees in Polygonal 2-trees [PDF]
, 2014 A spanning tree of an unweighted graph is a minimum average stretch spanning tree if it minimizes the ratio of sum of the distances in the tree between the end vertices of the graph edges and the number of graph edges.
Narayanaswamy, N. S., Ramakrishna, G.
core +1 more source