1 / 1

S CCeR - Services over Content-Centric Routing

S CCeR - Services over Content-Centric Routing. Shashank Shanbhag University of Massachusetts, Amherst, MA, USA sshanbha@ecs.umass.edu. Nico Schwan, Ivica Rimac Bell Labs, Alcatel-Lucent, Stuttgart, Germany {nico.schwan, ivica.rimac}@alcatel-lucent.com. Matteo Varvello

katy
Download Presentation

S CCeR - Services over Content-Centric Routing

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. SCCeR - Services over Content-Centric Routing Shashank Shanbhag University of Massachusetts, Amherst, MA, USA sshanbha@ecs.umass.edu Nico Schwan, Ivica Rimac Bell Labs, Alcatel-Lucent, Stuttgart, Germany {nico.schwan, ivica.rimac}@alcatel-lucent.com Matteo Varvello Bell Labs, Alcatel-Lucent, Holmdel, USA matteo.varvello@alcatel-lucent.com MOTIVATION DESIGN Application Server • Ant Colony Optimization for information gathering Application Server ? Exec ? ? S1 S1 CCN Exec 9 9 6 6 8 8 1 5 1 5 Exec 7 7 S1 S1 2 2 4 4 X X 3 3 S1 S1 SoCCeR Calculate new probabilities • Services are different from content • Invocation is costly: state, cpu, memory, … avoid multiple invocations • Routing depends on context: service load, latency, bandwidth, … make informed routing decisions • Centralized approaches: Lack scalability, Impose high overhead, … Pheromone Table /service/S1 Face Probability 0 p0 1 p1 2 p2 Interest Ant CCN FIB Face list Prefix Data Ant /service/S1 1 Normal Traffic /service/S2 0 EVALUATION RESULTS • SoCCeR implementation based on CCNx • Simluation setup • Random 50 node topology (GT-ITM) • Clients generate batches of service requests (uniformly distributed)with mean interarrival time of 1 second(exponentially distributed) • Service execution time with mean of 100 seconds(exponentially distributed) • Metrics: Service Load, Delay Service Failure& Recovery Load Balancing Overhead SoCCeR nodes Services

More Related