Computer Networks Fall, 2007 Prof Peterson. CIS 235: Networks Fall, 2007 Western State College  What is “store and forward”?  What is a buffer / queue?

Slides:

Advertisements

Similar presentations

Interconnection Networks: Flow Control and Microarchitecture.

Advertisements

Traffic and routing. Network Queueing Model Packets are buffered in egress queues waiting for serialization on line Link capacity is C bps Average packet.

1 IK1500 Communication Systems IK1330 Lecture 3: Networking Anders Västberg

Spring 2000CS 4611 Introduction Outline Statistical Multiplexing Inter-Process Communication Network Architecture Performance Metrics.

Router Architecture : Building high-performance routers Ian Pratt

James 1:5 If any of you lacks wisdom, he should ask God, who gives generously to all without finding fault, and it will be given to him.

CS 381 Introduction to computer networks Chapter 1 - Lecture 3 2/5/2015.

Module 3.4: Switching Circuit Switching Packet Switching K. Salah.

What's inside a router? We have yet to consider the switching function of a router - the actual transfer of datagrams from a router's incoming links to.

CIS 235: Networks Fall, 2007 Western State College Welcome to CIS 235 Computer Networks Fall, 2007 Prof Peterson.

Computer Networks Fall, 2007 Prof Peterson. CIS 235: Networks Fall, 2007 Western State College  What are the main layers? What happens at each?

CIS 235: Networks Fall, 2007 Western State College Welcome to CIS 235 Computer Networks Fall, 2007 Prof Peterson.

Lecture 2 Introduction 1-1 Chapter 1: roadmap 1.1 What is the Internet? 1.2 Network edge  end systems, access networks, links 1.3 Network core  circuit.

Networking Based on the powerpoint presentation of Computer Networking: A Top Down Approach Featuring the Internet, Third Edition, J.F. Kurose and K.W.

CIS 235: Networks Fall, 2007 Western State College Welcome to CIS 235 Computer Networks Fall, 2007 Prof Peterson.

William Stallings Data and Computer Communications 7th Edition

Network Delays, Statistical Multiplexing

CIS 235: Networks Fall, 2007 Western State College Computer Networks Fall, 2007 Prof Peterson.

Lecture Internet Overview: roadmap 1.1 What is the Internet? 1.2 Network edge  end systems, access networks, links 1.3 Network core  circuit switching,

Lecture Internet Overview: roadmap 1.1 What is the Internet? 1.2 Network edge  end systems, access networks, links 1.3 Network core  circuit switching,

1: Introduction1 Part I: Introduction Goal: r get context, overview, “feel” of networking r more depth, detail later in course r approach: m descriptive.

Introduction 1-1 Lecture 3 Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012 CS3516: These slides.

Introduction 1-1 Chapter 1: roadmap 1.1 What is the Internet? 1.2 Network edge  end systems, access networks, links 1.3 Network core  circuit switching,

Slides originally from Professor Williamson at U Calgary1-1 Introduction Part II  Network Core  Delay & Loss in Packet-switched Networks  Structure.

Introduction 1-1 Chapter 1 Part 2 Network Core These slides derived from Computer Networking: A Top Down Approach, 6 th edition. Jim Kurose, Keith Ross.

Instructor: Christopher Cole Some slides taken from Kurose & Ross book IT 347: Chapter 1.

1 Kommunikatsiooniteenuste arendus IRT0080 Loeng 7 Avo Ots telekommunikatsiooni õppetool, TTÜ raadio- ja sidetehnika inst.

How do loss and delay occur?

Introduction 1-1 Chapter 1 Introduction Computer Networking: A Top Down Approach, 5 th edition. Jim Kurose, Keith Ross Addison-Wesley, April 2009.

1 Chapter 16 Protocols and Protocol Layering. 2 Protocol  Agreement about communication  Specifies  Format of messages (syntax)  Meaning of messages.

Computer Networks Performance Metrics. Performance Metrics Outline Generic Performance Metrics Network performance Measures Components of Hop and End-to-End.

The Way Networks Work Computer Networks Kwangwoon University.

1 Optical Burst Switching (OBS). 2 Optical Internet IP runs over an all-optical WDM layer –OXCs interconnected by fiber links –IP routers attached to.

RSC Part I: Introduction Redes y Servicios de Comunicaciones Universidad Carlos III de Madrid These slides are, mainly, part of the companion slides to.

