UbiFlow: Mobile Management in Urban-scale Software Defined IoT

Slides:



Advertisements
Similar presentations
Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan MIT and Berkeley presented by Daniel Figueiredo Chord: A Scalable Peer-to-peer.
Advertisements

VSMC MIMO: A Spectral Efficient Scheme for Cooperative Relay in Cognitive Radio Networks 1.
Scalable Content-Addressable Network Lintao Liu
Winter 2004 UCSC CMPE252B1 CMPE 257: Wireless and Mobile Networking SET 3f: Medium Access Control Protocols.
A Centralized Scheduling Algorithm based on Multi-path Routing in WiMax Mesh Network Yang Cao, Zhimin Liu and Yi Yang International Conference on Wireless.
CHORD – peer to peer lookup protocol Shankar Karthik Vaithianathan & Aravind Sivaraman University of Central Florida.
PDPTA03, Las Vegas, June S-Chord: Using Symmetry to Improve Lookup Efficiency in Chord Valentin Mesaros 1, Bruno Carton 2, and Peter Van Roy 1 1.
Chord: A Scalable Peer-to- Peer Lookup Service for Internet Applications Ion StoicaRobert Morris David Liben-NowellDavid R. Karger M. Frans KaashoekFrank.
Chord: A Scalable Peer-to-peer Lookup Protocol for Internet Applications Speaker: Cathrin Weiß 11/23/2004 Proseminar Peer-to-Peer Information Systems.
Chord: A scalable peer-to- peer lookup service for Internet applications Ion Stoica, Robert Morris, David Karger, M. Frans Kaashock, Hari Balakrishnan.
1 1 Chord: A scalable Peer-to-peer Lookup Service for Internet Applications Dariotaki Roula
Robert Morris, M. Frans Kaashoek, David Karger, Hari Balakrishnan, Ion Stoica, David Liben-Nowell, Frank Dabek Chord: A scalable peer-to-peer look-up.
Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.
Web Caching Schemes1 A Survey of Web Caching Schemes for the Internet Jia Wang.
CAC and Scheduling Schemes for Real-time Video Applications in IEEE Networks Ou Yang UR 10/11/2006.
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
Placement of Integration Points in Multi-hop Community Networks Ranveer Chandra (Cornell University) Lili Qiu, Kamal Jain and Mohammad Mahdian (Microsoft.
Topics in Reliable Distributed Systems Lecture 2, Fall Dr. Idit Keidar.
Internet Indirection Infrastructure Ion Stoica UC Berkeley.
In-Band Flow Establishment for End-to-End QoS in RDRN Saravanan Radhakrishnan.
Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek and Hari alakrishnan.
SkipNet: A Scaleable Overlay Network With Practical Locality Properties Presented by Rachel Rubin CS294-4: Peer-to-Peer Systems By Nicholas Harvey, Michael.
Topics in Reliable Distributed Systems Fall Dr. Idit Keidar.
1 CS 194: Distributed Systems Distributed Hash Tables Scott Shenker and Ion Stoica Computer Science Division Department of Electrical Engineering and Computer.
Wide-area cooperative storage with CFS
“Umbrella”: A novel fixed-size DHT protocol A.D. Sotiriou.
Mobile Ad-hoc Pastry (MADPastry) Niloy Ganguly. Problem of normal DHT in MANET No co-relation between overlay logical hop and physical hop – Low bandwidth,
Tapestry GTK Devaroy (07CS1012) Kintali Bala Kishan (07CS1024) G Rahul (07CS3009)
Designing a DHT for low latency and high throughput Robert Vollmann P2P Information Systems.
GeoGrid: A scalable Location Service Network Authors: J.Zhang, G.Zhang, L.Liu Georgia Institute of Technology presented by Olga Weiss Com S 587x, Fall.
Content Overlays (Nick Feamster). 2 Content Overlays Distributed content storage and retrieval Two primary approaches: –Structured overlay –Unstructured.
Network Aware Resource Allocation in Distributed Clouds.
Chord & CFS Presenter: Gang ZhouNov. 11th, University of Virginia.
Overlay network concept Case study: Distributed Hash table (DHT) Case study: Distributed Hash table (DHT)
Information-Centric Networks07a-1 Week 7 / Paper 1 Internet Indirection Infrastructure –Ion Stoica, Daniel Adkins, Shelley Zhuang, Scott Shenker, Sonesh.
1 Reading Report 5 Yin Chen 2 Mar 2004 Reference: Chord: A Scalable Peer-To-Peer Lookup Service for Internet Applications, Ion Stoica, Robert Morris, david.
1 Heterogeneity in Multi-Hop Wireless Networks Nitin H. Vaidya University of Illinois at Urbana-Champaign © 2003 Vaidya.
Chord: A Scalable Peer-to-peer Lookup Protocol for Internet Applications Xiaozhou Li COS 461: Computer Networks (precept 04/06/12) Princeton University.
A novel approach of gateway selection and placement in cellular Wi-Fi system Presented By Rajesh Prasad.
De-Nian Young Ming-Syan Chen IEEE Transactions on Mobile Computing Slide content thanks in part to Yu-Hsun Chen, University of Taiwan.
Network Computing Laboratory Scalable File Sharing System Using Distributed Hash Table Idea Proposal April 14, 2005 Presentation by Jaesun Han.
Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan MIT and Berkeley presented by Daniel Figueiredo Chord: A Scalable Peer-to-peer.
Presentation 1 By: Hitesh Chheda 2/2/2010. Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan MIT Laboratory for Computer Science.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications.
Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan Presented.
SIGCOMM 2001 Lecture slides by Dr. Yingwu Zhu Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications.
Peer to Peer A Survey and comparison of peer-to-peer overlay network schemes And so on… Chulhyun Park
PROP: A Scalable and Reliable P2P Assisted Proxy Streaming System Computer Science Department College of William and Mary Lei Guo, Songqing Chen, and Xiaodong.
1. Outline  Introduction  Different Mechanisms Broadcasting Multicasting Forward Pointers Home-based approach Distributed Hash Tables Hierarchical approaches.
Idit Keidar, Principles of Reliable Distributed Systems, Technion EE, Spring Principles of Reliable Distributed Systems Lecture 2: Distributed Hash.
Algorithms for Resource Allocation in HetNet Jianwei Liu Clemson University.
Tufts Wireless Laboratory School Of Engineering Tufts University Paper Review “An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks”,
Efficient Resource Allocation for Wireless Multicast De-Nian Yang, Member, IEEE Ming-Syan Chen, Fellow, IEEE IEEE Transactions on Mobile Computing, April.
LOOKING UP DATA IN P2P SYSTEMS Hari Balakrishnan M. Frans Kaashoek David Karger Robert Morris Ion Stoica MIT LCS.
Energy Efficient Data Management for Wireless Sensor Networks with Data Sink Failure Hyunyoung Lee, Kyoungsook Lee, Lan Lin and Andreas Klappenecker †
PeerNet: Pushing Peer-to-Peer Down the Stack Jakob Eriksson, Michalis Faloutsos, Srikanth Krishnamurthy University of California, Riverside.
A Bandwidth Scheduling Algorithm Based on Minimum Interference Traffic in Mesh Mode Xu-Yajing, Li-ZhiTao, Zhong-XiuFang and Xu-HuiMin International Conference.
Malugo – a scalable peer-to-peer storage system..
Peter Pham and Sylvie Perreau, IEEE 2002 Mobile and Wireless Communications Network Multi-Path Routing Protocol with Load Balancing Policy in Mobile Ad.
1 Traffic Engineering By Kavitha Ganapa. 2 Introduction Traffic engineering is concerned with the issue of performance evaluation and optimization of.
CS694 - DHT1 Distributed Hash Table Systems Hui Zhang University of Southern California.
Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications * CS587x Lecture Department of Computer Science Iowa State University *I. Stoica,
Ion Stoica, Robert Morris, David Liben-Nowell, David R. Karger, M
Architecture and Algorithms for an IEEE 802
Nuno Salta Supervisor: Manuel Ricardo Supervisor: Ricardo Morla
A Scalable Peer-to-peer Lookup Service for Internet Applications
(slides by Nick Feamster)
EE 122: Peer-to-Peer (P2P) Networks
MIT LCS Proceedings of the 2001 ACM SIGCOMM Conference
Presentation transcript:

UbiFlow: Mobile Management in Urban-scale Software Defined IoT From 2015 IEEE Conference on Computer Communications(INFOCOM)

Abstract The growing of Internet of Things (IoT) devices has resulted in a number of urban-scale deployments of IoT multinetworks, where heterogeneous wireless communication solutions coexist. Managing the multinetworks for mobile IoT access is a key challenge. Software- defined networking (SDN) is emerging as a promising paradigm for quick configuration of network devices, but its application in multinetworks with frequent IoT access is not well studied.

Abstract In this paper we present UbiFlow, the first software-defined IoT system for ubiquitous flow control and mobility management in multinetworks. UbiFlow adopts distributed controllers to divide urban-scale SDN into different geographic partitions. A distributed hashing based overlay structure is proposed to maintain network scalability and consistency. Based on this UbiFlow overlay structure, relevant issues pertaining to mobility management such as scalable control, fault tolerance, and load balancing have been carefully examined and studied.

Abstract The UbiFlow controller differentiates flow scheduling based on the per-device requirement and whole-partition capability. Therefore, it can present a network status view and optimized selection of access points in multinetworks to satisfy IoT flow requests, while guaranteeing network performance in each partition. Simulation and realistic testbed experiments confirm that UbiFlow can successfully achieve scalable mobility management and robust flow scheduling in IoT multinetworks.

Key contributions A novel overlay structure to achieve mobility management and fault tolerance in software-defined IoT. An optimal assignment algorithm for the controller to match the best available access points to IoT devices, with network status analysis and flow requests as inputs. A load balancing scheme for distributed controllers by analysing the variations in flow traffic characteristics.

System Overview Core components: Data server Controllers Switches Access points IoT devices

System Overview Each controller has a partitioned view of its local network status. Switches from different partitions are partially interconnected. Connected switches can also facilitate the inter-controller clow migration Two types of IoT flows: The IoT flow between the data server and the IoT device IoT flow between IoT devices located with different partitions

Mobility Management in UbiFlow

Mobility Management in UbiFlow Overlay Structure Two types of IDs Mobile ID: the ID of a mobile IoT devices(e.g. IP v6 address or MAC address) Controller ID: the ID of a controller in distributed SDN Unique integer ID in range of [0,2^(m-1)] Controller ID: m bits m-bit integer as a “key”, key=h(Mobile ID), where h is a base hash function.

Mobility Management in UbiFlow Overlay Structure Each controller C(n) with ID n maintains a routing table namely the “finger table” Each finger table has up to k entries. The ith entry in the table indicates the closest controller to the corresponding point,where the controller ID>=(n+2^(i-1)) A query for a given key is forwarded to the nearest node Finger table are used for the case where there is no controller with the exact ID as the key value, in this case we designate the closest successor of the key as the expected controller.

Mobility Management in UbiFlow Overlay Structure Theorom 1: In an N-controller overlay network based on consistent hashing, the lookup cost to find a successor is bounded by O(log N)

Mobility Management in UbiFlow Mobile Handover Two types of SDN controllers: Associated Controller: the current controller that the mobile IoT device is associated with. Supervisory Controller: the controller that is assigned to a newly joined IoT device as its initially associated controller. Also functions as an associated controller but with additional information to record the mobility behavior of its supervised IoT devices.

Mobility Management in UbiFlow Mobile Handover

Mobility Management in UbiFlow Mobile Handover Proposition 1: The mobile lookup cost to find the previous associated controller for an IoT device in UbiFlow could be either O(log N)+1 or O(2)

Mobility Management in UbiFlow Scalable Control We focus on the Join and Leave operations of controllers: Join: identify its successor by performing a lookup in the SDN according to its ID select the successor’s keys that the new controller is responsible for the new controller sets its successor’s predecessor to itself An initial finger table will be built in the joined controller by performing lookup points(n+2^i-1)

Mobility Management in UbiFlow Scalable Control We focus on the Join and Leave operations of controllers: Leave: Move all keys that the controller is responsible for to its successor Set its successor’s predecessor to its predecessor Set its predecessor’s successor to its successor The SDN related control information in the controller will be copied to its successor Its successor will be designated as the new supervisory controller if the controller is a supervisory controller

Mobility Management in UbiFlow Fault Tolerance Controller level failure: Adopt data replication to achieve robust control Finger-table level failure: Adaptively choose alternate paths while routing Access-point failure: Designate an associated controller to detect the failure and redirect flows going ghrough failed access points to others in its partition

Flow Scheduling in UbiFlow Network Calculus based Partition View A(t): arrival traffic pattern S(t): served traffic pattern D(t): departure traffic pattern Time interval: [0,t) R: a constant bandwidth capacity(transmission rate) Service curve: S(t) = R[t − T]+, where [x]+ = max{0, x} T: transmission delay D(t) = A(t) ⊗ S(t)

Flow Scheduling in UbiFlow Network Calculus based Partition View Multiple flows going through a node, all flows share the same transmission service. Intermediate node: FIFO Leftover service curve: S(t) = S1 ⊗ S2 ⊗ . . . ⊗ Sn. three QoS parameters: delay, throughput, and jitter.

Flow Scheduling in UbiFlow IoT Multinetworks Matching based on: the current multinetwork capacity in the controlled partition the supported radio access technologies the types of services the mobile devices are requesting MD: the assignment of a set of newly joined mobile IoT devices AP: a set of access points B(j): residual bandwidth capacity function of each access point j d(I,j): bandwidth demand function of device i when assigned to access point j.

Flow Scheduling in UbiFlow IoT Multinetworks Matching The assignment problem is formulated as: where x(i, j) = 1 if device i is assigned to access point j or 0 otherwise

Flow Scheduling in UbiFlow IoT Multinetworks Matching The assignment is performed at the end of each window using: the capacity, demand and utility functions evaluated at that time the set of newly joined mobile devices within the window of time the set of active access points at that time We use an adaptation of the GAP approximation combined with a greedy heuristics for the Knapsack problem to solve the assignment.

Flow Scheduling in UbiFlow IoT Multinetworks Matching Given an access point with latency l and N mobile devices already assigned to it, the utility functions are:

Flow Scheduling in UbiFlow IoT Multinetworks Matching the controller computes the utilities for each potential assignment, normalizes them and then computes the total system utility using predefined positive weights that capture the significance of each type of utility as: where ˆud and ˆul are the normalized utilities and wd + wl + wa = 1. It then performs assignments that would maximize the overall system utility.

Flow Scheduling in UbiFlow Load Balancing We use double hashing to balance a large number of flow requests and distribute them fairly in the overlay structure. Specifically, different from the hash function h used in the finger key search, we choose a secondary hash function, h′ for collision handling. If h maps some finger key k to a controller C[i], with i = h(k), that is already heavily-loaded, then we iteratively try the controllers C[(i+f(j)) mod P] next, for j = 1, 2, 3, . . ., where f(j) = jh′(k). In this scheme, the secondary hash function is not allowed to evaluate to zero; a common choice is h′(k) = q − (k mod q), for some prime number q < P. Also, P should be a prime number.

Conclusion UbiFlow is a software-defined IoT system for efficient flow control and mobility management in urban multinetworks. In addition to flow scheduling, it shifts mobility management, handover optimization, and access point selection functions from the relatively resource constrained IoT devices to more capable distributed controllers. The distributed controllers are organized in a scalable and fault tolerant manner. The system was evaluated through simulation and testbed.

Thank you.