University of Kaiserslautern Department of Computer Science Integrated Communication Systems ICSY Variable Application Requirements.

Slides:



Advertisements
Similar presentations
Noise-Predictive Turbo Equalization for Partial Response Channels Sharon Aviran, Paul H. Siegel and Jack K. Wolf Department of Electrical and Computer.
Advertisements

Rolls-Royce supported University Technology Centre in Control and Systems Engineering UK e-Science DAME Project Alex Shenfield
IEEE INFOCOM 2004 MultiNet: Connecting to Multiple IEEE Networks Using a Single Wireless Card.
Research Issues in Web Services CS 4244 Lecture Zaki Malik Department of Computer Science Virginia Tech
Multi‑Criteria Decision Making
Formal Modelling of Reactive Agents as an aggregation of Simple Behaviours P.Kefalas Dept. of Computer Science 13 Tsimiski Str Thessaloniki Greece.
CSCI 465 D ata Communications and Networks Lecture 20 Martin van Bommel CSCI 465 Data Communications & Networks 1.
EECB 473 Data Network Architecture and Electronics Lecture 3 Packet Processing Functions.
An Architecture-Based Approach to Self-Adaptive Software Presenters Douglas Yu-cheng Su Ajit G. Sonawane.
Introduction and Overview “the grid” – a proposed distributed computing infrastructure for advanced science and engineering. Purpose: grid concept is motivated.
© 2007 Pearson Education Inc., Upper Saddle River, NJ. All rights reserved.1 Computer Networks and Internets with Internet Applications, 4e By Douglas.
PERFORMANCE EVALUATION OF ACADEMIC LIBRARIES IMPLEMENTATION MODEL
In-Band Flow Establishment for End-to-End QoS in RDRN Saravanan Radhakrishnan.
RETSINA: A Distributed Multi-Agent Infrastructure for Information Gathering and Decision Support The Robotics Institute Carnegie Mellon University PI:
A semantic learning for content- based image retrieval using analytical hierarchy process Speaker : Kun Hsiang.
Chapter 19 Binding Protocol Addresses (ARP) Chapter 20 IP Datagrams and Datagram Forwarding.
Network Enabled Capability Through Innovative Systems Engineering Service Oriented Integration of Systems for Military Capability Duncan Russell, Nik Looker,
On Fairness, Optimizing Replica Selection in Data Grids Husni Hamad E. AL-Mistarihi and Chan Huah Yong IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS,
CS335 Networking & Network Administration Tuesday April 27, 2010.
1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:
Computerized Multiple Criteria Decision Making Model for Projects Planning and Implementation By Ali Reda Al-Jaroudi Presented by: Jihad Farhat.
«Enhance of ship safety based on maintenance strategies by applying of Analytic Hierarchy Process» DAGKINIS IOANNIS, Dr. NIKITAKOS NIKITAS University of.
University of Kaiserslautern, Germany Department of Computer Science Integrated Communication Systems ICSY SONATE Euro-NF PhD Course.
LAN Overview (part 2) CSE 3213 Fall April 2017.
Introduction to the Mobile Security (MD)  Chaitanya Nettem  Rawad Habib  2015.
MobSched: An Optimizable Scheduler for Mobile Cloud Computing S. SindiaS. GaoB. Black A.LimV. D. AgrawalP. Agrawal Auburn University, Auburn, AL 45 th.
Computer Architecture Computational Models Ola Flygt V ä xj ö University
1 Dr. Markus Hillenbrand, ICSY Lab, University of Kaiserslautern, Germany A Generic Database Web Service for the Venice Service Grid Michael Koch, Markus.
Jason Chen, Ph.D. Professor of MIS School of Business
University of Kaiserslautern Department of Computer Science Integrated Communication Systems ICSY Engaging Current and Prospective Internet.
1 1 Slide © 2004 Thomson/South-Western Chapter 17 Multicriteria Decisions n Goal Programming n Goal Programming: Formulation and Graphical Solution and.
The Architecture of Secure Systems Jim Alves-Foss Laboratory for Applied Logic Department of Computer Science University of Idaho By, Nagaashwini Katta.
University of Kaiserslautern Department of Computer Science Integrated Communication Systems ICSY EuroNF PhD Course on “Future Network.
PhD Topic Template Based Composition PhD Course 5 th March – 9 th March 2012, Kaiserslautern.
University of Kaiserslautern Department of Computer Science Integrated Communication Systems ICSY Selection of Communication Services.
Wireless Networks Breakout Session Summary September 21, 2012.
1 Heterogeneity in Multi-Hop Wireless Networks Nitin H. Vaidya University of Illinois at Urbana-Champaign © 2003 Vaidya.
Improving Capacity and Flexibility of Wireless Mesh Networks by Interface Switching Yunxia Feng, Minglu Li and Min-You Wu Presented by: Yunxia Feng Dept.
Budget-based Control for Interactive Services with Partial Execution 1 Yuxiong He, Zihao Ye, Qiang Fu, Sameh Elnikety Microsoft Research.
Can Cloud Computing be Used for Planning? An Initial Study Authors: Qiang Lu*, You Xu†, Ruoyun Huang†, Yixin Chen† and Guoliang Chen* from *University.
The Way Networks Work Computer Networks Kwangwoon University.
MAINTENANCE STRATEGY SELECTION BASED ON HYBRID AHP-GP MODEL SUZANA SAVIĆ GORAN JANAĆKOVIĆ MIOMIR STANKOVIĆ University of Niš, Faculty of Occupational Safety.
1 4/23/2007 Introduction to Grid computing Sunil Avutu Graduate Student Dept.of Computer Science.
Chapter 17 Internetworking: Concepts, Architecture, and Protocols
1 Computing Challenges for the Square Kilometre Array Mathai Joseph & Harrick Vin Tata Research Development & Design Centre Pune, India CHEP Mumbai 16.
Geneva, Switzerland, 11 June 2012 Socio-Economic Aware Design of Future Network Technology (Y.FNsocioeconomic) Martin Waldburger, University of Zurich,
Wireless communications and mobile computing conference, p.p , July 2011.
An Architecture and Prototype Implementation for TCP/IP Hardware Support Mirko Benz Dresden University of Technology, Germany TERENA 2001.
StrideBV: Single chip 400G+ packet classification Author: Thilan Ganegedara, Viktor K. Prasanna Publisher: HPSR 2012 Presenter: Chun-Sheng Hsueh Date:
Group member: Kai Hu Weili Yin Xingyu Wu Yinhao Nie Xiaoxue Liu Date:2015/10/
Computer Science and Engineering - University of Notre Dame Jimmy Neutron CSE 40827/60827 – Ubiquitous Computing December 9, 2009 Project Presentation.
Review of Parnas’ Criteria for Decomposing Systems into Modules Zheng Wang, Yuan Zhang Michigan State University 04/19/2002.
C HU H AI C OLLEGE O F H IGHER E DUCATION D EPARTMENT O F C OMPUTER S CIENCE Preparation of Final Year Project Report Bachelor of Science in Computer Science.
Constructing the PAHP-based Decision Support System by Considering the Ambiguity in Decision Making Norihiro Saikawa Department of Computer and Information.
ITU workshop Quality of Service and Quality of Experience of Multimedia Applications and Services Haarlem/Amsterdam, 9-11 May 2016.
Design for a generic knowledge base for autonomic QoE optimization in multimedia access networks September 9, 2008 Bong-Kyun Lee Dept. of Information and.
An Overview When Connecting to Yaskawa Drives Date: 8/14/06, Rev: PP.AFD.26.
Network Layer COMPUTER NETWORKS Networking Standards (Network LAYER)
Modelling and Solving Configuration Problems on Business
The Development Process of Web Applications
A Scoring Model for Job Selection
Algorithms for Big Data Delivery over the Internet of Things
Congestion Control in Wireless Network Implementation
Anne Pratoomtong ECE734, Spring2002
*current controlled assessment plans are unknown
WLAN-3G Interworking for Future High Data Rate Networks
Good Morning 1/17/2019.
Agenda for This Week Monday, April 25 AHP Wednesday, April 27
Software Architecture
Model-based Adaptation for Self-Healing Systems David Garlan, Bradley Schmert ELSEVIER Sciences of Computer Programming 57 (2005) 이경렬
Presentation transcript:

