CONGESTION CONTROL BY USING A BUFFERED OMEGA NETWORK
|
|
- Randolph Mathews
- 5 years ago
- Views:
Transcription
1 IADIS International Conference on Applied Computing CONGESTION CONTROL BY USING A BUFFERED OMEGA NETWORK Ahmad.H. ALqerem Dept. of Comp. Science ZPU Zarka Private University Zarka Jordan ABSTRACT Omega networks are used to connect processors and memory in large scalable multiprocessor systems. In this paper we use the omega network to connect the LANs to each other. Routers are used instead of switching elements. Buffers are used inside the routers to increase the throughput of the omega network and to prevent the internal loss of packets. The objective of this paper is to control the congestion by using a buffered omega network. This reflects the situation in an ATM environment where all packets (cells) have a fixed length. The results obtained from the study will help the network designers to choose the appropriate omega network architecture to control the congestion. KEYWORDS Omega network, congestion control, buffer size, number of LANs, time duration.. INTRODUCTION Congestion can be characterized by the presence of a large number of packets (load) being routed in all or portions of the subnet that exceeds its link and router capacities (resources) resulting in a performance slowdown []. All solutions are divided into two groups, open loop and closed loop. An open loop solution involves: Deciding when to accept new traffic Deciding when to discard packets and which ones Making scheduling changes at various points on the network. Solve the problem by good design - make sure congestion does not happen in the first place. Closed loop solutions are based on a feedback loop []: Monitor the system to detect when and where congestion occurs. Pass the information on to places where action can be taken. Adjust system operation to correct the problem. This paper introduces a new technique or method for controlling the congestion in virtual circuit subnets, by using Omega Networks, which can be classified as open loop system. Omega network is used to connect a large number of processors with memory [], but in this paper using the omega networks to connect the router with each others. Omega networks can be classified into two main categories, namely internally blocking and internally nonblocking []. In an internally nonblocking if given a permutation of two or more packets at its input it can route all these packets through the network without contention or collisions. An omega network is called internally blocking if two or more packets with distinct output port destination can t always be transferred to the output ports due to routing conflict within the omega network []. The contention occurs in omega network when more than one packet accesses the same internal link. Figure shows the internal blocking in a certain router inside the omega network. 9
2 ISBN: X IADIS Figure. Internally blocking. Each router has two buffers, with fixed lengths; packets are queued in those buffers until they can be forwarded to the next stage. They are implemented by using first-in-first-out (FIFO) queues. The aim of this paper is to study the performance of omega network with local fixed buffer lengths in order to reduce the congestion if it will occur. The simulator has the ability to test and counts all the packets the are generated, delivered, and discarded in different omega network shapes, the shape of omega network can be formatted by choosing number of stages in omega network, running time duration, number of simultaneous sending LANs, and buffer length or size. The paper is organized as follows: In section, omega network structure and behavior. In section, the simulator model. In section, experimental results. In section, the conclusion.. STRUCTURE AND BEHAVIOR OF OMEGA NETWORK The general schematic of omega network consisting of N input and M output is shown in Figure. input output Stage stage stage N- M- Figure. The schematic of a typical Omega This network consists of log N stages (where N is the number of input and also the number of output). Each stage of the omega network consists of an interconnection pattern that connects N inputs and M outputs, a link exists between input i and output j if the following is true: - J= i, i N / - i + N, N/ I N - Equation representation a left-rotation operation on the binary representation of i to obtain j. this interconnection pattern is called a perfect shuffle. Figure shows a perfect shuffle interconnection pattern for eight inputs and outputs. In each stage of an omega network, a perfect shuffle interconnection pattern feeds into a set of N/ switching elements. Each switch is in one of two connection modes. In one mode, the inputs are sent straight through to the outputs, as shown in Figure (a). This is called the pass-through connection. In the other mode, the inputs to the switching element are crossed over and then sent out, as shown in Figure (b). This is called the cross-over connection.
3 IADIS International Conference on Applied Computing Figure. A perfect shuffle interconnection for eight input and outputs. An omega network has N/ log N switching elements, and the cost of such a network grows as Θ (N log N). (a) (b) Figure. Two switching configuration of the * switch (a) pass-through; (b) Cross-over Figure shows an omega network for eight input. Input nodes of the network and the output nodes. Routing messages in an omega network is accomplished by using a simple scheme. Let s and t be the binary representations of the source and destination of the message. The message traverses the link to the first router. If the most significant bits of s and t are the same, then the packet is routed in pass- through mode by the switch. If these bits are different, then the packet is routed through in crossover mode. This scheme is repeated at the next switching stage using the next most significant bit. Traversing log N stages used all log N bits in the binary representation of s and t. figure shows packet routing over an eight-input omega network from input two() to seven () and from input six () to four ().[] Figure. A complete omega network connecting eight input and eight output
4 ISBN: X IADIS Omega network has some assumptions []: The traffic load of all inputs of the network is equal. All packets have the same size (like in ATM). Their destination outputs are distributed uniformly. That means every output of the network is with equal probability one of the destinations of a packet. Conflicts between packets are solved randomly with equal probabilities. Packets are removed from their destinations immediately after arrival. Routing is performed in pipeline manner. That means the routing process occurs in every stage in parallel.. THE SIMULATOR MODEL The old versions of omega network was designed without using buffers, so that the probability of blocking and loosing packets will be increased throughout the running of the system for long time, this will lead timeout the senders, resending the lost packets may increase the traffic which causes the congestion and decrease the performance of the system. The simulator is implemented using Java language. Java has emerged as an interesting language for multitasking programming. This design includes, among others, important aspects such as portability and architecture neutrality of Java code, or its multithreading facilities []. Designers can get an indication what is the performance will be after running the system for a certain amount of time. When you run the simulator you have to choose the size of omega network (i.e.: number of stages), duration time for running the system, size or length of the buffers, and number of LANs. Using the java.math.random() method to choose a random source and random destination. Packets will be generated and formatted by calling packing() method, figure shows the routed packet. Src Dest stage Message to be send Header Message Body Figure. Packet/cell format After packing the packet, routing is decided by calling route() method, the routing path is computed by applying XOR operation between the source and destination. pass through cross over This method will be called recursively until reach the destination, each time the packet or message will be buffered asynchronously, if two packets are arrived concurrently they will buffered, then forwarded according to their destination. Each LAN is simulated as a thread; this thread will generate messages according to time interval decided by the user. Finally all specified thread would start running concurrently by calling start()method. After finish execution the simulator show the total number of generated packets, delivered packets, and lost packets.. EXPERIMENTAL RESULTS This simulator is developed to measure or simulate the behavior of omega network, so that adding more length to buffers doesn t mean better performance in all cases, also increasing the number of stages leads to increase the delay. Figure draws the relation between omega network size and throughput, with fixed number of LANs and the time duration is fixed.
5 IADIS International Conference on Applied Computing 8 8 Omega Network Size Figure. versus omega network Increasing the number of stages lead to increase the delay, which will, causes to decrease the number of delivered packets. Let us now see the relation between the time duration and throughput with fixed number of LANs and buffer size. Increasing the time duration interval will cause to increase the number of delivered packets, so that this will increase the throughput, this is shown in figure 8. Time Duration (Seconds) Figure 8. Time duration versus Increasing number of LANs will increase the throughput, but we have to notice here we increasing the LANs concurrently with omega size, so the load will be spread all over the network stages, so that the throughput will be increased proportionally. This is shown in figure No. of LANs Figure 9. No. of LANs versus When the omega network has a fix size, and very small buffer length, but the number of LANs and time duration is increased, in this case many packets will be lost proportionally, in figure, we noticed the throughput is decreased because we have small buffers and many LANs with long time intervals are using the network.
6 ISBN: X IADIS No. of LANs Figure. Number of LANs versus. CONCLUSION In the conclusion, we can classify the Omega network as open loop system. By using a suitable length buffers results in delivering all the packets, eliminate the contention on the routers, and control the congestion, which reflects a high performance in the system. In contrast using small buffers with high traffic in the network leads to full the buffers and begin losing packets, which can lead to congestion. At the same time, using huge buffer size or very huge omega network size with normal traffic, causes to increase the delay, which cause to decrease the throughput and the overall performance of the system. The network designers must choose appropriate omega network architecture, and he should compromise between the buffer size and available traffic. In this case, controlling the congestion will be satisfied and no packet losing will be occurred. REFERENCES [] Andrew S. Tanenbaum, Computer Networks, th edition, by Prentice Hall, [] Vipin K., Ananth G., Anshul G., George K., Introduction To Parallel Computing, Benjamin /Cummings Publishing Company, 99. [] Joseph D. Touch. Replication and Reduction in multistage interconnection networks, IEEE Transaction Computers, 999 [] Rajeev Sivaram, Dhabaleswar K. Panda, and Craig B. Stunkel. Efficient broadcast and multicast on multistage interconnection networks using multiport encoding. IEEE Transaction on Parallel and Distributed Systems, 9(): 8, October 998. [] Sun Microsystems, Sun certified programmer for Java platform, Colorado, USA, April,
BROADBAND AND HIGH SPEED NETWORKS
BROADBAND AND HIGH SPEED NETWORKS ATM SWITCHING ATM is a connection-oriented transport concept An end-to-end connection (virtual channel) established prior to transfer of cells Signaling used for connection
More informationIV. PACKET SWITCH ARCHITECTURES
IV. PACKET SWITCH ARCHITECTURES (a) General Concept - as packet arrives at switch, destination (and possibly source) field in packet header is used as index into routing tables specifying next switch in
More informationECE 697J Advanced Topics in Computer Networks
ECE 697J Advanced Topics in Computer Networks Switching Fabrics 10/02/03 Tilman Wolf 1 Router Data Path Last class: Single CPU is not fast enough for processing packets Multiple advanced processors in
More informationTopic 4a Router Operation and Scheduling. Ch4: Network Layer: The Data Plane. Computer Networking: A Top Down Approach
Topic 4a Router Operation and Scheduling Ch4: Network Layer: The Data Plane Computer Networking: A Top Down Approach 7 th edition Jim Kurose, Keith Ross Pearson/Addison Wesley April 2016 4-1 Chapter 4:
More informationIntroduction to ATM Technology
Introduction to ATM Technology ATM Switch Design Switching network (N x N) Switching network (N x N) SP CP SP CP Presentation Outline Generic Switch Architecture Specific examples Shared Buffer Switch
More informationChapter 24 Congestion Control and Quality of Service 24.1
Chapter 24 Congestion Control and Quality of Service 24.1 Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 24-1 DATA TRAFFIC The main focus of congestion control
More informationHubs. twisted pair. hub. 5: DataLink Layer 5-1
Hubs Hubs are essentially physical-layer repeaters: bits coming from one link go out all other links at the same rate no frame buffering no CSMA/CD at : adapters detect collisions provides net management
More informationLecture 16: Network Layer Overview, Internet Protocol
Lecture 16: Network Layer Overview, Internet Protocol COMP 332, Spring 2018 Victoria Manfredi Acknowledgements: materials adapted from Computer Networking: A Top Down Approach 7 th edition: 1996-2016,
More informationII. Principles of Computer Communications Network and Transport Layer
II. Principles of Computer Communications Network and Transport Layer A. Internet Protocol (IP) IPv4 Header An IP datagram consists of a header part and a text part. The header has a 20-byte fixed part
More informationComputer Networks. Routing
Computer Networks Routing Topics Link State Routing (Continued) Hierarchical Routing Broadcast Routing Sending distinct packets Flooding Multi-destination routing Using spanning tree Reverse path forwarding
More informationCS321: Computer Networks Congestion Control in TCP
CS321: Computer Networks Congestion Control in TCP Dr. Manas Khatua Assistant Professor Dept. of CSE IIT Jodhpur E-mail: manaskhatua@iitj.ac.in Causes and Cost of Congestion Scenario-1: Two Senders, a
More informationComputer Networks 1 (Mạng Máy Tính 1) Lectured by: Dr. Phạm Trần Vũ
Computer Networks 1 (Mạng Máy Tính 1) Lectured by: Dr. Phạm Trần Vũ 1 Lecture 5: Network Layer (cont ) Reference: Chapter 5 - Computer Networks, Andrew S. Tanenbaum, 4th Edition, Prentice Hall, 2003. 2
More informationLecture 7. Reminder: Homework 2, Programming Project 1 due today. Homework 3, Programming Project 2 out, due Thursday next week. Questions?
Lecture 7 Reminder: Homework 2, Programming Project 1 due today. Homework 3, Programming Project 2 out, due Thursday next week. Questions? Thursday, September 15 CS 475 Networks - Lecture 7 1 Outline Chapter
More informationCS 349/449 Internet Protocols Final Exam Winter /15/2003. Name: Course:
CS 349/449 Internet Protocols Final Exam Winter 2003 12/15/2003 Name: Course: Instructions: 1. You have 2 hours to finish 2. Question 9 is only for 449 students 3. Closed books, closed notes. Write all
More informationChapter 4: network layer. Network service model. Two key network-layer functions. Network layer. Input port functions. Router architecture overview
Chapter 4: chapter goals: understand principles behind services service models forwarding versus routing how a router works generalized forwarding instantiation, implementation in the Internet 4- Network
More informationInterconnection Network. Jinkyu Jeong Computer Systems Laboratory Sungkyunkwan University
Interconnection Network Jinkyu Jeong (jinkyu@skku.edu) Computer Systems Laboratory Sungkyunkwan University http://csl.skku.edu Topics Taxonomy Metric Topologies Characteristics Cost Performance 2 Interconnection
More informationDr e v prasad Dt
Dr e v prasad Dt. 12.10.17 Contents Characteristics of Multiprocessors Interconnection Structures Inter Processor Arbitration Inter Processor communication and synchronization Cache Coherence Introduction
More informationQuality of Service in the Internet
Quality of Service in the Internet Problem today: IP is packet switched, therefore no guarantees on a transmission is given (throughput, transmission delay, ): the Internet transmits data Best Effort But:
More information06/02/ Local & Metropolitan Area Networks 0. INTRODUCTION. 1. History and Future of TCP/IP ACOE322
1 Local & Metropolitan Area Networks ACOE322 Lecture 5 TCP/IP Protocol suite and IP addressing 1 0. INTRODUCTION We shall cover in this topic: 1. The relation of TCP/IP with internet and OSI model 2. Internet
More informationIMPLEMENTATION OF A PACKET PRIORITY AND FIFO QUEUING MODEL IN PACKET RADIO SYSTEM
IMPLEMENTATION OF A PACKET PRIORITY AND FIFO QUEUING MODEL IN PACKET RADIO SYSTEM H. Lami 1, A. Affandi 2 1, 2 Department of Electrical Engineering, Faculty of Industrial Technology, Institut Teknologi
More informationCourse 6. Internetworking Routing 1/33
Course 6 Internetworking Routing 1/33 Routing The main function of the network layer is routing packets from the source machine to the destination machine. Along the way, at least one intermediate node
More informationGeneric Architecture. EECS 122: Introduction to Computer Networks Switch and Router Architectures. Shared Memory (1 st Generation) Today s Lecture
Generic Architecture EECS : Introduction to Computer Networks Switch and Router Architectures Computer Science Division Department of Electrical Engineering and Computer Sciences University of California,
More informationCSC 4900 Computer Networks: Network Layer
CSC 4900 Computer Networks: Network Layer Professor Henry Carter Fall 2017 Villanova University Department of Computing Sciences Review What is AIMD? When do we use it? What is the steady state profile
More informationInterconnection Network
Interconnection Network Jinkyu Jeong (jinkyu@skku.edu) Computer Systems Laboratory Sungkyunkwan University http://csl.skku.edu SSE3054: Multicore Systems, Spring 2017, Jinkyu Jeong (jinkyu@skku.edu) Topics
More informationChapter 4 Network Layer: The Data Plane
Chapter 4 Network Layer: The Data Plane A note on the use of these Powerpoint slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you see
More informationInterconnection Network
Interconnection Network Recap: Generic Parallel Architecture A generic modern multiprocessor Network Mem Communication assist (CA) $ P Node: processor(s), memory system, plus communication assist Network
More informationImproving QOS in IP Networks. Principles for QOS Guarantees
Improving QOS in IP Networks Thus far: making the best of best effort Future: next generation Internet with QoS guarantees RSVP: signaling for resource reservations Differentiated Services: differential
More informationCharacteristics of Mult l ip i ro r ce c ssors r
Characteristics of Multiprocessors A multiprocessor system is an interconnection of two or more CPUs with memory and input output equipment. The term processor in multiprocessor can mean either a central
More informationComputer Networks 1 (Mạng Máy Tính 1) Lectured by: Dr. Phạm Trần Vũ
Computer Networks 1 (Mạng Máy Tính 1) Lectured by: Dr. Phạm Trần Vũ Lecture 5: Network Layer Reference: Chapter 5 - Computer Networks, Andrew S. Tanenbaum, 4th Edition, Prentice Hall, 2003. Contents The
More informationReal-Time Protocol (RTP)
Real-Time Protocol (RTP) Provides standard packet format for real-time application Typically runs over UDP Specifies header fields below Payload Type: 7 bits, providing 128 possible different types of
More informationET4254 Communications and Networking 1
Topic 9 Internet Protocols Aims:- basic protocol functions internetworking principles connectionless internetworking IP IPv6 IPSec 1 Protocol Functions have a small set of functions that form basis of
More informationRunning Head: NETWORKING 1
Running Head: NETWORKING 1 Switches and Bridges - Comparison and Contrast [Name of the Writer] [Name of the Institution] NETWORKING 2 Switches and Bridges Introduction This paper presents a comparison
More informationEECS 122: Introduction to Computer Networks Switch and Router Architectures. Today s Lecture
EECS : Introduction to Computer Networks Switch and Router Architectures Computer Science Division Department of Electrical Engineering and Computer Sciences University of California, Berkeley Berkeley,
More informationEEC-484/584 Computer Networks
EEC-484/584 Computer Networks Lecture 13 wenbing@ieee.org (Lecture nodes are based on materials supplied by Dr. Louise Moser at UCSB and Prentice-Hall) Outline 2 Review of lecture 12 Routing Congestion
More informationQuality of Service in the Internet
Quality of Service in the Internet Problem today: IP is packet switched, therefore no guarantees on a transmission is given (throughput, transmission delay, ): the Internet transmits data Best Effort But:
More informationRequest for Comments: S. Gabe Nortel (Northern Telecom) Ltd. May Nortel s Virtual Network Switching (VNS) Overview
Network Working Group Request for Comments: 2340 Category: Informational B. Jamoussi D. Jamieson D. Williston S. Gabe Nortel (Northern Telecom) Ltd. May 1998 Status of this Memo Nortel s Virtual Network
More informationModule 1. Introduction. Version 2, CSE IIT, Kharagpur
Module 1 Introduction Version 2, CSE IIT, Kharagpur Introduction In this module we shall highlight some of the basic aspects of computer networks in two lessons. In lesson 1.1 we shall start with the historical
More informationMulti-Processor / Parallel Processing
Parallel Processing: Multi-Processor / Parallel Processing Originally, the computer has been viewed as a sequential machine. Most computer programming languages require the programmer to specify algorithms
More informationSwitching / Forwarding
Switching / Forwarding A switch is a device that allows interconnection of links to form larger networks Multi-input, multi-output device Packet switch transfers packets from an input to one or more outputs
More information===================================================================== Exercises =====================================================================
===================================================================== Exercises ===================================================================== 1 Chapter 1 1) Design and describe an application-level
More informationLOCAL AREA NETWORKS Q&A Topic 4: VLAN
A. Indicate whether the sentence or statement is true or false: 1. VLANs are more flexible in handling moves and additions of ports than routers 2. VLANs logically segment the physical LAN infrastructure
More informationMohammad Hossein Manshaei 1393
Mohammad Hossein Manshaei manshaei@gmail.com 1393 Voice and Video over IP Slides derived from those available on the Web site of the book Computer Networking, by Kurose and Ross, PEARSON 2 Multimedia networking:
More informationChapter 4 Network Layer
Chapter 4 Network Layer Computer Networking: A Top Down Approach Featuring the Internet, 3 rd edition. Jim Kurose, Keith Ross Addison-Wesley, July 2004. Network Layer 4-1 Chapter 4: Network Layer Chapter
More informationCMSC 611: Advanced. Interconnection Networks
CMSC 611: Advanced Computer Architecture Interconnection Networks Interconnection Networks Massively parallel processor networks (MPP) Thousands of nodes Short distance (
More informationIntegrated Services. Integrated Services. RSVP Resource reservation Protocol. Expedited Forwarding. Assured Forwarding.
Integrated Services An architecture for streaming multimedia Aimed at both unicast and multicast applications An example of unicast: a single user streaming a video clip from a news site An example of
More informationNetworks and Distributed Systems. Sarah Diesburg Operating Systems CS 3430
Networks and Distributed Systems Sarah Diesburg Operating Systems CS 3430 Technology Trends Decade Technology $ per machine Sales volume Users per machine 50s $10M 100 1000s 60s Mainframe $1M 10K 100s
More informationLinux System Administration
IP Addressing Subnetting Objective At the conclusion of this module, the student will be able to: Describe how packets are routed from one network to another Describe the parts and classes of IPv4 address
More informationProblem Set Name the 7 OSI layers and give the corresponding functionalities for each layer.
Problem Set 1 1. Why do we use layering in computer networks? 2. Name the 7 OSI layers and give the corresponding functionalities for each layer. 3. Compare the network performance of the 3 Multiple Access
More informationContinuous Real Time Data Transfer with UDP/IP
Continuous Real Time Data Transfer with UDP/IP 1 Emil Farkas and 2 Iuliu Szekely 1 Wiener Strasse 27 Leopoldsdorf I. M., A-2285, Austria, farkas_emil@yahoo.com 2 Transilvania University of Brasov, Eroilor
More informationSwitching Hardware. Spring 2015 CS 438 Staff, University of Illinois 1
Switching Hardware Spring 205 CS 438 Staff, University of Illinois Where are we? Understand Different ways to move through a network (forwarding) Read signs at each switch (datagram) Follow a known path
More informationIP - The Internet Protocol. Based on the slides of Dr. Jorg Liebeherr, University of Virginia
IP - The Internet Protocol Based on the slides of Dr. Jorg Liebeherr, University of Virginia Orientation IP (Internet Protocol) is a Network Layer Protocol. IP: The waist of the hourglass IP is the waist
More informationPerformance of a Switched Ethernet: A Case Study
Performance of a Switched Ethernet: A Case Study M. Aboelaze A Elnaggar Dept. of Computer Science Dept of Electrical Engineering York University Sultan Qaboos University Toronto Ontario Alkhod 123 Canada
More informationChapter 4. Computer Networking: A Top Down Approach 5 th edition. Jim Kurose, Keith Ross Addison-Wesley, sl April 2009.
Chapter 4 Network Layer A note on the use of these ppt slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you can add, modify, and delete
More informationI. INTRODUCTION. each station (i.e., computer, telephone, etc.) directly connected to all other stations
I. INTRODUCTION (a) Network Topologies (i) point-to-point communication each station (i.e., computer, telephone, etc.) directly connected to all other stations (ii) switched networks (1) circuit switched
More informationA closer look at network structure:
T1: Introduction 1.1 What is computer network? Examples of computer network The Internet Network structure: edge and core 1.2 Why computer networks 1.3 The way networks work 1.4 Performance metrics: Delay,
More informationCSE 3214: Computer Network Protocols and Applications Network Layer
CSE 314: Computer Network Protocols and Applications Network Layer Dr. Peter Lian, Professor Department of Computer Science and Engineering York University Email: peterlian@cse.yorku.ca Office: 101C Lassonde
More informationThis chapter provides the background knowledge about Multistage. multistage interconnection networks are explained. The need, objectives, research
CHAPTER 1 Introduction This chapter provides the background knowledge about Multistage Interconnection Networks. Metrics used for measuring the performance of various multistage interconnection networks
More informationWhat Is Congestion? Effects of Congestion. Interaction of Queues. Chapter 12 Congestion in Data Networks. Effect of Congestion Control
Chapter 12 Congestion in Data Networks Effect of Congestion Control Ideal Performance Practical Performance Congestion Control Mechanisms Backpressure Choke Packet Implicit Congestion Signaling Explicit
More informationGrowth. Individual departments in a university buy LANs for their own machines and eventually want to interconnect with other campus LANs.
Internetworking Multiple networks are a fact of life: Growth. Individual departments in a university buy LANs for their own machines and eventually want to interconnect with other campus LANs. Fault isolation,
More informationCSCI Computer Networks
CSCI-1680 - Computer Networks Link Layer III: LAN & Switching Chen Avin Based partly on lecture notes by David Mazières, Phil Levis, John Jannotti, Peterson & Davie, Rodrigo Fonseca Today: Link Layer (cont.)
More informationCS610- Computer Network Solved Subjective From Midterm Papers
Solved Subjective From Midterm Papers May 08,2012 MC100401285 Moaaz.pk@gmail.com Mc100401285@gmail.com PSMD01 CS610- Computer Network Midterm Examination - Fall 2011 1. Where are destination and source
More informationThe Network Layer and Routers
The Network Layer and Routers Daniel Zappala CS 460 Computer Networking Brigham Young University 2/18 Network Layer deliver packets from sending host to receiving host must be on every host, router in
More informationBROADBAND AND HIGH SPEED NETWORKS
BROADBAND AND HIGH SPEED NETWORKS SWITCHING A switch is a mechanism that allows us to interconnect links to form a larger network. A switch is a multi-input, multi-output device, which transfers packets
More informationCS 43: Computer Networks Switches and LANs. Kevin Webb Swarthmore College December 5, 2017
CS 43: Computer Networks Switches and LANs Kevin Webb Swarthmore College December 5, 2017 Ethernet Metcalfe s Ethernet sketch Dominant wired LAN technology: cheap $20 for NIC first widely used LAN technology
More informationCS244 Advanced Topics in Computer Networks Midterm Exam Monday, May 2, 2016 OPEN BOOK, OPEN NOTES, INTERNET OFF
CS244 Advanced Topics in Computer Networks Midterm Exam Monday, May 2, 2016 OPEN BOOK, OPEN NOTES, INTERNET OFF Your Name: Answers SUNet ID: root @stanford.edu In accordance with both the letter and the
More informationGeneral comments on candidates' performance
BCS THE CHARTERED INSTITUTE FOR IT BCS Higher Education Qualifications BCS Level 5 Diploma in IT April 2018 Sitting EXAMINERS' REPORT Computer Networks General comments on candidates' performance For the
More informationThis Lecture. BUS Computer Facilities Network Management. Internetworking. Internetworking
his Lecture BUS3150 - Computer Facilities Network Management Principles of internetworking. Protocol Version 4 (v4). v4 Address structure including subnetworking. Faculty of nformation echnology Monash
More informationCOMPUTER NETWORK. Homework #2. Due Date: April 12, 2017 in class
Computer Network Homework#2 COMPUTER NETWORK Homework #2 Due Date: April 12, 2017 in class Question 1 Suppose a process in Host C has a UDP socket with port number 6789. Suppose both Host A and Host B
More informationChapter 6. The Protocol TCP/IP. Introduction to Protocols
Chapter 6 The Protocol TCP/IP 1 Introduction to Protocols A protocol is a set of rules that governs the communications between computers on a network. These rules include guidelines that regulate the following
More informationUSING BRIDGES, ROUTERS AND GATEWAYS IN DATA ACQUISITION NETWORKS
USING BRIDGES, ROUTERS AND GATEWAYS IN DATA ACQUISITION NETWORKS Tom De Selms JDANS Lead Engineer Veridian Engineering thomas.deselms@veridian.com ABSTRACT Using acquisition networks requires an understanding
More informationAN IMPROVED STEP IN MULTICAST CONGESTION CONTROL OF COMPUTER NETWORKS
AN IMPROVED STEP IN MULTICAST CONGESTION CONTROL OF COMPUTER NETWORKS Shaikh Shariful Habib Assistant Professor, Computer Science & Engineering department International Islamic University Chittagong Bangladesh
More information5.2 Routing Algorithms
CEN445 Network Protocols and Algorithms Chapter 5 Network Layer 5. Routing Algorithms Dr. Mostafa Hassan Dahshan Department of Computer Engineering College of Computer and Information Sciences King Saud
More informationQuality of Service in the Internet. QoS Parameters. Keeping the QoS. Leaky Bucket Algorithm
Quality of Service in the Internet Problem today: IP is packet switched, therefore no guarantees on a transmission is given (throughput, transmission delay, ): the Internet transmits data Best Effort But:
More informationEthernet. Network Fundamentals Chapter Cisco Systems, Inc. All rights reserved. Cisco Public 1
Ethernet Network Fundamentals Chapter 9 1 Objectives Identify the basic characteristics of network media used in Ethernet. Describe the physical and data link features of Ethernet. Describe the function
More informationUnit 2 Packet Switching Networks - II
Unit 2 Packet Switching Networks - II Dijkstra Algorithm: Finding shortest path Algorithm for finding shortest paths N: set of nodes for which shortest path already found Initialization: (Start with source
More informationCSCI-1680 Link Layer Wrap-Up Rodrigo Fonseca
CSCI-1680 Link Layer Wrap-Up Rodrigo Fonseca Based partly on lecture notes by David Mazières, Phil Levis, John Jannotti Administrivia Homework I out later today, due next Thursday Today: Link Layer (cont.)
More informationComputer Networks LECTURE 10 ICMP, SNMP, Inside a Router, Link Layer Protocols. Assignments INTERNET CONTROL MESSAGE PROTOCOL
Computer Networks LECTURE 10 ICMP, SNMP, Inside a Router, Link Layer Protocols Sandhya Dwarkadas Department of Computer Science University of Rochester Assignments Lab 3: IP DUE Friday, October 7 th Assignment
More informationCSE 422 Jeopardy. Sockets TCP/UDP IP Routing Link $100 $200 $300 $400. Sockets - $100
CSE 422 Jeopardy Sockets TCP/UDP IP Routing Link $100 $100 $100 $100 $100 $200 $200 $200 $200 $200 $300 $300 $300 $300 $300 $400 $400 $400 $400 $400 $500 $500 $500 $500 $500 Sockets - $100 True or False:
More informationCSCI-1680 Link Layer Wrap-Up Rodrigo Fonseca
CSCI-1680 Link Layer Wrap-Up Rodrigo Fonseca Based partly on lecture notes by David Mazières, Phil Levis, John Janno< Administrivia Homework I out later today, due next Thursday, Sep 25th Today: Link Layer
More informationPromoting the Use of End-to-End Congestion Control in the Internet
Promoting the Use of End-to-End Congestion Control in the Internet Sally Floyd and Kevin Fall IEEE/ACM Transactions on Networking May 1999 ACN: TCP Friendly 1 Outline The problem of Unresponsive Flows
More informationMaster Course Computer Networks IN2097
Chair for Network Architectures and Services Prof. Carle Department for Computer Science TU München Chair for Network Architectures and Services Prof. Carle Department for Computer Science TU München Master
More informationConfiguring Dynamic ARP Inspection
21 CHAPTER This chapter describes how to configure dynamic Address Resolution Protocol inspection (dynamic ARP inspection) on the Catalyst 3560 switch. This feature helps prevent malicious attacks on the
More informationCMSC 332 Computer Networks Network Layer
CMSC 332 Computer Networks Network Layer Professor Szajda CMSC 332: Computer Networks Where in the Stack... CMSC 332: Computer Network 2 Where in the Stack... Application CMSC 332: Computer Network 2 Where
More informationChapter 10. Circuits Switching and Packet Switching 10-1
Chapter 10 Circuits Switching and Packet Switching 10-1 Content Switched communication networks Circuit switching networks Circuit-switching concepts Packet-switching principles X.25 (mentioned but not
More informationMultiprocessor Interconnection Networks- Part Three
Babylon University College of Information Technology Software Department Multiprocessor Interconnection Networks- Part Three By The k-ary n-cube Networks The k-ary n-cube network is a radix k cube with
More informationBridging and Switching Basics
CHAPTER 4 Bridging and Switching Basics This chapter introduces the technologies employed in devices loosely referred to as bridges and switches. Topics summarized here include general link-layer device
More informationChapter 1. Introduction
Chapter 1 Introduction In a packet-switched network, packets are buffered when they cannot be processed or transmitted at the rate they arrive. There are three main reasons that a router, with generic
More informationCS 162 Operating Systems and Systems Programming Professor: Anthony D. Joseph Spring Lecture 20: Networks and Distributed Systems
S 162 Operating Systems and Systems Programming Professor: Anthony D. Joseph Spring 2003 Lecture 20: Networks and Distributed Systems 20.0 Main Points Motivation for distributed vs. centralized systems
More informationWe will discuss about three different static routing algorithms 1. Shortest Path Routing 2. Flooding 3. Flow Based Routing
In this lecture we will discuss about Routing algorithms Congestion algorithms Lecture 19 The routing algorithm is that part of the network layer software, which is responsible for deciding which output
More informationMaster Course Computer Networks IN2097
Chair for Network Architectures and Services Prof. Carle Department for Computer Science TU München Master Course Computer Networks IN2097 Prof. Dr.-Ing. Georg Carle Christian Grothoff, Ph.D. Chair for
More informationCMPE150 Midterm Solutions
CMPE150 Midterm Solutions Question 1 Packet switching and circuit switching: (a) Is the Internet a packet switching or circuit switching network? Justify your answer. The Internet is a packet switching
More informationRouter Architectures
Router Architectures Venkat Padmanabhan Microsoft Research 13 April 2001 Venkat Padmanabhan 1 Outline Router architecture overview 50 Gbps multi-gigabit router (Partridge et al.) Technology trends Venkat
More informationUNIT 2 TRANSPORT LAYER
Network, Transport and Application UNIT 2 TRANSPORT LAYER Structure Page No. 2.0 Introduction 34 2.1 Objective 34 2.2 Addressing 35 2.3 Reliable delivery 35 2.4 Flow control 38 2.5 Connection Management
More informationNetwork Superhighway CSCD 330. Network Programming Winter Lecture 13 Network Layer. Reading: Chapter 4
CSCD 330 Network Superhighway Network Programming Winter 2015 Lecture 13 Network Layer Reading: Chapter 4 Some slides provided courtesy of J.F Kurose and K.W. Ross, All Rights Reserved, copyright 1996-2007
More informationInternetwork Protocols
Internetwork Protocols Background to IP IP, and related protocols Internetworking Terms (1) Communications Network Facility that provides data transfer service An internet Collection of communications
More informationCS164 Final Exam Winter 2013
CS164 Final Exam Winter 2013 Name: Last 4 digits of Student ID: Problem 1. State whether each of the following statements is true or false. (Two points for each correct answer, 1 point for each incorrect
More informationCOMPUTER NETWORK. Homework #3. Due Date: May 22, 2017 in class
Computer Network Homework#3 COMPUTER NETWORK Homework #3 Due Date: May 22, 2017 in class Question 1 Host A and B are communicating over a TCP connection, and Host B has already received from A all bytes
More informationICMP (Internet Control Message Protocol)
ABSTRACT : ICMP stands for internet control message protocol it is a vital protocol of network layer among the seven layers of OSI(open system interconnection). Here we deal with the several situations
More informationClass-based Packet Scheduling Policies for Bluetooth
Class-based Packet Scheduling Policies for Bluetooth Vishwanath Sinha, D. Raveendra Babu Department of Electrical Engineering Indian Institute of Technology, Kanpur - 08 06, INDIA vsinha@iitk.ernet.in,
More informationMULTIPROCESSORS. Characteristics of Multiprocessors. Interconnection Structures. Interprocessor Arbitration
MULTIPROCESSORS Characteristics of Multiprocessors Interconnection Structures Interprocessor Arbitration Interprocessor Communication and Synchronization Cache Coherence 2 Characteristics of Multiprocessors
More information