NSA RA SM PA SM RA SM NSA PA SM NSA RA SM PA SM NRM NSI messages Input/output internal to an NSA PA/RA state machines which only handles message exchange.

Slides:



Advertisements
Similar presentations
DISTRIBUTED COMPUTING PARADIGMS
Advertisements

© 2006 Open Grid Forum Network Services Interface Introduction to NSI Guy Roberts.
NSI/NML Resource and Topology Issues OGF Munich March 2010.
State Machines An approach to assembler coding. Intro State Machines are an integral part of software programming. State machines make code more efficient,
Service Bus Service Bus Access Control.
The Build-up of the Red Sequence at z
Lawrence Berkeley National LaboratoryU.S. Department of Energy | Office of Science Network Service Interface (NSI) Inder Monga Co-chair, Network Services.
© 2006 Open Grid Forum Network Service Interface in a Nut Shell GEC 19, Atlanta, GA Presenter: Chin Guok (ESnet) Contributors: Tomohiro Kudoh (AIST), John.
Lab 9 CIS 370 Umass Dartmouth.  A pipe is typically used as a one-way communications channel which couples one related process to another.  UNIX deals.
Standard Workflow Scheme v2.0. This is an interactive presentation of the Standard Workflow Scheme v2.0. Feel free to click on the boxes to see the possible.
Flip - flops. We begin our study of such circuits be discussing the elements necessary to implement the “storage” portion of sequential systems. I present.
1 The Marketing Story A single protocol –Exploration = confirmation of reachability = quick check –Works the same way for the current or other pairs Efficient.
Using Flowcharts. Sample Flowchart (without text) 2.
EECS 20 Chapter 3 Sections Defining Signals and Systems Last time we Found ways to define functions and systems Defined many example systems Today.
©The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 4 th Ed Chapter Lecture 1 Introduction to Computers and Object-
Representing Systems Sixth Meeting. Modeling Systems Models block-diagram Used throughout engineering Represents behavior and structure of systems. Only.
19-Aug-15 About the Chat program. 2 Constraints You can't have two programs (or two copies of the same program) listen to the same port on the same machine.
Exposure C++ Chapter IV Introduction to C++ Programs.
Simple Functions and Names Sec 9-4 Web Design. Objectives The student will: Know how to create a simple function in Python. Know how to call a function.
SugarCRM Use Case: Plans 1. Reminder When a service template is deployed, its implementation artifacts are deployed – From that time on, the operations.
1 Kyung Hee University Statecharts Spring Kyung Hee University Specifying Objects’ Behaviour  Interaction diagrams show message-passing behaviour.
Internet & World Wide Web How to Program, 5/e. © by Pearson Education, Inc. All Rights Reserved.
© 2006 Open Grid Forum Network Services Interface OGF 32, Salt Lake City Guy Roberts, Inder Monga, Tomohiro Kudoh 16 th July 2011.
Computer Science: A Structured Programming Approach Using C1 2-7 Input/Output Although our programs have implicitly shown how to print messages, we have.
State Table Problem #1 An electronic lock is controlled by a keypad, which has three buttons labeled A, B, and R. The keypad is restricted such that, at.
Practical Object-Oriented Design with UML 2e Slide 1/1 ©The McGraw-Hill Companies, 2004 PRACTICAL OBJECT-ORIENTED DESIGN WITH UML 2e Chapter 6: Restaurant.
© 2006 Open Grid Forum Network Services Interface Document roadmap, April 2014 Guy Roberts, Chin Guok, Tomohiro Kudoh.
LESSON 7.1 Functions To investigate the concept of function through secret codes.
Function Notation and Making Predictions Section 2.3.
“Time” in the NSI Protocol Two notions of “Time” are important to NSI Connection Service – Absolute time Globally Coordinated Time and Date, “UTC” time.
1 Network Services Interface Connection Service v2.0 Tomohiro Kudoh (AIST) (OGF NSI-WG)
NSI Service Definition Federation of providers A group of network providers get together and decide that they wish to offer a multi-domain connection services.
© 2006 Open Grid Forum Network Services Interface CS Errata Guy Roberts, Chin Guok, Tomohiro Kudoh 29 Sept 2015.
1 Network Services Interface An Interface for Requesting Dynamic Inter- datacenter Networks Tomohiro Kudoh (AIST) Guy Roberts (DANTE) Inder Monga (ESnet)
© 2007 Open Grid Forum NSI CS Protocol State Machine Message Handling OGF 37.
© 2006 Open Grid Forum Network Services Interface Policy-based routing enforcement John MacAuley, ESnet 4 th February 2015.
Requester NSA Provider NSA & NRM Transport plane X = clock skew Y = Prov. delay ProvNSA initiates provisioning at t=A’-X-M-Y Provisioning occurs at t=A-M.
Lawrence Berkeley National LaboratoryU.S. Department of Energy | Office of Science Network Service Interface: Concepts and Architecture Inder Monga Guy.
Protocol = messaging + semantics – Arlington state machine is for messaging – Berkeley state machines is for semantics Issue of Arlington state machine.
GEANT OpenCall – NSI CONTEST NSI CONTEST – Demonstrator Giacomo Bernini Nextworks GENI Networking Conference 22, March 2015, Washington DC.
OGF NSI CS Protocol State Machine Converged single view July 16, 2011.
OGF NSI CS Protocol State Machine
(OGF NSI-WG co-chairs)
BoD workshop Cambridge
Inder Monga Co-chair, OGF NSI-WG
Concurrency.
NSI Topology Thoughts on how topology fits into the NSI architecture
NSI wg Architecture Elements
NSI Service Definition
Network Services Interface
Proposal for SwitchingService (SS)
2-1 Relations and Functions
Topics discussed in this section:
MapReduce Computing Paradigm Basics Fall 2013 Elke A. Rundensteiner
Network Services Interface
Protocol Basics.
VoiceThread for students!
Introduction to Sequential Circuits
Data- PowerPoint months
Blinkers ++ Team 5.
Programming Project #1 Command Shell
COMP60621 Fundamentals of Parallel and Distributed Systems
Programming Project #1 Fork and Command Shell
CHAPTER 17 The Report Writer Module
Interrupt handling Explain how interrupts are used to obtain processor time and how processing of interrupted jobs may later be resumed, (typical.
АВЛИГАТАЙ ТЭМЦЭХ ҮНДЭСНИЙ ХӨТӨЛБӨР /танилцуулга/
COMP60611 Fundamentals of Parallel and Distributed Systems
CMSC 202 Exceptions.
Chapter 2 part #1 C++ Program Structure
Sample Proofs 1. S>-M A 2. -S>-M A -M GOAL.
Presentation transcript:

NSA RA SM PA SM RA SM NSA PA SM NSA RA SM PA SM NRM NSI messages Input/output internal to an NSA PA/RA state machines which only handles message exchange and sequence (no behavior of NSA are modeled in the SM)

Reservi ng Reserv ed In Service Provisi oning Releasi ng Input Output red : an input/output event which is an NSI message blue : an input/output event which is not an NSI message >: Downstream input/output <: Upstream input/output rsv: reserve, prov: provision, rel: release, cncl: cancel.rq : request,.cf: confirm, gr: granted, ng: not granted Initial Requestor Agent (RA) messaging state machine Termin ated Any state Canceli ng <prov.cf <provision_complete <rsv.gr <reserve_ok <rsv.ng <reserve_ng >reserve_start >rsv.rq <rel.cf <release_complete >release_start >rel.rq >provision_start >prov.rq >cancel_start >cncl.rq <cncl.cf <cancel_complete RA SM Not necessary?

Reservi ng Reserv ed In Service Provisi oning Releasi ng >prov.rq >provision_start <provision_complete <prov.cf <reserve_ok <rsv.gr <reserve_ng <rsv.ng >rsv.rq >reserve_start <release_complete <rel.cf >rel.rq >release_start Initial >cncl.rq >cancel_start <cancel_complete <cncl.cf Provider Agent (PA) messaging state machine Termin ated Any state Canceli ng Input Output red : an input/output event which is an NSI message blue : an input/output event which is not an NSI message >: Downstream input/output <: Upstream input/output rsv: reserve, prov: provision, rel: release, cncl: cancel.rq : request,.cf: confirm, gr: granted, ng: not granted PA SM Not necessary?

NSA PA SM RA SM NSI messages Input/output internal to an NSA Example: A middle NSA which does nothing but just pass messages Note: this example is shown only to make the concept of PA/RA SM clear (i.e. PA/RA SM do not model behavior)

NSA RA SM PA SM RA SM NSA PA SM NSA RA SM PA SM NRM UR AG UP AG Example: NS with Ultimate Requester(UR), Ultimate Provider(UP) and Aggregator (AG)

Initial Schedu led Idle In Service Auto Start Termin ated >provision_start (start_time) (provision) <provision_complete >provision_start (provision) <provision_complete >reserve_start, (reservation ok) <reserve_ok >release_start (release) <release_complete (start_time)(end_time) (cancel) Input Output blue : an input/output event which is not an NSI message >: Downstream input/output <: Upstream input/output (event): internal event start_time: start time timer event end_time: end time timer event,: “all” condition Sample Ultimate Provider function >reserve_start, (reservation ng) <reserve_ng (end_time) (release) (cancel) >cancel_start (cancel) <cancel_complete Any state Not necessary?

Reservi ng Reserv ed In Service Provisi oning Releasi ng Initial >cancel_start >cancel_start* <cancel_complete* <cancel_complete Termin ated Any state Canceli ng >provision_request >provision_request* <provision_complete* <provision_complete <release_complete* <release_complete >release_request >release_request* <reserve_complete* <reserve_complete <reserve_ng& <reserve_ng >cancel_start* >reserve_request >reserve_request* Sample Aggregator function Input Output blue : an input/output event which is not an NSI message >: Downstream input/output <: Upstream input/output *: for input, receive from all children for output, send to all children &: received one or more reserve_ng Note: here, downstream agent is assumed to return cancel_complete (or ignore cancel_request for the orange case) if there is no corresponding reservation. Not necessary?

Backup Don’t see the following slides unless they become necessary during discussion. They may lead confusion.

NSA NRM UR AG UP AG If we do not introduce PA/RA state machines, UR, AG, UP are modeled to directly send/receive NSI messages

Initial Schedu led Idle In Service Auto Start Termin ated >prov.rq (start_time) (provision) <prov.cf >prov.rq (provision) <prov.cf >rsv.rq, (reservation ok) <rsv.ok >rel.rq (release) <rel.cf (start_time)(end_time) (cancel) Input Output red : an input/output event which is an NSI message >: Downstream input/output <: Upstream input/output rsv: reserve, prov: provision, rel: release, cncl: cancel.rq : request,.cf: confirm, gr: granted, ng: not granted (event): internal event,: “all” condition Sample Ultimate Provider with NSI messages >rsv.rq, (reservation ng) <rsv.ng (end_time) (release) (cancel) >cncl.rq (cancel) <cncl.cf Any state Not necessary?

Reservi ng Reserv ed In Service Provisi oning Releasi ng Initial >cncl.rq >cncl.rq* <cncl.cf* <cncl.cf Termin ated Any state Canceli ng >prov.rq >prov.rq* <prov.cf* <prov.cf <rel.cf* <rel.cf >rel.rq >rel.rq* <rsv.cf* <rsv.cf <rsv.ng& <rsv.ng >cncl.rq* >rsv.rq >rsv.rq* Sample Aggregator function with NSI messages Input Output red : an input/output event which is an NSI message >: Downstream input/output <: Upstream input/output rsv: reserve, prov: provision, rel: release, cncl: cancel.rq : request,.cf: confirm, gr: granted, ng: not granted *: for input, receive from all children for output, send to all children &: received one or more rcv.ng Note: here, downstream agent is assumed to return cncl.cf (or ignore cncl.rq for the orange case) if there is no corresponding reservation. Not necessary?