University of Kaiserslautern Department of Computer Science Integrated Communication Systems ICSY Variable Application Requirements Lead to the Selection of Communication Services 27 th October 2011 Rahamatullah Khondoker, Bernd Reuther and Paul Müller

2 Rahamatullah Khondoker, University of Kaiserslautern Outline  Motivation  Description of Requirements and Offerings  Service Selection  Conclusion

3 Rahamatullah Khondoker, University of Kaiserslautern Motivation  The number of Internet applications are increasing, each with its specific requirements  Future networks could evolve by providing a variety of virtual networks Ethernet demands capabilities WLAN 3G 4G 2G2G 2G2G

4 Rahamatullah Khondoker, University of Kaiserslautern Motivation  The number of Internet applications are increasing, each with its specific requirements  Future networks could also evolve by providing a variety of protocol stacks Design-time Conventional TCP/IP UDP/IP SCTP/IP … Conventional TCP/IP UDP/IP SCTP/IP … Partial runtime Runtime S&C demands capabilities

5 Rahamatullah Khondoker, University of Kaiserslautern Motivation  The evolution of the network can be achieved by  decoupling applications from the networks, and  selecting the best network or protocol automatically based on the application requirements Solution: Description of Requirements and Offerings Solution: Service Selection

Description of Requirements and Offerings

