Providing guaranteed packet delivery time in SpaceWire networks Session: SpaceWire networks and protocols Yuriy Sheynin, Elena Suvorova, St. Petersburg.

Slides:

Advertisements

Similar presentations

Technische universiteit eindhoven 1 Problem 16: Design-space Exploration Jeroen Voeten, Bart Theelen Eindhoven University of Technology Embedded Systems.

Advertisements

Exercises and Solutions Lecture 1

Ch 20. Internet Protocol (IP) Internetworking PHY and data link layers operate locally.

Switching Techniques In large networks there might be multiple paths linking sender and receiver. Information may be switched as it travels through various.

Chapter 9 Introduction to MAN and WAN

1 Routing Protocols I. 2 Routing Recall: There are two parts to routing IP packets: 1. How to pass a packet from an input interface to the output interface.

ECE358: Computer Networks Fall 2014

Outline  Recap Network components & basic mechanisms Routing Flow control  Continue Basic queueing analysis Construct routing table.

Synchronous Links/Networks Modems are asynchronous - penalized by start bits and stop bits on each character (and dead time) Synchronous Networks recover.

Chapter 18 Introduction to Network Layer 18.# 1

NETWORK LAYER (1) T.Najah AlSubaie Kingdom of Saudi Arabia Prince Norah bint Abdul Rahman University College of Computer Since and Information System NET331.

A Distributed Algorithm for the Dead End Problem of Location Based Routing in Sensor Networks Le Zou, Mi Lu, Zixiang Xiong, Department of Electrical Engineering,

Z-MAC: a Hybrid MAC for Wireless Sensor Networks Injong Rhee, Ajit Warrier, Mahesh Aia and Jeongki Min Dept. of Computer Science, North Carolina State.

1 SpaceWire Router ASIC Steve Parkes, Chris McClements Space Technology Centre, University of Dundee Gerald Kempf, Christian Toegel Austrian Aerospace.

1 Message passing architectures and routing CEG 4131 Computer Architecture III Miodrag Bolic Material for these slides is taken from the book: W. Dally,

An Analysis of the Optimum Node Density for Ad hoc Mobile Networks Elizabeth M. Royer, P. Michael Melliar-Smith and Louise E. Moser Presented by Aki Happonen.

1 ENTS689L: Packet Processing and Switching Buffer-less Switch Fabric Architectures Buffer-less Switch Fabric Architectures Vahid Tabatabaee Fall 2006.

Chapter 10 Introduction to Wide Area Networks Data Communications and Computer Networks: A Business User’s Approach.

Updated 1/20021 SMDS Nirmala Shenoy Information technology Department Rochester Institute of Technology.

1 Lecture 24: Interconnection Networks Topics: communication latency, centralized and decentralized switches (Sections 8.1 – 8.5)

William Stallings Data and Computer Communications 7 th Edition (Selected slides used for lectures at Bina Nusantara University) Transport Layer.

Yanyan Yang, Yunhuai Liu, and Lionel M. Ni Department of Computer Science and Engineering, Hong Kong University of Science and Technology IEEE MASS 2009.

1 A Topology Control Approach to Using Directional Antennas in Wireless Mesh Networks Umesh Kumar, Himanshu Gupta and Samir R. Das Department of Computer.

Connecting LANs, Backbone Networks, and Virtual LANs

SERIAL BUS COMMUNICATION PROTOCOLS

Switching Techniques Student: Blidaru Catalina Elena.

Network Layer Moving datagrams. How do it know? Tom-Tom.

8/28/2015  A. Orda, R. Rom, A. Segall, Design of Computer Networks Prof. Ariel Orda Room 914, ext 4646.

© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Network Layer ICMP and fragmentation.

Presentation on Osi & TCP/IP MODEL

Lecture 2 TCP/IP Protocol Suite Reference: TCP/IP Protocol Suite, 4 th Edition (chapter 2) 1.

Basic Transition Mechanisms for IPv6 Hosts and Routers -RFC 4213 Kai-Po Yang

DEVICES AND COMMUNICATION BUSES FOR DEVICES NETWORK

20.1 Chapter 20 Network Layer: Internet Protocol Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

12006 MAPLD International ConferenceSpaceWire 101 Seminar Distributed Interrupts for Real-Time Control in SpaceWire-Based On-Board Systems 2006 MAPLD International.

Data and Computer Communications Chapter 10 – Circuit Switching and Packet Switching (Wide Area Networks)

On the Cost/Delay Tradeoff of Wireless Delay Tolerant Geographic Routing Argyrios Tasiopoulos MSc, student, AUEB Master Thesis presentation.

1 Message passing architectures and routing CEG 4131 Computer Architecture III Miodrag Bolic Material for these slides is taken from the book: W. Dally,

Network and Communications Ju Wang Chapter 5 Routing Algorithm Adopted from Choi’s notes Virginia Commonwealth University.

Network-on-Chip Introduction Axel Jantsch / Ingo Sander

Data and Computer Communications Ninth Edition by William Stallings Data and Computer Communications, Ninth Edition by William Stallings, (c) Pearson Education.

Communications Services Connection Oriented Service  A connection is established  Data is sent or received over this connection  Connection may be terminated.

InterConnection Network Topologies to Minimize graph diameter: Low Diameter Regular graphs and Physical Wire Length Constrained networks Nilesh Choudhury.

