1 Fault-tolerant Paths ISRG Retreat Z. Morley Mao 1/11/2000 Services Paths.

Slides:



Advertisements
Similar presentations
Database Architectures and the Web
Advertisements

Building Cloud-ready Video Transcoding System for Content Delivery Networks(CDNs) Zhenyun Zhuang and Chun Guo Speaker: 饒展榕.
1 Scalability is King. 2 Internet: Scalability Rules Scalability is : a critical factor in every decision Ease of deployment and interconnection The intelligence.
MiLAN: Middleware to Support Sensor Network Applications Wendi B. Heinzelman, Amy L. Murphy, Hervaldo S. Carvalho, Mark A. Perillo University of Rochester.
Chapter 8: Internet Operation Business Data Communications, 6e.
PROMISE: Peer-to-Peer Media Streaming Using CollectCast Mohamed Hafeeda, Ahsan Habib et al. Presented By: Abhishek Gupta.
Notes to the presenter. I would like to thank Jim Waldo, Jon Bostrom, and Dennis Govoni. They helped me put this presentation together for the field.
Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.
A Comparison of Layering and Stream Replication Video Multicast Schemes Taehyun Kim and Mostafa H. Ammar.
Resource Management – a Solution for Providing QoS over IP Tudor Dumitraş, Frances Jen-Fung Ning and Humayun Latif.
Multiple constraints QoS Routing Given: - a (real time) connection request with specified QoS requirements (e.g., Bdw, Delay, Jitter, packet loss, path.
Dept. of Computer Science & Engineering, CUHK1 Trust- and Clustering-Based Authentication Services in Mobile Ad Hoc Networks Edith Ngai and Michael R.
CS 501: Software Engineering Fall 2000 Lecture 16 System Architecture III Distributed Objects.
Quality of Service in IN-home digital networks Alina Albu 23 October 2003.
A General approach to MPLS Path Protection using Segments Ashish Gupta Ashish Gupta.
Probabilistic Data Aggregation Ling Huang, Ben Zhao, Anthony Joseph Sahara Retreat January, 2004.
ProActive Infrastructure Eric Brewer, David Culler, Anthony Joseph, Randy Katz Computer Science Division U.C. Berkeley ninja.cs.berkeley.edu Active Networks.
1 Introduction to Load Balancing: l Definition of Distributed systems. Collection of independent loosely coupled computing resources. l Load Balancing.
Chapter 8: Internet Operation Business Data Communications, 5e.
Wireless Video Sensor Networks Vijaya S Malla Harish Reddy Kottam Kirankumar Srilanka.
Problem Definition Data path –Created by the Automatic Path Creation (APC) component –Service: program with well-defined interface –Operator: stateless.
1 25\10\2010 Unit-V Connecting LANs Unit – 5 Connecting DevicesConnecting Devices Backbone NetworksBackbone Networks Virtual LANsVirtual LANs.
Architectural Design Establishing the overall structure of a software system Objectives To introduce architectural design and to discuss its importance.
PROMISE: Peer-to-Peer Media Streaming Using CollectCast Presented by: Randeep Singh Gakhal CMPT 886, July 2004.
Routing Algorithm for Large Data Sensor Networks Raghul Gunasekaran Group Meeting Spring 2006.
Self-Adaptive QoS Guarantees and Optimization in Clouds Jim (Zhanwen) Li (Carleton University) Murray Woodside (Carleton University) John Chinneck (Carleton.
Jani Pousi Supervisor: Jukka Manner Espoo,
Distributed Quality-of-Service Routing of Best Constrained Shortest Paths. Abdelhamid MELLOUK, Said HOCEINI, Farid BAGUENINE, Mustapha CHEURFA Computers.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved DISTRIBUTED SYSTEMS.
SensIT PI Meeting, January 15-17, Self-Organizing Sensor Networks: Efficient Distributed Mechanisms Alvin S. Lim Computer Science and Software Engineering.
Distributed Control of FACTS Devices Using a Transportation Model Bruce McMillin Computer Science Mariesa Crow Electrical and Computer Engineering University.
Tufts Wireless Laboratory School Of Engineering Tufts University “Network QoS Management in Cyber-Physical Systems” Nicole Ng 9/16/20151 by Feng Xia, Longhua.
Mobile Agent Technology for the Management of Distributed Systems - a Case Study Claudia Raibulet& Claudio Demartini Politecnico di Torino, Dipartimento.
“Intra-Network Routing Scheme using Mobile Agents” by Ajay L. Thakur.
IMPROUVEMENT OF COMPUTER NETWORKS SECURITY BY USING FAULT TOLERANT CLUSTERS Prof. S ERB AUREL Ph. D. Prof. PATRICIU VICTOR-VALERIU Ph. D. Military Technical.
1 Chapter 9 Database Design. 2 2 In this chapter, you will learn: That successful database design must reflect the information system of which the database.
Cluster Reliability Project ISIS Vanderbilt University.
Budapest University of Technology and Economics Department of Telecommunications and Media Informatics Optimized QoS Protection of Ethernet Trees Tibor.
RELATIONAL FAULT TOLERANT INTERFACE TO HETEROGENEOUS DISTRIBUTED DATABASES Prof. Osama Abulnaja Afraa Khalifah
Network-on-Chip Energy-Efficient Design Techniques for Interconnects Suhail Basit.
Advanced Computer Networks Topic 2: Characterization of Distributed Systems.
Design and run-time bandwidth contracts for pervasive computing middleware Peter Rigole K.U.Leuven – Belgium
Chapter 8: Internet Operation. Network Classes Class A: Few networks, each with many hosts All addresses begin with binary 0 Class B: Medium networks,
1 A Distributed Architecture for Multimedia in Dynamic Wireless Networks By UCLA C.R. Lin and M. Gerla IEEE GLOBECOM'95.
Designing Routing Protocol For Mobile Ad Hoc Networks Navid NIKAEIN Christian BONNET EURECOM Institute Sophia-Antipolis France.
Energy-Efficient Signal Processing and Communication Algorithms for Scalable Distributed Fusion.
Wide-Area Service Composition: Performance, Availability and Scalability Bhaskaran Raman SAHARA, EECS, U.C.Berkeley Presentation at Ericsson, Jan 2002.
1 ACTIVE FAULT TOLERANT SYSTEM for OPEN DISTRIBUTED COMPUTING (Autonomic and Trusted Computing 2006) Giray Kömürcü.
A Combat Support Agency Defense Information Systems Agency GIG EWSE IA and NetOps (EE213) 17 August 2011 UNCLASSIFIED Tactical Edge Service: NetOps and.
A Utility-based Approach to Scheduling Multimedia Streams in P2P Systems Fang Chen Computer Science Dept. University of California, Riverside
Tufts Wireless Laboratory Tufts University School Of Engineering Real-Time Data Services for Cyber Physical Systems Zhong Zou.
Run-time Adaptive on-chip Communication Scheme 林孟諭 Dept. of Electrical Engineering National Cheng Kung University Tainan, Taiwan, R.O.C.
1 Wide Area Network Emulation on the Millennium Bhaskaran Raman Yan Chen Weidong Cui Randy Katz {bhaskar, yanchen, wdc, Millennium.
ProActive Infrastructure Eric Brewer, David Culler, Anthony Joseph, Randy Katz Computer Science Division U.C. Berkeley ninja.cs.berkeley.edu Active Networks.
Peer-to-Peer Media Streaming ZIGZAG - Ye Lin PROMISE – Chanjun Yang SASABE - Kung-En Lin.
به نام خدا سيد عليرضا كارداني مجتبي اميرخاني Path Set Selection in Mobile Ad Hoc Networks زمستان 1382.
A Security Framework with Trust Management for Sensor Networks Zhiying Yao, Daeyoung Kim, Insun Lee Information and Communication University (ICU) Kiyoung.
Mick Badran Using Microsoft Service Fabric to build your next Solution with zero downtime – Lvl 300 CLD32 5.
Onlinedeeneislam.blogspot.com1 Design and Analysis of Algorithms Slide # 1 Download From
TRUST Self-Organizing Systems Emin G ü n Sirer, Cornell University.
TMN Architecture and EMS/NMS Overview
Run-time Adaptation of Grid Data Placement Jobs George Kola, Tevfik Kosar and Miron Livny Condor Project, University of Wisconsin.
Distributed Computing & Embedded Systems Chapter 4: Remote Method Invocation Dr. Umair Ali Khan.
The Ninja Architecture for Robust Internet-Scale Systems and Services UC Berkeley Computer Science Division 2002 년 10 월 9 일 박준호.
Spark on Entropy : A Reliable & Efficient Scheduler for Low-latency Parallel Jobs in Heterogeneous Cloud Huankai Chen PhD Student at University of Kent.
In the name of God.
Network Layer Goals: Overview:
CprE 458/558: Real-Time Systems
Supporting Fault-Tolerance in Streaming Grid Applications
Software testing strategies 2
Presentation transcript:

1 Fault-tolerant Paths ISRG Retreat Z. Morley Mao 1/11/2000 Services Paths

2 Example path application: Jukebox/cell-phone application Ninja Jukebox: – service providing real-time streaming audio data from a collection of CDs in the network GSM Cell-phone: –12kbps data, 13kbps voice –communicates with BTS Jukebox Path :operator:connector

3 What is a path? A way to compose services to create customizable complex services Goals: –composability –accessibility –availability, fault-tolerance –scalability –security

4 Overall path construction process –a continuous optimization process with feedback: Path Instantiation, Execution, Maintenance Logical Path Creation Physical Path Creation Path Tear-down

5 Logical path creation: Path matching algorithm Formulated as shortest path graph search –Operators ===> edges –Data format/type ===> nodes Dijkstra’s shortest path algorithm –O(v 2 ) Difficulty: expressing constraints and optimization variables

6 Path maintenance: Partial Path Repair (PPR) APC(Automatic Path Creation) service guarantees robustness and fault-tolerance Two ways of monitoring: –active checking of operator status –operators notify APC of neighboring operators’ failure

7 Performance measurements (4 operators, Jukebox/cell-phone app) Logical/Physical path creation time: 264ms Path instantiation time: 215ms –operator instantiation: 70ms –connector creation: 64ms –start operator running: 81 ms Path recovery: one operator fails –Time to detect failure of operator: 2ms –Time to repair one failed operator: 400ms Path tear-down time: 289ms

8 Open design issues Wide area considerations Improved path reliability model Path performance modeling Path resource management framework Flexible path control –control path, path migration, dynamic adaptation Applications for paths Metrics for evaluation

9 Wide area path design APC SAN WAN service Hierarchical APC Service

10 Step-by-step WAN path creation for Jukebox/Cell-phone application 1.End-user using cell-phone requests access to Jukebox service QoS needs: delay-sensitive, reliable service 2.APC uses graph search algorithm finds the logical path 3.APC searches for the physical path 1.Finds relevant parameters affecting QoS, determines the reliability model

11 Step-by-step WAN path creation for Jukebox/Cell-phone application 2.Obtains resource information from resource management framework 3.Uses queuing model to evaluate choices 4.APC selects the optimal choice 5.APC dynamically adjusts the decision given feedback from the resource monitoring tools

12 Operator placement decisions Depend on –operator computational requirement –software/hardware requirement –output/input properties data location, data volume, delay-sensitivity, degradation properties –network characteristics bandwidth, latency, jitter, packet loss

13 Path resource management framework develop network monitoring tools –to obtain network statistics Available resources – computational, memory, network etc. Make trade-offs due to interdependencies among resources resource allocated per path basis

14 Path resource management framework A high-level global hierarchical resource manager Local resource manager per SAN Runtime resource monitoring tools monitor/discover resource changes during the lifetime of paths

15 Applications for paths Operators: –content transcoding operators: text-to-speech, mp3-to-PCM, PCM-to-GSM web search tools, filtering, aggregation, personalization Microsoft COM objects, existing Web services... Document conversion services –protocol translation operators: serial socket, security transcoder, RMI Lite Any serviceAny device

16 Measurement metrics Path creation time –logical/physical path creation, instantiation, execution Scalability –number of paths created per amount of time Fault-recovery time Control, ease-of-use, programmability of paths Ease of transparent path migration, adaptation to resource changes

17 Conclusion Recent work: –APC prototype built for SAN with reasonable performance, Partial Path Repair Future work: –focus on WAN, scalable path design –WAN test plan: campus-wide millennium cluster –support for continuous path optimization and adaptation

18 For more information Please send comments/questions to Z. Morley Mao Slides will be available at: –

19 Extra Slides

20 Flexible path control: control path Control path –Definition: make changes of operators, connectors independent of data path highly-available, fault-tolerant Proposed design: –replicated control paths: neighboring operators have control over each other APC has complete control over localized operators

21 Flexible path control: path migration Two paths of different quality running –migrate from the fast-to-startup, lower-quality one to slow-to-startup, higher-quality one Transparent migration of paths –dynamic fusion of operators –dynamic deletion, addition, replacement of operators/connectors –Goal: adapt changes in resources and locations of end points

22 Wide area considerations Goal: scalable, network-partition-tolerant proposed design: –replicated APC service instances –state of paths partitioned and replicated –operators are soft-state –continuous monitoring of operators and connectors by APC service instances –a few localized path components hooked together over wide area