A NAMED DATA NETWORKING FLEXIBLE FRAMEWORK FOR MANAGEMENT COMMUNICATION Authors: Daneil Corjuo and Rui L. Aguiar Ivan Vidal and Jamie Garcia-Reinoso Presented.

Slides:



Advertisements
Similar presentations
Networking Some of the basics. What is a Network Simply put, its two or more computer connected together through a communication medium. A communication.
Advertisements

SDN Controller Challenges
A Centralized Scheduling Algorithm based on Multi-path Routing in WiMax Mesh Network Yang Cao, Zhimin Liu and Yi Yang International Conference on Wireless.
NDN in Local Area Networks Junxiao Shi The University of Arizona
Environmental Council of States Network Authentication and Authorization Services The Shared Security Component February 28, 2005.
Network Initiated Handovers T. Melia, J. Korhonen, R. Aguiar, S. Sreemanthula, V. Gupta Based on draft-melia-mipshop-niho-ps-00.
Named Data Networking for Social Network Content delivery P. Truong, B. Mathieu (Orange Labs), K. Satzke (Alu) E. Stephan (Orange Labs) draft-truong-icnrg-ndn-osn-00.txt.
PROTOCOLS AND ARCHITECTURE Lesson 2 NETS2150/2850.
Rheeve: A Plug-n-Play Peer- to-Peer Computing Platform Wang-kee Poon and Jiannong Cao Department of Computing, The Hong Kong Polytechnic University ICDCSW.
Quality of Service in IN-home digital networks Alina Albu 23 October 2003.
A Trust Based Assess Control Framework for P2P File-Sharing System Speaker : Jia-Hui Huang Adviser : Kai-Wei Ke Date : 2004 / 3 / 15.
CSCI 4550/8556 Computer Networks Comer, Chapter 19: Binding Protocol Addresses (ARP)
Kyushu University Graduate School of Information Science and Electrical Engineering Department of Advanced Information Technology Supervisor: Professor.
Delivery, Forwarding, and Routing
DAKNET Presented By: rreema.
Introduction to Computer Networks 09/23 Presenter: Fatemah Panahi.
DISTRIBUTED PROCESS IMPLEMENTAION BHAVIN KANSARA.
Layer-3 Routing Natawut Nupairoj, Ph.D. Department of Computer Engineering Chulalongkorn University.
1 Semester 2 Module 6 Routing and Routing Protocols YuDa college of business James Chen
Pay As You Go – Associating Costs with Jini Leases By: Peer Hasselmeyer and Markus Schumacher Presented By: Nathan Balon.
Week #10 Objectives: Remote Access and Mobile Computing Configure Mobile Computer and Device Settings Configure Remote Desktop and Remote Assistance for.
EstiNet Network Simulator & Emulator 2014/06/ 尉遲仲涵.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved DISTRIBUTED SYSTEMS.
COGNITIVE RADIO FOR NEXT-GENERATION WIRELESS NETWORKS: AN APPROACH TO OPPORTUNISTIC CHANNEL SELECTION IN IEEE BASED WIRELESS MESH Dusit Niyato,
Lecture 1 The OSI Model Reference: TCP/IP Protocol Suite, 4 th Edition (chapter 2) 1.
M.Menelaou CCNA2 ROUTING. M.Menelaou ROUTING Routing is the process that a router uses to forward packets toward the destination network. A router makes.
Common Devices Used In Computer Networks
Version 4.0. Objectives Describe how networks impact our daily lives. Describe the role of data networking in the human network. Identify the key components.
An efficient secure distributed anonymous routing protocol for mobile and wireless ad hoc networks Authors: A. Boukerche, K. El-Khatib, L. Xu, L. Korba.
Authors: Jiann-Liang Chenz, Szu-Lin Wuy,Yang-Fang Li, Pei-Jia Yang,Yanuarius Teofilus Larosa th International Wireless Communications and Mobile.
Peer to Peer Applications in Ad hoc Networks Author: Jesús Hijas Networking Laboratory Helsinki University of Technology Supervisor:
Distributed systems – Part 2  Bluetooth 4 Anila Mjeda.
QoS Support in High-Speed, Wormhole Routing Networks Mario Gerla, B. Kannan, Bruce Kwan, Prasasth Palanti,Simon Walton.
Exploiting Proxy-Based Transcoding to Increase the User Quality of Experience in Networked Applications Maarten Wijnants Patrick Monsieurs Peter Quax Wim.
Aadil Zia Khan and Shahab Baqai LUMS School of Science and Engineering QoS Aware Path Selection in Content Centric Networks Fahad R. Dogar Carnegie Mellon.
Lec 3: Infrastructure of Network Management Part2 Organized by: Nada Alhirabi NET 311.
The Grid System Design Liu Xiangrui Beijing Institute of Technology.
MobileMAN Internal meetingHelsinki, June 8 th 2004 NETikos activity in MobileMAN project Veronica Vanni NETikos S.p.A.
Authors: Haowei Yuan, Tian Song, and Patrick Crowley Publisher: ICCCN 2012 Presenter: Chai-Yi Chu Date: 2013/05/22 1.
Heavy and lightweight dynamic network services: challenges and experiments for designing intelligent solutions in evolvable next generation networks Laurent.
Review of the literature : DMND:Collecting Data from Mobiles Using Named Data Takashima Daiki Park Lab, Waseda University, Japan 1/15.
Running large scale experimentation on Content-Centric Networking via the Grid’5000 platform Massimo GALLO (Bell Labs, Alcatel - Lucent) Joint work with:
Othman Othman M.M., Koji Okamura Kyushu University 1.
Routing Policies in Named Data Networking Steve DiBenedetto Christos Papadopoulos Dan Massey.
Internetworking Concept and Architectural Model Chapter 3.
ADV. NETWORK SECURITY CODY WATSON What’s in Your Dongle and Bank Account? Mandatory and Discretionary Protections of External Resources.
Switches 1RD-CSY  In this lecture, we will learn about  Collision Domain and Microsegmentation  Switches – a layer two device ◦ MAC address.
Multimedia & Mobile Communications Lab.
Networking Named Content Van Jacobson, Diana K. Smetters, James D. Thornton, Michael F. Plass, Nicholas H. Briggs, Rebecca L. Braynard.
End-to-End Efficiency (E 3 ) Integrating Project of the EC 7 th Framework Programme General View of the E3 Prototyping Environment for Cognitive and Self-x.
Introduction to Grids By: Fetahi Z. Wuhib [CSD2004-Team19]
Mobile IPv6 and Firewalls: Problem Statement Speaker: Jong-Ru Lin
Cooperative Mobile Live Streaming Considering Neighbor Reception SPEAKER: BO-YU HUANG ADVISOR: DR. HO-TING WU 2015/10/15 1.
AMQP, Message Broker Babu Ram Dawadi. overview Why MOM architecture? Messaging broker like RabbitMQ in brief RabbitMQ AMQP – What is it ?
Weichao Wang, Bharat Bhargava Youngjoo, Shin
GRID ANATOMY Advanced Computing Concepts – Dr. Emmanuel Pilli.
Spring 2000CS 4611 Routing Outline Algorithms Scalability.
Authors: Jiann-Liang Chenz, Szu-Lin Wuy, Yang-Fang Li, Pei-Jia Yang,
Introduction Computer networks: – definition – computer networks from the perspectives of users and designers – Evaluation criteria – Some concepts: –
DHCP Vrushali sonar. Outline DHCP DHCPv6 Comparison Security issues Summary.
for SDN-based flow handover in wireless environments Daniel Corujo Carlos Guimarães Rui L. Aguiar
CS 6401 Intra-domain Routing Outline Introduction to Routing Distance Vector Algorithm.
IHP Im Technologiepark Frankfurt (Oder) Germany IHP Im Technologiepark Frankfurt (Oder) Germany ©
Courtesy Piggybacking: Supporting Differentiated Services in Multihop Mobile Ad Hoc Networks Wei LiuXiang Chen Yuguang Fang WING Dept. of ECE University.
Computer Network Lab. 1 3 장 OSI 기본 참조 모델 n OSI : Open System Interconnection n Basic Reference Model : ISO-7498 n Purpose of OSI Model ~ is to open communication.
E-commerce Architecture Ayşe Başar Bener. Client Server Architecture E-commerce is based on client/ server architecture –Client processes requesting service.
Mobile IP THE 12 TH MEETING. Mobile IP  Incorporation of mobile users in the network.  Cellular system (e.g., GSM) started with mobility in mind. 
The OSI Model Prof. Choong Seon HONG.
Notes Onur Ascigil, Vasilis Sourlas, Ioannis Psaras, and George Pavlou
ONLINE SECURE DATA SERVICE
Presentation transcript:

A NAMED DATA NETWORKING FLEXIBLE FRAMEWORK FOR MANAGEMENT COMMUNICATION Authors: Daneil Corjuo and Rui L. Aguiar Ivan Vidal and Jamie Garcia-Reinoso Presented by: Gurpreet Singh Thind ( ) James Koksal ( ) Mohammed Sanaullah ( ) Patrick Khordoc ( ) Tarush Saul ( )

Outline Introduction Management Requirements Management Architecture Reliable And Secure Content Data Exchange Evaluation & Validation Results Conclusion

INTRODUCTION NDN Interest Pkt. Data Consumer Data Producer Data Pkt. Interest packet Pending Interest Table (PIT) Forwarding Info. Base (FIB) NDN node Content Store (CS) INTEREST DATA

Management Requirements in NDN Use of “ Strategy Layer” for forwarding of packets [4]. Ability for FOB entries to address multiple interfaces. Manageability aspects that allow network to control the reception of content by user. Management procedures for Storage and Usable Trust. Network input or intervention. No co-ordination between NDN node and network itself. Limited to static rules or information collected by local node.

Management Framework Management Agent: – Access and updates NDN structures – Can interface with local apps ( Eg: Info about QoS requirement for a video) – Can interface with lower layers of UE to obtain link info – Identifying available wireless networks All above Info is used to guide management processes.