TOOLSET FOR TEST AND VERIFICATION OF IP-BLOCKS WITH SPACEWIRE INTERFACE Session: SpaceWire Test and Verification Elena Suvorova St. Petersburg State University.

ECE466 - Tutorial Simple Delay and Throughput Analysis.

Interconnect simulation. Different levels for Evaluating an architecture Numerical models – Mathematic formulations to obtain performance characteristics.

A Method for Distributed Computation of Semi-Optimal Multicast Tree in MANET Eiichi Takashima, Yoshihiro Murata, Naoki Shibata*, Keiichi Yasumoto, and.

1 Computer Communication & Networks Lecture 21 Network Layer: Delivery, Forwarding, Routing Waleed.

McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Connecting Devices CORPORATE INSTITUTE OF SCIENCE & TECHNOLOGY, BHOPAL Department of Electronics and.

Hangguan Shan, Member, IEEE, Ho Ting Cheng, Student Member, IEEE, and Weihua Zhuang, Fellow, IEEE Cross-Layer Cooperative MAC Protocol in Distributed Wireless.

ICMPv6 Error Message Types Informational Message Types.

Team LDPC, SoC Lab. Graduate Institute of CSIE, NTU Implementing LDPC Decoding on Network-On-Chip T. Theocharides, G. Link, N. Vijaykrishnan, M. J. Irwin.

1 IEX8175 RF Electronics Avo Ots telekommunikatsiooni õppetool, TTÜ raadio- ja sidetehnika inst.

Delay in packet switched network. Circuit switching In Circuit switched networks the resources needed along a path (buffers and link transmission rate)

Introduction Computer networks: – definition – computer networks from the perspectives of users and designers – Evaluation criteria – Some concepts: –

1 Switching and Forwarding Sections Connecting More Than Two Hosts Multi-access link: Ethernet, wireless –Single physical link, shared by multiple.

Switching. Circuit switching Message switching Packet Switching – Datagrams – Virtual circuit – source routing Cell Switching – Cells, – Segmentation.

Data Communication Network Models

Lecture # 3: WAN Data Communication Network L.Rania Ahmed Tabeidi.

Exploring Random Access and Handshaking Techniques in Large- Scale Underwater Wireless Acoustic Sensor Networks Peng Xie and Jun-Hong Cui Computer Science.

Chapter 20 Network Layer: Internet Protocol Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

Exercises on Data Link Layer.

-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.

Congestion Control in Data Networks and Internets

Review of the SpaceFibre standard draft

Speaker : Che-Wei Chang

ECE 544 Protocol Design Project 2016

Chapter 3: Open Systems Interconnection (OSI) Model

EE 122: Intra-domain routing: Distance Vector

Data Communication and Computer Networks

Presentation transcript:

Providing guaranteed packet delivery time in SpaceWire networks Session: SpaceWire networks and protocols Yuriy Sheynin, Elena Suvorova, St. Petersburg State University of Aerospace Instrumentation 67, Bolshaya Morskaya st , St. Petersburg RUSSIA

In this presentation we evaluate The minimal distance between two transmission phases The interval between start of last packet transmission and end of transmission phase for TDMA communications based on time triggered mechanism global slot mechanism We compare these parameters for different topologies and evaluate real transmission rate and real throughput of links

The minimum distance between two sequential transmission phases (1) time-triggered communication: sources of difference between terminal nodes clocks Not in all cases we can place Time_codes source to centre of interconnection graph Not in all cases we can set same speed for all links in system (or symmetric speed for all paths from time_codes source to other nodes) For output links of one switch previous symbols could be differ and state of sending these symbols could be differ The minimal distance between transmission phases is equal to the maximal difference between terminal nodes clocks (1) (2) (3)

The minimum distance between two sequential transmission phases (2) Ts – the Time-code processing time in transit switch (1) Tb – time of one bit transmission for most slowly link, Tbi – for i link, (2,3) Tt - waiting to send previous code time(3) a – the max number of bits in previous symbol (14 or 10)(3) Ttdmax - the maximal delivery time for Time-code Ttdmin - the minimal delivery time for Time-code Ttmax maximum distance of local clocks in the system and the minimal distance between two sequential transmission phases Longest path, slowly links shortest path, rapid links

Interval between start of last packet transmission and end of transmission phase Tp Tp –whole packet transmission time Th - maximal header of packet transmission time Td - the maximal interval between arriving of header and of packet end to destination node Tb - the time of one bit transmission in transit link (Tbi – for input, Tbo – for output link) Zp - length of last packet, number of bytes Tsh – header processing time Ta – arbitration time + max output port waiting time in case when in one transmission phase some paths between source and destination nodes share links

Example 1 10Mbit/s 400Mbit/s Real transmission rate is 0.028Mbit/s Physical throughput of T0-S0 link Is equal to summary throughputs of T1-S1, … T40-S4 links Real transmission rate and throughput in 40 times less than potential

Example 2 Ttmax=3175 ns 400Mbit/s 10Mbit/s 126 data symbols in case of the transmission time for pairs includes to one slot is essentially differ this distribution is not rational in this case the big number of slots results to bid time will be lost because of inter slots intervals.

Conclusion For many different systems using of global slots leads to not rationale using of system resources: –In some cases the size of interval between two transmission phases is equal to time for transmission of packet in some network regions. –In some cases real network throughput is in ten times less than physically reachable

Thank you!