Buffered Data Processing Procedure Version of 17.09.2012 Comments MG / CCSDS Fall Meeting 2012 Recap on Previous Discussions Queue overflow processing.

Slides:



Advertisements
Similar presentations
1 Review Notes concerning Review Notes concerning Forward Frame Service & Process Data Operation/Procedure
Advertisements

FIPA Interaction Protocol. Request Interaction Protocol Summary –Request Interaction Protocol allows one agent to request another to perform some action.
More on Processes Chapter 3. Process image _the physical representation of a process in the OS _an address space consisting of code, data and stack segments.
IPv4 - The Internet Protocol Version 4
1 CNPA B Nasser S. Abouzakhar Queuing Disciplines Week 8 – Lecture 2 16 th November, 2009.
EE 4272Spring, 2003 Chapter 12 Congestion in Data Networks Effect of Congestion Control  Ideal Performance  Practical Performance Congestion Control.
TELE202 Lecture 8 Congestion control 1 Lecturer Dr Z. Huang Overview ¥Last Lecture »X.25 »Source: chapter 10 ¥This Lecture »Congestion control »Source:
William Stallings Data and Computer Communications 7 th Edition Chapter 13 Congestion in Data Networks.
Bridging. Bridge Functions To extend size of LANs either geographically or in terms number of users. − Protocols that include collisions can be performed.
CS 408 Computer Networks Congestion Control (from Chapter 05)
CSCE 515: Computer Network Programming Chin-Tser Huang University of South Carolina.
William Stallings Data and Computer Communications 7 th Edition (Selected slides used for lectures at Bina Nusantara University) Transport Layer.
G Robert Grimm New York University Receiver Livelock.
Error Checking continued. Network Layers in Action Each layer in the OSI Model will add header information that pertains to that specific protocol. On.
Backup and Recovery Part 1.
1 CMPT 471 Networking II ICMP © Janice Regan, 2012.
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Network Layer ICMP and fragmentation.
Sliding Window. Sliding window - Sender side Cumulative Acknowledgments Not sentSent, no ACKACK:edFree Sending buffer at the sender: Old data sent that.
Data Link Control Protocols
ARQ Mechanisms Rudra Dutta ECE/CSC Fall 2010, Section 001, 601.
Chapter 41 Processes Chapter 4. 2 Processes  Multiprogramming operating systems are built around the concept of process (also called task).  A process.
Reliable Communication in the Presence of Failures Based on the paper by: Kenneth Birman and Thomas A. Joseph Cesar Talledo COEN 317 Fall 05.
(Business) Process Centric Exchanges
Cross Support Services Area Cross Support Transfer Services Working Group Strawman Forward Frame CSTS Specification Technical Note (June 2010) John Pietras.
2000 년 11 월 20 일 전북대학교 분산처리실험실 TCP Flow Control (nagle’s algorithm) 오 남 호 분산 처리 실험실
©Ian Sommerville 2004Software Engineering, 7th edition. Chapter 20 Slide 1 Critical systems development 3.
Copyright Fujitsu & Savvion © 2000 ebXML Reliability Messaging A Proof of Concept Implementation Fujitsu Savvion Author: Jacques Durand
1 Process migration n why migrate processes n main concepts n PM design objectives n design issues n freezing and restarting a process n address space.
Copyright 2008 Kenneth M. Chipps Ph.D. Controlling Flow Last Update
LOCAL AREA NETWORKS. CSMA/CD Carrier Sense Multiple Access with Collision Detection The CSMA method does not specify the procedure following a collision.
Cross Support Services Area Cross Support Transfer Service Working Group Monitored Data Cross Support Transfer Service: Scope and Format of Monitored Data.
CS 4396 Computer Networks Lab
CSC 600 Internetworking with TCP/IP Unit 5: IP, IP Routing, and ICMP (ch. 7, ch. 8, ch. 9, ch. 10) Dr. Cheer-Sun Yang Spring 2001.
CE Operating Systems Lecture 2 Low level hardware support for operating systems.
Tracking Data CSTS v March - 3 April 2014 Noordwijkerhout, Netherlands John Pietras Global Science and Technology, Inc, Greenbelt, MD, USA.
Probabilistic Search Verification of the Go-Back-N Protocol Adeyemi Aladesawe Annjana Ramesh Lingxue Li Nanjun Lu.
CE Operating Systems Lecture 2 Low level hardware support for operating systems.
1 Y.Doat (ESA) March 2015 Guidelines Status Guidelines Status CSTS Framework March 2015.
Queuing Delay 1. Access Delay Some protocols require a sender to “gain access” to the channel –The channel is shared and some time is used trying to determine.
CSTS Generic Procedures Assessment of the Current Status and Proposal for Next Steps M.Goetzelmann
Data Processing Procedures CSTS Teleconference M. Götzelmann.
Spring Computer Networks1 Congestion Control Sections 6.1 – 6.4 Outline Preliminaries Queuing Discipline Reacting to Congestion Avoiding Congestion.
MD CSTS prototype status 2012 : MD user (NASA) based on NASA Fw development MD provider (CNES) based on ESA Fw development NASA/ESA Fw interoperability.
Formal Methods Project Design Yuanhui Luo yl3026, Ziwei Zhang zz2282, Yih-Nin Lai yl3030, Zhen Qiu zq2130.
Data Link Layer. Data link layer The communication between two machines that can directly communicate with each other. Basic property – If bit A is sent.
1 Lecture 15 Internet resource allocation and QoS Resource Reservation Protocol Integrated Services Differentiated Services.
Fall Meeting, November 11, 2015 Paul Pechkam, JPL/NASA
Chapter 10 Congestion Control in Data Networks and Internets 1 Chapter 10 Congestion Control in Data Networks and Internets.
Data Link Layer.
Calliope-Louisa Sotiropoulou FTK: E RROR D ETECTION AND M ONITORING Aristotle University of Thessaloniki FTK WORKSHOP, ALEXANDROUPOLI: 10/03/2014.
1 Transfer Service Specification Issues CCSDS September 2005 Meeting Atlanta.
Managing Retransmission Timers in Sleep Mode
Reliable Transmission
March 21, 2001 Recall we have talked about the Sliding Window Protocol for Flow Control Review this protocol A window of size I can contain at most I.
Managing Retransmission Timers in Sleep Mode
PUSH Flag A notification from the sender to the receiver to pass all the data the receiver has to the receiving application. Some implementations of TCP.
Congestion Control (from Chapter 05)
Process Description and Control
Congestion Control (from Chapter 05)
Process Description and Control
Distributed Systems CS
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
Transport Protocols: TCP Segments, Flow control and Connection Setup
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
Error Checking continued
Distributed Systems CS
Presentation transcript:

Buffered Data Processing Procedure Version of Comments MG / CCSDS Fall Meeting 2012 Recap on Previous Discussions Queue overflow processing Production Interrupted (processing failures) Further Issues (revisit earlier decisions?) WG DECISIONS

Recap: Previous Discussions & Decisions (1/2) Buffered DPP introduced to support – “AOS Forward Type” of processing Provider not to enforce strict sequence control In case of problems, just drop data unit and continue with next (recovery handled by higher level protocol) – Increased throughput by buffering (  experience in Orange Book prototyping) – Unconfirmed PD Operation to support buffering without the need to fundamentally change approach to CSTS operations CSTS Fall Meeting- BDPP2

Recap: Previous Discussions & Decisions (2/2) Results from the Spring Meeting – Specify the BDPP in a manner that is analogous to BDDP Complete mode with back-pressure Timely mode – discard data when the queue is full – Discard in Units of Transfer Buffer – The data in a TB are either processed completely or not at all – Exception: If processing of a data unit is affected by a fault, only this unit is discarded and other data units delivered with the same TB are still processed – Discard all data units that belong to the TB received earliest for which no data units have started processing yet – Individual Buffer overflow events (and data discarding) are not notified to the user: This avoids repetitive notifications if the queue full situation persists and new transfer buffers are arriving It is assumed that one or more monitored parameters will monitor quality of service (e.g. number of units lost)  creates a dependency on the MD CSTS? A service can add the notification if considered essential – Maximum queuing time not included in the FW BDPP, can be added by a service is needed – Maximum transfer buffer size is a managed parameter CSTS Fall Meeting- BDPP3

Queue Overflow in Timely Mode DA Meeting: discard all data units that have been included in the earliest Transfer Buffer received for which no data unit has started processing until there is enough room to accommodate a maximum sized TB. (YAGNI?) Proposal TR: On queue overflow discard as many of the oldest data units as needed to make room for the data units in the received buffer. – Will work, might be simpler for implementation – Violates the analogy with the return case – Makes discarding of data somewhat arbitrary – Limits the control of the user on how data shall be discarded Do we stick to the decision that no notification is sent? – If yes, add notes on the reason and the assumptions – Alternatively send notification only for the first set of data units discarded (rest overflow recorded flag when a TB is received without the need to discard data) CSTS Fall Meeting- BDPP4

Production Interrupted (Processing Failures) Processing when production changes to interrupted (processing of a data unit fails) should be addressed for both modes (even if we say the same as in the parent procedure) Parent procedure: – Discard a data unit that has started but not completed processing (might not know the status anyway) – Wait until the PS changes to operational again or the user stops the procedure For BDPP would we want to discard the remaining part of the units transmitted in the same transfer buffer? CSTS Fall Meeting- BDPP5

Further Issues … Maximum Queuing Time – Originally proposed by JP as better option than earliest and latest processing time – In DA decided not to use but to delegate the decision to the service using the procedure – Use would better align the return and forward case Transfer / process (with best effort) data of one TB as long a s a specified maximum latency is not exceeded Discard data in units of TB when the maximum latency is exceeded However, if adopted, then we must decide whether and how the user is informed if data are discarded when the latency limit is exceeded. Configuration Parameters – Always to be defined by the service specification (which may delegate to service management) – Should we have a list of configuration parameters for every procedure? (too late?) Specification style currently not quite in line with the other procedures in the framework Actions in state tables should be more explicit (not only expressed in prose) CSTS Fall Meeting- BDPP6

WG DECISIONS Shall the Transfer Buffer be considered as a group of Process Data Operations that should either be processed completely (with best effort) or not at all (YES) or should it be used to increase ground link throughput only (NO)? In case the PS changes to interrupted when a data unit is being processed discard only that data unit or all data units from the same TB that have not been processed yet? In case of input queue overflow discard all data units that were part of the earliest TB received for which no data units started processing until there is room for all data units within a maximum sized TB In case of input queue overflow discard as many of the oldest data units as needed to provide space for the data units in the TB received Do we want to define a maximum queuing time (maximum processing latency) after all data received within one TD are discarded unless at least one of the units started processing? Do we want to define a maximum queuing time (maximum processing latency) after that data units are discarded when processing has not yet started? Do we notify the user of every data unit / TB discarded because the maximum latency has been exceeded? Do we notify the user of an input queue data overflow event that caused data to be discarded? YES NO YESNO one UnitRemaining TB NO YES NO