Management Framework (2) Manager Entity: – Interacts with MA for management procedures – Triggered by diff mechanisms – Centralized or Distributed

Management Framework (3)

Support Procedures Framework needs exchange of data using: – Asynchronous Exchange – Reliability – Security

Bootstrapping Procedure Bootstrapping procedure used for – MA discovering an ME who can offer the appropriate management services – MA and ME agreeing on a security mechanism to encrypt management data

DATA/domain/management/mgmt-case/ME DATA: ME-id, supported security mechanisms, public key Bootstrapping Procedure MA ME INTEREST/domain/management/mgmt-case/ME(1) (2) INTEREST/domain/management/mgmt-case/ME/MA- id/Epk(security mechanism, Ks) (3) DATA/domain/management/mgmt-case/ME/MA- id/Epk(security-mechanism, Ks) DATA: Ks received (4)

BootStrapping Procedure (cont) INTEREST/domain/management/mgmt-case/MA- id/EKs(test) (5) DATA/domain/management/mgmt-case/MA- id/EKs(security mechanism, Ks) DATA: EKs(test’) (6) MAME

MA & ME Management Data Exchange Case 1: MA pulls management data from ME DATA/domain/management/mgmt-case/ME/MA- id/Eks(content-name, seq-num) DATA: Eks(management-data, seq-num) MAME INTEREST/domain/management/mgmt-case/ME/MA- id/Eks(management content-name, seq-num) (1) (2)

MA & ME Management Data Exchange Case 2: MA pushes management data to ME DATA/domain/management/mgmt-case/ME/MA- id/seq-num DATA: seq-num accepted MA ME INTEREST/domain/management/mgmt-case/ME/MA- publisher-id/seq-num (1) (2) INTEREST/domain/management/mgmt-case/MA- publisher-id/seq-num (3) DATA/domain/management/mgmt-case/MA-id/seq-num DATA: Eks(management-data) (4)

EvaluationValidation Utilizing the Virtual machines and virtual network to validate our objective Using the face management to evaluate the feasibility of framework In our framework, ME is deployed in the network and the network has own policies and procedures Lets revisit the objective of the framework to have a better understanding of our evaluation and validation process OBJECTIVEOBJECTIVE ME has the ability to know the topology and network condition surrounding PoA or UE Based on the information ME can assist UE in the network discovery and selection procedures

Forming the Test Bed: Deployed in different Virtual machines Connected to Virtual network Uses CCNx software Java API used for three applications: – NDN UE (featuring MA) – Content Server – ME Bandwidth Constraint: 1Mbps (bidirectional) links to UE Background traffic: Poisson distribution

In the validation scenario: – NDN UE (launched in either basic NDN mode and framework-managed mode) Generates Interests periodically which matches a given prefix Computes RTT of Interests/RTT exchange – Background traffic is generated using Poisson distribution – The framework (i.e. validation scenario) is tested three times to compare performance Basic NDN with one probe per face Basic NDN with five probes per face NDN under framework-managed probe Basic NDN modeFramework managed UE Sends regular packet Packet sent through all faces RTT per face is calculated Lowest RTT face is chosen till next probing or Interest times out Multiple Interest can be sent at a time MA is involved in choosing faces Faces for management information is different than content retrieval so as to get better face for retrieval

Results

Results…

In the figure a) RTT in basic NDN with probing, 1 probe per face – Instantaneous RTT got from every interest sent from UE – Average RTT calculated instantaneous values in the last 5 sec and the current face used by the UE to send Interests – Between 0-40sec, may lead to choose any of the available faces, which may imply instability due to oscillations. – Between and sec (different traffic conditions), the decision may be wrong for example choosing a PoA with medium or high load – Increasing the number of Interests used in a single probing process may improve the performance, but with the cost of increasing the overhead and thus decreasing Increased the number of interests per probing process to 5 In the figure b) RTT in NDN under a framework-managed mode. – Performance decreases between sec (due to increasing traffic load  PoA_A – When happens ME sends message to MA, data coming from PoA_B – Between sec, traffic load medium then ME tells MA detach PoA_A, attach PoA_C – Achieved a lower overhead due to more stable face selection – New PoA ( sec), Average RTT reduce 14.78% – No need all interfaces be active always – De/Activating network interfaces is useful resource saving – The ME can decide which UEs attached to a saturated PoA should be moved to a different PoA

Results…

Conclusion… Flexible and comprehensive management of NDN Management procedures are taken care with the help of information available in the network, supplied by MA and utilized by ME, UE and MA to perform management It has reliable, secure and asynchronous management structure Enables easy interoperation with ICN