Link Stability Based Hybrid Routing Protocol for Software Defined Vehicular Networks

Connectivity aware tribrid routing framework for a generalized software defined vehicular network

“…Alternatively, the objective here is to find the path with the least travel time including the store and forward time. In order to find it, we include the store time (t scf ij ) of the link, if any, in the cost metric, as represented in (15). Then, the paths are found using a combination of bi-directional Dijkstra and successive shortest path algorithms similar to the unicast approach.…”

“…The above approach assumes the availability of network information, yet, in reality, this is not always realized [15]. Due to certain circumstances such as absence of network coverage, the SDN control plane may not always receive updated network information and thus, may not be able to find the required paths [11,16].…”

Real-time flight scheduling for optimal air traffic flow management

“…Thus, it is different from conventional stochastic programming models where multiple cases are considered with respective probabilities. A design motivation is taken from packet routing and scheduling in communication network [81][82][83][84].…”

Software defined networking approach for efficient information dissemination in vehicular networks

“…This is further worsened by the diversity in network conditions, especially by the occurrence of sparse network conditions pertaining to sub-urban and rural areas. Thus, in this chapter, we aim to drop the assumption of an ideal network and incorporate the aforementioned practical realizations in an extended version of the routing framework in the previous chapter [122,123].…”