COP 4930 Computer Network Projects Summer C 2004 Prof. Roy B. Levow Lecture 3.

1 Optical Packet Switching Techniques Walter Picco MS Thesis Defense December 2001 Fabio Neri, Marco Ajmone Marsan Telecommunication Networks Group

Codes, Peers and Mates Media processing meets future networks EU Workshop on thematic priorities in Networked Media Brussels January 19 th 2010 Ebroul.

Fall 2001CS 6401 Introduction to Networking Outline Networking History Statistical Multiplexing Performance Metrics.

Information Networks COMT 625 Hans Kruse. COMT Hans Kruse2 What is a network? Nodes End (User) Nodes Interior (Network) Nodes Links.

CS 3830 Day 4 Introduction 1-1. Announcements  No office hour 12pm-1pm today only  Quiz on Friday  Program 1 due on Friday (put in DropBox on S drive)

EEC-484/584 Computer Networks

Tufts Wireless Laboratory School Of Engineering Tufts University Paper Review “An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks”,

Ch 1. Computer Networks and the Internet Myungchul Kim

Chapter 11.4 END-TO-END ISSUES. Optical Internet Optical technology Protocol translates availability of gigabit bandwidth in user-perceived QoS.

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

Internet Traffic Engineering Motivation: –The Fish problem, congested links. –Two properties of IP routing Destination based Local optimization TE: optimizing.

Jia Uddin Embedded System Lab.  MPLS  IMANET  IMANET network model  Proposed model of IMANET with MPLS  Conclusion.

A special acknowledge goes to J.F Kurose and K.W. Ross Some of the slides used in this lecture are adapted from their original slides that accompany the.

CSEN 404 Introduction to Networks Amr El Mougy Lamia AlBadrawy.

Chapter 10 Congestion Control in Data Networks and Internets 1 Chapter 10 Congestion Control in Data Networks and Internets.

Introduction1-1 Data Communications and Computer Networks Chapter 1 CS 3830 Lecture 3 Omar Meqdadi Department of Computer Science and Software Engineering.

Network Processing Systems Design

Introduction to Networks

Lec # 22 Data Communication Muhammad Waseem Iqbal.

CS 381 Introduction to computer networks

RSC Part II: Network Layer 1. Basic Concepts

Ken Gunnells, Ph.D. - Networking Paul Crigler - Programming

The University of Adelaide, School of Computer Science

Chapter 1: roadmap 1.1 What is the Internet? 1.2 Network edge

Comp 365 Computer Networks Chapter 1 Part 2 Network Core Fall 2014

Chapter 11 Inventing the Internet

Network Core and QoS.

EEC-484/584 Computer Networks

Network Systems and Throughput Preservation

In-network computation

Network Basics and Architectures Neil Tang 09/05/2008

Network Core and QoS.

Comp 410 AOS Packet Switching

Presentation transcript:

Computer Networks Fall, 2007 Prof Peterson

CIS 235: Networks Fall, 2007 Western State College  What is “store and forward”?  What is a buffer / queue?  What is packet loss? How does packet loss manifest itself? What is a tier-2 ISP? What does it mean to “peer with” an ISP? Who gets the money you pay for your Internet connection? What is a POP? What is statistical multiplexing?

CIS 235: Networks Fall, 2007 Western State College What is the analogy in the text regarding routing in a packet switching network? What is a tier-1 ISP? What sort of link speeds do the tier-1’s have?  What sort of delays does a packet encounter at each node?  Which of these depend on the underlying technology?  Which depend on current network conditions?  What is “traffic intensity”?

CIS 235: Networks Fall, 2007 Western State College  What is instantaneous throughput? Average throughput?  What is a bottleneck link?  When things go slow, what are the two likely causes?  Does the Internet backbone have excess capacity?

CIS 235: Networks Fall, 2007 Western State College  What is a layered architecture?  How do the layers connect with each other?  How would layers be represented in a programming language?  What programming language feature corresponds to encapsulation?  What is a “service model”?  Why did some engineers argue against layering?  Is this book top down or bottom up?

CIS 235: Networks Fall, 2007 Western State College  What sort of applications do we find at the application layer?  What protocols run here?  What services does this layer need from the one below?  What is the data transmitted at this layer called?  Where does this layer run?