Networking 2012 On inter-domain name resolution for information-centric networks K.V. Katsaros, N. Fotiou, X. Vasilakos, C.N. Ververidis, C. Tsilopoulos,

Slides:



Advertisements
Similar presentations
SkipNet: A Scalable Overlay Network with Practical Locality Properties Nick Harvey, Mike Jones, Stefan Saroiu, Marvin Theimer, Alec Wolman Microsoft Research.
Advertisements

Dynamic Replica Placement for Scalable Content Delivery Yan Chen, Randy H. Katz, John D. Kubiatowicz {yanchen, randy, EECS Department.
Generalized Multiprotocol Label Switching: An Overview of Signaling Enhancements and Recovery Techniques IEEE Communications Magazine July 2001.
Efficient Event-based Resource Discovery Wei Yan*, Songlin Hu*, Vinod Muthusamy +, Hans-Arno Jacobsen +, Li Zha* * Chinese Academy of Sciences, Beijing.
SDN Controller Challenges
Scalable Content-Addressable Network Lintao Liu
Content Centric Networking in Tactical and Emergency MANETs Soon Y. Oh, Davide Lau, and Mario Gerla Computer Science Department University of California,
Lecture 5 - Routing On the Flat Labels M.Sc Ilya Nikolaevskiy Helsinki Institute for Information Technology (HIIT)
GlobeTraff A traffic workload generator for the performance evaluation of ICN architectures K.V. Katsaros, G. Xylomenos, G.C. Polyzos A.U.E.B. (presented.
Information-Centric Networks03c-1 Week 3 / Paper 3 The design and implementation of a next generation name service for the Internet –Venugopalan Ramasubramanian.
Small-Scale Peer-to-Peer Publish/Subscribe
SCAN: A Dynamic, Scalable, and Efficient Content Distribution Network Yan Chen, Randy H. Katz, John D. Kubiatowicz {yanchen, randy,
Web Caching Schemes1 A Survey of Web Caching Schemes for the Internet Jia Wang.
1 Canon in G Major: Designing DHTs with Hierarchical Structure Prasanna Ganesan (Stanford University) Krishna Gummadi (U. of Washington) Hector Garcia-Molina.
1 Distributed Hash Tables My group or university Peer-to-Peer Systems and Applications Distributed Hash Tables Peer-to-Peer Systems and Applications Chapter.
SkipNet: A Scalable Overlay Network with Practical Locality Properties Nick Harvey, Mike Jones, Stefan Saroiu, Marvin Theimer, Alec Wolman Presented by.
Efficient Content Location Using Interest-based Locality in Peer-to-Peer Systems Presented by: Lin Wing Kai.
SkipNet: A Scalable Overlay Network with Practical Locality Properties Nick Harvey, Mike Jones, Stefan Saroiu, Marvin Theimer, Alec Wolman Microsoft Research.
Distributed Lookup Systems
SCALLOP A Scalable and Load-Balanced Peer- to-Peer Lookup Protocol for High- Performance Distributed System Jerry Chou, Tai-Yi Huang & Kuang-Li Huang Embedded.
1 Canon in G Major: Designing DHTs with Hierarchical Structure Prasanna Ganesan (Stanford University) Krishna Gummadi (U. of Washington) Hector Garcia-Molina.
Object Naming & Content based Object Search 2/3/2003.
Chord-over-Chord Overlay Sudhindra Rao Ph.D Qualifier Exam Department of ECECS.
Squirrel: A decentralized peer- to-peer web cache Paul Burstein 10/27/2003.
Intradomain Anycast for Content Centric Networks.
Searching in Unstructured Networks Joining Theory with P-P2P.
ProActive Routing In Scalable Data Centers with PARIS Joint work with Dushyant Arora + and Jennifer Rexford* + Arista Networks *Princeton University Theophilus.
Topology-Aware Overlay Networks By Huseyin Ozgur TAN.
WINLAB Comparing Alternative Approaches for Networking of Named Objects in the Future Internet Akash Baid, Tam Vu, Dipankar Raychaudhuri WINLAB, Rutgers.
I-4 routing scalability Taekyoung Kwon Some slides are from Geoff Huston, Michalis Faloutsos, Paul Barford, Jim Kurose, Paul Francis, and Jennifer Rexford.
P.1Service Control Technologies for Peer-to-peer Traffic in Next Generation Networks Part2: An Approach of Passive Peer based Caching to Mitigate P2P Inter-domain.
P ROACTIVE S ELECTIVE N EIGHBOR C ACHING FOR E NHANCING M OBILITY S UPPORT IN I NFORMATION -C ENTRIC N ETWORKS Xenofon Vasilakos - Ph.D. Student.
The Impact of DHT Routing Geometry on Resilience and Proximity K. Gummadi, R. Gummadi..,S.Gribble, S. Ratnasamy, S. Shenker, I. Stoica.
Using the Small-World Model to Improve Freenet Performance Hui Zhang Ashish Goel Ramesh Govindan USC.
Canon in G Major: Designing DHTs with Hierarchical Structure Prasanna Ganesan(Stanford University) Krishna Gummadi(University of Washington) Hector Garcia-Molina(Stanford.
ETRI Bloom Filter-based Flat Name Resolution System for ICN ICNRG Interim meeting, Paris Jungha Hong, Woojik Chun, and Heeyoung Jung September 27, 2014.
2012.**.** Supporting reliability using reverse path in Publish/Subscribe Internet Takashima Daiki ParkLab, Waseda University, Japan 1/11.
Canon in G Major: Designing DHTs with Hierarchical Structure Prasanna Ganesan, Krishna Gummadi, Hector Garcia-Molina ICDCS2004 報告者 : 陳奕鈞.
1 Distributed Hash Tables (DHTs) Lars Jørgen Lillehovde Jo Grimstad Bang Distributed Hash Tables (DHTs)
Quantitative Evaluation of Unstructured Peer-to-Peer Architectures Fabrício Benevenuto José Ismael Jr. Jussara M. Almeida Department of Computer Science.
Adaptive Web Caching CS411 Dynamic Web-Based Systems Flying Pig Fei Teng/Long Zhao/Pallavi Shinde Computer Science Department.
An IP Address Based Caching Scheme for Peer-to-Peer Networks Ronaldo Alves Ferreira Joint work with Ananth Grama and Suresh Jagannathan Department of Computer.
Content-oriented Networking Platform: A Focus on DDoS Countermeasure ( In incremental deployment perspective) Authors: Junho Suh, Hoon-gyu Choi, Wonjun.
Kaleidoscope – Adding Colors to Kademlia Gil Einziger, Roy Friedman, Eyal Kibbar Computer Science, Technion 1.
PIT and Cache Dynamics in CCN. Objects & Conclusion Cache-PIT dynamics in CCN Cache and PIT aggregation effect save bandwidth consumption As network load.
Peer to Peer A Survey and comparison of peer-to-peer overlay network schemes And so on… Chulhyun Park
How to use DNS during the evolution of ICN? Zhiwei Yan.
15 November 2005LCN Collision Detection and Resolution in Hierarchical Peer-to-Peer Systems Verdi March 1, Yong Meng Teo 1,2, Hock Beng Lim 2, Peter.
P2P Group Meeting (ICS/FORTH) Monday, 28 March, 2005 A Scalable Content-Addressable Network Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp,
1 Distributed Hash Table CS780-3 Lecture Notes In courtesy of Heng Yin.
Research of P2P Architecture based on Cloud Computing Speaker : 吳靖緯 MA0G0101.
NTMS 2012 GlobeTraff: a traffic workload generator for the performance evaluation of future Internet architectures K.V. Katsaros, G. Xylomenos, G.C. Polyzos.
Information-Centric Networks Section # 3.3: DNS Issues Instructor: George Xylomenos Department: Informatics.
Information-Centric Networks Section # 10.3: Publish/Subscribe Instructor: George Xylomenos Department: Informatics.
CS Spring 2014 CS 414 – Multimedia Systems Design Lecture 37 – Introduction to P2P (Part 1) Klara Nahrstedt.
Spring 2000CS 4611 Routing Outline Algorithms Scalability.
On the Placement of Web Server Replicas Yu Cai. Paper On the Placement of Web Server Replicas Lili Qiu, Venkata N. Padmanabhan, Geoffrey M. Voelker Infocom.
Querying the Internet with PIER CS294-4 Paul Burstein 11/10/2003.
Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks Presented by Barath Raghavan.
Incrementally Improving Lookup Latency in Distributed Hash Table Systems Hui Zhang 1, Ashish Goel 2, Ramesh Govindan 1 1 University of Southern California.
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
Brocade: Landmark Routing on Overlay Networks
Auction-based in-network caching in Information-centric networks Workshop ACROSS, 16th of September 2016 | Lucia D’Acunto.
Notes Onur Ascigil, Vasilis Sourlas, Ioannis Psaras, and George Pavlou
Peer-to-Peer Data Management
Plethora: Infrastructure and System Design
VDN: Virtual Machine Image Distribution Network for Cloud Data Centers
Early Measurements of a Cluster-based Architecture for P2P Systems
A Semantic Peer-to-Peer Overlay for Web Services Discovery
Presentation transcript:

Networking 2012 On inter-domain name resolution for information-centric networks K.V. Katsaros, N. Fotiou, X. Vasilakos, C.N. Ververidis, C. Tsilopoulos, G. Xylomenos, and G. C. Polyzos AUEB

Outline Name resolution in ICN Related work An enhanced DHT-based NRS Performance evaluation & results Conclusions

Name resolution in ICN ICN has many requirements from name resolution Operation over a flat identifier namespace Scalability –Ability to efficiently handle names Fault tolerance and fault isolation –No centralized architecture Low signaling overhead Low latency (low response time) –Efficient routing and load distribution Routing policy compliance

Related work DHTs (Chord, Pastry) –Logarithmic number of hops required –Not compliant with routing policies MDHT and (old) PSIRP approach –Multilevel DHT with aggregation at higher levels –Questionable scalability and routing compliance DONA –Hierarchical aggregation of information –Requests are propagated upwards –Strictly follows customer-provider relationships

An enhanced DHT-based NRS H-Pastry: hierarchical DHT taking into account –Administrative domain boundaries –Inter-domain routing policies H-Pastry results in –Reduced path stretch (similar to regular Pastry) By 55% (Chord) and 47% (Crescendo) –Confined traffic within administrative boundaries 27% less inter-domain hops (Pastry) 55% shorter intra-domain paths (Pastry) –Reduced valley-free policy violations per path By 56% (Chord), 31% (Pastry) and 36% (Crescendo)

An enhanced DHT-based NRS Outline of the H-Pastry based NRS

Performance evaluation & results Evaluation dimensions –Load: memory, signaling, processing overhead –Routing performance Particular attention paid to the effects of –Underlying network structure on performance –Popularity characteristics of content on caching Evaluation Setup: Topology –Scaled-down but realistic topology –400 domains, 6-levels, peering and multihoming –Number of RV points: 4400

Performance evaluation & results Evaluation Setup: Workload –Original workload generated by GlobeTraff See our paper in IFIP NTMS 2012 –Focus on signaling to locate & start transmission –Data plane traffic mix translated to control plane Νumber of items for each traffic type Data volume / median item size per traffic type –Modeled popularity & temporal evolution 25GB of total traffic –~2.5M subscriptions for ~1M objects

Performance evaluation & results Routing stretch in inter-domain hops –Ratio of DHT-NRS / DONA hops –Infinite Cache Size (ICS), m is the DONA median Caching performance –Works for popular items –34% worse than DONA

Performance evaluation & results State: item entries per node DHT-NRS considerably better than DONA –Note the log scale for the x-axis! –DHT-NRS achieves better state distribution

Performance evaluation & results State distribution across hierarchy levels –Roughly 50% of access networks at level 2 –DHT-NRS achieves a better state distribution –DONA is penalized by topology structure

Performance evaluation & results Lookup signaling overhead –Includes terminated + forwarded messages –DONA works better for most of the nodes –In DHT-NRS messages cross more nodes

Performance evaluation & results Lookup overhead distribution across hierarchy levels –DONA is problematic at level 1 (as expected) –DHT-NRS is also hit at the topmost level Subscribe/Notify messages often go through level 1

Performance evaluation & results Advertisement/registration signaling overhead –Inter-domain hop transmissions per registration –DHT-NRS requires 6.34 transmissions (at 0%m) –DONA requires transmissions Excessive inter-domain traffic load for DONA –(Limited) flooding method for registrations –Multihoming plays a critical role Registrations sent to multiple higher levels 56.75% of all domains are multi-homed 2.4 providers on average for them

Conclusions Routing efficiency –Caching in DHT-NRS cannot compete with DONA –Stretch values range from 1.95 to 2.84 Memory and lookup processing overhead –DHT-NRS considerably better –DONA has a highly skewed distribution Registration processing overhead –DONA is almost 6 times worse than DHT-NRS The problem with DONA is mainly localized –Large-scale centralized solutions (e.g. cloud)?