7 Rahamatullah Khondoker, University of Kaiserslautern Communication Service  A communication service  can be seen as a set of visible effects of the underlying implementation of a protocol, mechanism or (virtual) network  hides implementation mechanisms  Examples of effects Reliable transmission Addressing Security Routing Loss Detection Loss Reduction Loop Avoidance Connection Management etc.

8 Rahamatullah Khondoker, University of Kaiserslautern Description of Requirements and Offerings Ref. 1. R. Khondoker, E. M. Veith, and P. Mueller, “A description language for communication services of future network architectures,” Will be Published in the Proceedings of the Network of Future, Paris, France, 2011.

9 Rahamatullah Khondoker, University of Kaiserslautern Description of Requirements and Offerings  This construct allows the selection process to  choose both fine-grained (a protocol) and coarse-grained services (protocol groups, (virtual) networks) in a homogeneous way  be flexible  select an appropriate service by matching the description of the offered service with the requirement because the same elements/components are used as newly developed services or application requirements can be described as both are described using the same construct

Service Selection

11 Rahamatullah Khondoker, University of Kaiserslautern Service Selection Process Fig 1. Service Selection Process  The aim of the selection process is to choose the best service based on given application requirements and the operating environment

12 Rahamatullah Khondoker, University of Kaiserslautern Service Selection Process  Selecting the best service using a single effect such as delay is trivial  However, communication services have multiple effects which are depedent on each other Fig 2. Interdependencies among the effects

13 Rahamatullah Khondoker, University of Kaiserslautern Service Selection: Methodology  Service Selection Methodology  Selecting a service by comparing more than one criteria is a multi- criteria decision making problem  For solving such a problem, we need Multiple Criteria Decision Analysis (MCDA) methods Several algorithms (MAUT, AHP, ELECTRE III, Evamix) exist for doing this  Only AHP allows interdependent criteria [Ref 2]  We used Analytic Hierarchy Process (AHP) Checking consistency of evaluation measures Reduces biased behavior in decision making process  AHP must be adapted for automatic service selection Ref. 2. A. de Montis, P. D. Toro, B. Droste-Franke, I. Omann, and S. Stagl, “Assessing the quality of different mcda methods,” 2000.

14 Rahamatullah Khondoker, University of Kaiserslautern Service Selection: AHP Fig. Analytic Hierarchy Process (AHP) Absolutely More Absolutely Less or Moderately Less Moderately More Equal Fig. Pairwise comparison scale

15 Rahamatullah Khondoker, University of Kaiserslautern Service Selection: Usage of AHP  AHP in service description and selection  Input A set of effects  Requirements Pairwise priority assignment Calculate one priority for each effect  Offers Pairwise priority assignment  This requires a mapping mechanism which cannot be done by AHP Calculate one priority for each effect  Output A service with the highest priority value

16 Rahamatullah Khondoker, University of Kaiserslautern Service Selection  The priority assigned in requirements needs to be mapped to the offered services  Pairwise prioritization of services per effect  The mapping must be generic  The mapping should be monotonic  A linear mapping of measured values to prioritization is not adequate  An approach for mapping is proposed to use monotonic interpolation/extrapolation +/ Hints Measured value Measured value of offers Priority Fig. Values in terms of hints

17 Rahamatullah Khondoker, University of Kaiserslautern Example: AHP in Service Selection Service2 Throughput Service1 Delay Offerings Application Requirements DelayThroughput AHP Service1Service2 Delay = 50msDelay = 100ms Throughput = 4MbpsThroughput = 1Mbps (Delay, Throughput) = +9 MinScale = -9 MaxScale = +9 Service1

18 Rahamatullah Khondoker, University of Kaiserslautern Summary and Outlook  Applications use the network differently, therefore they have different network requirements  At the same time, networking capabilities and protocols make advances  We have seen how applications can make use of advancing network capabilities  Describing requirements and offerings  Supports the parallel development of both applications and communication services  supports evolution of the Internet  Service selection process  can use the protocols as soon as they emerge

Thanks for your attention Any questions, comments or concerns?

Integrated Communication Systems ICSY University of Kaiserslautern Department of Computer Science P.O. Box 3049 D Kaiserslautern M. Rahamatullah Khondoker, M.Sc. Phone:+49 (0) Fax:+49 (0) Internet: