Internet routing protocols, such as Open Shortest Path First (OSPF), compute a shortest path tree from each node to other nodes in the network, using link-state information. Such protocols do not consider the queueing ...

In this paper we show that the adoption of a simple weighted ordering heuristic strategy to find fixed shortest path routes in a topology can improve load-balancing and, consequently, network performance. We compared our ...

A route leak can be defined as a security gap that occurs due to the infringement of the routing policies that any two Autonomous Systems (ASes) have agreed upon. Route leaks are seemingly simple, but hard to resolve since ...

This paper introduces a new bi-objective vehicle routing problem that integrates the Open Location Routing Problem (OLRP), recently presented in the literature, coupled with the growing need for fuel consumption minimization, ...

The use of cannabis and cannabinoid products for the treatment of neuropathic pain is a growing area of research. This type of pain has a high prevalence, limited response to available therapies and high social and economic ...

The Capacitated Location-Routing Problem (CLRP) is a strategic-level problem involving the selection of one or many depots from a set of candidate locations and the planning of delivery routes from the selected depots to ...

Delay-Tolerant Networking (DTN) has been proposed for satellite networks with no expectation of continuous or instantaneous end-to-end connectivity, which are known as Delay-Tolerant Satellite Networks (DTSNs). Path ...