Scheduling Connections via Path and Edge Multicoloring

Bampas, Evangelos; Karousatou, Christina; Pagourtzis, Aris; Potika, Katerina

doi:10.1007/978-3-319-19662-6_3

Cited by 1 publication

(1 citation statement)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Delving more into the problem of Monitoring Large Dynamic graphs can yield even more interesting results, or even more possible applications especially the ones that involve handling non-trivial graphs such as directed graphs, weighted graphs, graphs with nodes that contain different attributes, and combinations of these aspects. A particularly interesting geographic application that we are currently developing is an algorithm for finding the fastest path in a distributed graph, that takes into consideration the future locations of traffic in the path, by using the graph multi-coloring method for scheduled connections shown in Bampas et al (2015). OSN's have even much more possible applications required in this field, such as security and access issues, communal popularity assessments, and fluid user networks.…”

Section: Discussionmentioning

confidence: 99%

Managing large distributed dynamic graphs for smart city network applications

2019

View full text Add to dashboard Cite

Smart cities and traffic applications can be modelled by dynamic graphs for which vertices or edges can be added, removed or change their properties. In the smart city or traffic monitoring problem, we wish to detect if a city dynamic graph maintains a certain local or global property. Monitoring city large dynamic graphs, is even more complicated. To treat the monitoring problem efficiently we divide a large city graph into sub-graphs. In the distributed monitoring problem we would like to define some local conditions for which the global city graph G maintains a certain property. Furthermore, we would like to detect if a local city change in a sub-graph affect a global graph property. Here we show that turning the graph into a non-trivial one by handling directed graphs, weighted graphs, graphs with nodes that contain different attributes or combinations of these aspects, can be integrated in known urban environment applications. These implementations are demonstrated here in two types of network applications: traffic network application and on-line social network smart city applications. We exemplify these two problems, show their experimental results and characterize efficient monitoring algorithms that can handle them.

show abstract

Section: Discussionmentioning

confidence: 99%