QoC-based Optimization of End-to-End M-Health Data Delivery Services Ing Widya (UoT), Bert-Jan van Beijnum (UoT), Alfons Salden (TI)

Slides:



Advertisements
Similar presentations
Multi-Access Services in Heterogeneous Wireless Networks Kameswari Chebrolu, Ramesh R. Rao Abstract Today's wireless world is characterized by heterogeneity.
Advertisements

Copyright © Chang Gung University. Permission required for reproduction or display. On Femto Deployment Architecture and Macrocell Offloading Benefits.
Algorithm Design Methodologies Divide & Conquer Dynamic Programming Backtracking.
Self-Organized Anonymous Authentication in Mobile Ad Hoc Networks Julien Freudiger, Maxim Raya and Jean-Pierre Hubaux SECURECOMM, 2009.
1 Advancing Supercomputer Performance Through Interconnection Topology Synthesis Yi Zhu, Michael Taylor, Scott B. Baden and Chung-Kuan Cheng Department.
1 EL736 Communications Networks II: Design and Algorithms Class3: Network Design Modeling Yong Liu 09/19/2007.
Chapter 5 Networks. Learning Objectives After reading this chapter the reader should be able to: Understand the importance of networks in the field of.
Forwarding Redundancy in Opportunistic Mobile Networks: Investigation and Elimination Wei Gao 1, Qinghua Li 2 and Guohong Cao 3 1 The University of Tennessee,
Network Architecture for Joint Failure Recovery and Traffic Engineering Martin Suchara in collaboration with: D. Xu, R. Doverspike, D. Johnson and J. Rexford.
Traffic Engineering With Traditional IP Routing Protocols
Multiple constraints QoS Routing Given: - a (real time) connection request with specified QoS requirements (e.g., Bdw, Delay, Jitter, packet loss, path.
Traffic Sensitive Active Queue Management - Mark Claypool, Robert Kinicki, Abhishek Kumar Dept. of Computer Science Worcester Polytechnic Institute Presenter.
CS541 Advanced Networking 1 Routing and Shortest Path Algorithms Neil Tang 2/18/2009.
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks IEEE transactions on Mobile Computing Weifa Liang, YuZhen Liu.
Path Protection in MPLS Networks Using Segment Based Approach.
Component-Based Routing for Mobile Ad Hoc Networks Chunyue Liu, Tarek Saadawi & Myung Lee CUNY, City College.
Efficient agent-based selection of DiffServ SLAs over MPLS networks Thanasis G. Papaioannou a,b, Stelios Sartzetakis a, and George D. Stamoulis a,b presented.
On Fairness, Optimizing Replica Selection in Data Grids Husni Hamad E. AL-Mistarihi and Chan Huah Yong IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS,
On Self Adaptive Routing in Dynamic Environments -- A probabilistic routing scheme Haiyong Xie, Lili Qiu, Yang Richard Yang and Yin Yale, MR and.
On-Chip Interconnect Analysis and Evaluation of Delay, Power, and Bandwidth Metrics under Different Design Goals.
Network Architecture for Cyberspace
Home and Learn How Setup a Wireless Internet Connection.
Copyright © 2012, QoS-aware Network Operating System for Software Defined Networking with Generalized OpenFlows Kwangtae Jeong, Jinwook Kim.
WiMAX Presented By Ch.Srinivas Koundinya 118T1A0435.
Delay and Loss Traffic Engineering Problem Statement for MPLS draft-fuxh-mpls-delay-loss-te-problem-statement-01 November 8, 2012 IETF 85, Atlanta 8/3/121.
EQ-BGP: an efficient inter- domain QoS routing protocol Andrzej Bęben Institute of Telecommunications Warsaw University of Technology,
Www3.informatik.uni-wuerzburg.de Institute of Computer Science Department of Distributed Systems Prof. Dr.-Ing. P. Tran-Gia Performance Metrics for Resilient.
Decision Optimization Techniques for Efficient Delivery of Multimedia Streams Mugurel Ionut Andreica, Nicolae Tapus Politehnica University of Bucharest,
Improving Voice Quality in International Mobile-to-Mobile Calls Aram Falsafi, Seattle, WA PIMRC September 2008.
CS An Overlay Routing Scheme For Moving Large Files Su Zhang Kai Xu.
1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.
Lecture 15. IGP and MPLS D. Moltchanov, TUT, Spring 2008 D. Moltchanov, TUT, Spring 2015.
EAIT, February 2006 A Pragmatic Approach towards the Improvement of Performance of Ad Hoc Routing ProtocolsOptimizations To Multipath Routing Protocols.
EGEE-II INFSO-RI Enabling Grids for E-sciencE EGEE II - Network Service Level Agreement (SLA) Establishment EGEE’07 Mary Grammatikou.
1 TIMIP HET-NETs ‘04, 28 July 2004 Micro-Mobility Performance Evaluation of a Terminal Independent Mobile Architecture TIMIP - Paper.
When In-Network Processing Meets Time: Complexity and Effects of Joint Optimization in Wireless Sensor Networks Department of Computer Science, Wayne State.
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.
1 Introduction of (UT-CTIT/BMTi) Remote Monitoring & Treatment group Richard Bults Ing Widya Hermie Hermens Enschede, September 6-7, 2007.
Constructing Optimal Wavelet Synopses Dimitris Sacharidis Timos Sellis
Multiple parallel hidden layers and other improvements to recurrent neural network language modeling ICASSP 2013 Diamantino Caseiro, Andrej Ljolje AT&T.
Peter Peerdeman Introduction Overview Wireless security Fon network Security scenarios Conclusion Wireless security Fon network Security.
Packet Dispersion in IEEE Wireless Networks Mingzhe Li, Mark Claypool and Bob Kinicki WPI Computer Science Department Worcester, MA 01609
Minimax Open Shortest Path First (OSPF) Routing Algorithms in Networks Supporting the SMDS Service Frank Yeong-Sung Lin ( 林永松 ) Information Management.
Optimization of Wavelength Assignment for QoS Multicast in WDM Networks Xiao-Hua Jia, Ding-Zhu Du, Xiao-Dong Hu, Man-Kei Lee, and Jun Gu, IEEE TRANSACTIONS.
Towards Efficient Large-Scale VPN Monitoring and Diagnosis under Operational Constraints Yao Zhao, Zhaosheng Zhu, Yan Chen, Northwestern University Dan.
S Master’s thesis seminar 8th August 2006 QUALITY OF SERVICE AWARE ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS Thesis Author: Shan Gong Supervisor:Sven-Gustav.
Trajectory Sampling for Direct Traffic Oberservation N.G. Duffield and Matthias Grossglauser IEEE/ACM Transactions on Networking, Vol. 9, No. 3 June 2001.
DDoS Attack and Defense 郭承賓 (Allen C.B. Kuo). Autonomous System Entry node.
Virtual Wire for Managing Virtual Dynamic Backbone in Wireless Ad Hoc Networks Bo Ryu, Jason Erickson, Jim Smallcomb ACM MOBICOM 1999.
1 Computer Communication & Networks Lecture 21 Network Layer: Delivery, Forwarding, Routing Waleed.
1 Iterative Integer Programming Formulation for Robust Resource Allocation in Dynamic Real-Time Systems Sethavidh Gertphol and Viktor K. Prasanna University.
6 December On Selfish Routing in Internet-like Environments paper by Lili Qiu, Yang Richard Yang, Yin Zhang, Scott Shenker presentation by Ed Spitznagel.
THE REAL NUMBERS College Algebra. Sets Set notation Union of sets Intersection of sets Subsets Combinations of three or more sets Applications.
Pre-Calculus: Graphs and Limits By: Bryan Price. Contents and Standards Pennsylvania Mathematics Standards: Trigonometry – Use graphing calculators.
Efficient Resource Allocation for Wireless Multicast De-Nian Yang, Member, IEEE Ming-Syan Chen, Fellow, IEEE IEEE Transactions on Mobile Computing, April.
© 2005 Cisco Systems, Inc. All rights reserved. BGP v3.2—3-1 Route Selection Using Policy Controls Using Multihomed BGP Networks.
Routing in Delay Tolerant Network Qing Ye EDIFY Group of Lehigh University.
Petri-Nets and Other Models
Internet Traffic Engineering Motivation: –The Fish problem, congested links. –Two properties of IP routing Destination based Local optimization TE: optimizing.
A Maximum Fair Bandwidth Approach for Channel Assignment in Wireless Mesh Networks Bahador Bakhshi and Siavash Khorsandi WCNC 2008.
Wireless Access and Networking Technology (WANT) Lab. An Efficient Data Aggregation Approach for Large Scale Wireless Sensor Networks Globecom 2010 Lutful.
Add and subtract matrices. Multiply by a matrix scalar.
Based on Computers, part of your life – part 1 A textbook for Information Technology.
WLAN Communication Network
Algebra II Elements 5.8: Analyze Graphs of Polynomial Functions
Multi-Core Parallel Routing
1.4 The Associative Properties
Lecture 19-Problem Solving 4 Incremental Method
Single path routing in most of the servers
Presentation transcript:

QoC-based Optimization of End-to-End M-Health Data Delivery Services Ing Widya (UoT), Bert-Jan van Beijnum (UoT), Alfons Salden (TI)

Outline: –introduction mobile-healthcare case –context flow graph –computational model freshness, availability, costs QoC –computational example –conclusions

resource configuration & alternatives Introduction M-Health Application PNO Internet Backbone mHP ISP ADSL BlueTooth Zigbee UMTS WiFi Zigbee GPRS m-Health Portal Body Area Network (BAN)Internet Access Front- End MBU modem Front- End sisi sisi Back- End

Context Flow Graph (CFG) Zigbee1 N FE12 BTooth1 = pre-select node S1 S2 S3 S5 = context generator node S4 wired link wired links N MBU3 N FE1 1 N FE2 1 = aggregating node N MBU 11 ADSL BTooth2 WiFi N GW1 N BE1 N BE2 BE- processing WiFi GPRS UMTS FE1- processing N FE22 FE2- processing Zigbee2 N MBU 22 N GW2 GW- processing optimal path to bring health-data to professional ?

CFG, QoC and QoS QoC based selection –Quality of Context (information) –QoC freshness(/up-to-dateness), availability, “costs”; node Anode B resource (processing/communication) Context Information QoC at_B QoC at_A QoS –QoC impeded by QoS

max-plus algebra: –arithmetic maximum (instead minimum) properties: commutative, associative, … – Computational Model min-plus algebra –additive operation: –multiplicative operation: arithmetic domain

Computational Model (..) aggregation & concatenation elements –algebraic expression –QoC arithmetic expression S1 S2 N FE1 1 d1d1 d2d2

Computational Model (..) concatenation & pre-select element –algebraic expression –QoC arithmetic expression Zigbee1 N FE12 BTooth1 N MBU 11

Computational Model (..) End-to-End Freshness algebraic expression

Computational Model (..) wired link wired links Zigbee1 N MBU 11 N MBU3 N GW1 N BE1 N BE2 BE- processing GPRS N FE1 1 N FE12 S1 S2 S3 FE1- processing N FE2 1 N FE22 S5 FE2- processing Zigbee2 N MBU 22 S4 N GW2 (1,1) element Availability & costs: independently & similarly

Computational Example QoS values (illustration) QoC results –three independently calculated QoC matrices –4x4 matrices of ranked alternative E2E paths Weighing Metrics –weighted quadratic norms GPRSUMTSWiFiWFADSLZB1BT1ZB2BT2 Delay Avail.0,9900,9850,980,999/00,960,970,960,97 Costs

Computational Example (..) QoC for a rehabilitation training scenario –weights: w Fr = 1, w 1-Av = 150, w Co = 0.02 (not normalized) indoors outdoors –indoors: path via ZigBee1, BTooth2 & WiFi + ADSL –outdoors: path via ZigBee1, BTooth2 & UMTS

Conclusions QoC based selection of an optimal E2E transfer path for M-Health scenarios; Min-max-plus algebra for several QoC dimensions; Future work: –dynamic case –use of (colored) Petri-Nets –other workflow operations