Gelly-scheduling: distributed graph processing for service placement in community networks.
Miguel E. CoimbraMennan SelimiAlexandre P. FranciscoFelix FreitagLuís VeigaPublished in: SAC (2018)
Keyphrases
- overlapping communities
- community discovery
- computer networks
- community structure
- meeting scheduling
- distributed processing
- small world
- computer and information sciences
- peer to peer networks
- loosely coupled
- community detection
- grid environment
- scheduling problem
- real time
- graph theory
- fully distributed
- distributed environment
- citation networks
- web services
- fully connected
- admission control
- complex networks
- scheduling algorithm
- average degree
- graph model
- computational grids
- batch processing
- social networks
- real world networks
- resource allocation
- service oriented
- network structure
- distributed systems
- random walk
- densely connected
- graph structure
- service composition
- peer to peer
- differentiated services
- wide area network
- multi agent
- scheduling policies
- information networks
- edge weights
- heterogeneous networks
- network resources
- service providers
- heavy traffic
- degree distribution
- online communities
- network nodes
- round robin