Student Projects in Computer Networking: Simulation versus Coding Leann M. Christianson Kevin A. Brown Cal State East Bay.

Slides:



Advertisements
Similar presentations
All information contained within this presentation is proprietary of Trinnovations LLC. Learn more at:
Advertisements

Computer Network Topologies
Chapter 17 Networking Patricia Roy Manatee Community College, Venice, FL ©2008, Prentice Hall Operating Systems: Internals and Design Principles, 6/E William.
6.033: Intro to Computer Networks Layering & Routing Dina Katabi & Sam Madden Some slides are contributed by N. McKewon, J. Rexford, I. Stoica.
Cisco S3 C5 Routing Protocols. Network Design Characteristics Reliable – provides mechanisms for error detection and correction Connectivity – incorporate.
Software Frame Simulator (SFS) Technion CS Computer Communications Lab (236340) in cooperation with ECI telecom Uri Ferri & Ynon Cohen January 2007.
Network+ Guide to Networks, Fourth Edition
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts – Chapter.
Slide 1 Client / Server Paradigm. Slide 2 Outline: Client / Server Paradigm Client / Server Model of Interaction Server Design Issues C/ S Points of Interaction.
Traffic Engineering With Traditional IP Routing Protocols
Chapter 10 Introduction to Wide Area Networks Data Communications and Computer Networks: A Business User’s Approach.
Routing.
1 Sonia Fahmy Ness Shroff Students: Roman Chertov Rupak Sanjel Center for Education and Research in Information Assurance and Security (CERIAS) Purdue.
CS335 Networking & Network Administration Tuesday, April 20, 2010.
Copyright © 2005 OPNET Technologies, Inc. Confidential, not for distribution to third parties. Teaching with OPNET Software Dr. Vasil Y. Hnatyshin Department.
Network+ Guide to Networks, Fourth Edition Chapter 1 An Introduction to Networking.
Distributed Systems Architecture Presentation II Presenters Rose Kit & Turgut Tezir.
Lecture Week 3 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts.
Network Simulation Internet Technologies and Applications.
Lecture slides prepared for “Business Data Communications”, 7/e, by William Stallings and Tom Case, Chapter 8 “TCP/IP”.
EstiNet Network Simulator & Emulator 2014/06/ 尉遲仲涵.
INTRODUCTION TO WEB DATABASE PROGRAMMING
Presentation Title Subtitle Author Copyright © 2002 OPNET Technologies, Inc. TM Introduction to IP and Routing.
Network+ Guide to Networks, Fourth Edition Chapter 1 An Introduction to Networking.
Hands-On Microsoft Windows Server 2003 Networking Chapter Three TCP/IP Architecture.
Chapter 17 Networking Dave Bremer Otago Polytechnic, N.Z. ©2008, Prentice Hall Operating Systems: Internals and Design Principles, 6/E William Stallings.
1 CS 4396 Computer Networks Lab Dynamic Routing Protocols - II OSPF.
70-291: MCSE Guide to Managing a Microsoft Windows Server 2003 Network Chapter 3: TCP/IP Architecture.
NetworkProtocols. Objectives Identify characteristics of TCP/IP, IPX/SPX, NetBIOS, and AppleTalk Understand position of network protocols in OSI Model.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts.
1 Introducing Routing 1. Dynamic routing - information is learned from other routers, and routing protocols adjust routes automatically. 2. Static routing.
Introduction to Dynamic Routing Protocol
Computers Are Your Future Tenth Edition Chapter 8: Networks: Communicating & Sharing Resources Copyright © 2009 Pearson Education, Inc. Publishing as Prentice.
1 Computer Networks DA Chapter 1-3 Introduction.
Lec4: TCP/IP, Network management model, Agent architectures
 Network Segments  NICs  Repeaters  Hubs  Bridges  Switches  Routers and Brouters  Gateways 2.
1. 2 Anatomy of an IP Packet IP packets consist of the data from upper layers plus an IP header. The IP header consists of the following:

CS 390 Unix Programming Summer Unix Programming - CS 3902 Course Details Online Information Please check.
Chi-Cheng Lin, Winona State University CS 313 Introduction to Computer Networking & Telecommunication Chapter 5 Network Layer.
TCOM 509 – Internet Protocols (TCP/IP) Lecture 03_b Protocol Layering Instructor: Dr. Li-Chuan Chen Date: 09/15/2003 Based in part upon slides of Prof.
1 Networking Chapter Distributed Capabilities Communications architectures –Software that supports a group of networked computers Network operating.
Chapter 15 – Part 2 Networks The Internal Operating System The Architecture of Computer Hardware and Systems Software: An Information Technology Approach.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Routing Protocols and Concepts Introduction to Dynamic Routing Protocol.
1 Week 5 Lecture 2 IP Layer. 2 Network layer functions transport packet from sending to receiving hosts transport packet from sending to receiving hosts.
Institute of Technology Sligo - Dept of Computing Sem 2 Chapter 12 Routing Protocols.
William Stallings Data and Computer Communications
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts.
Routing and Routing Protocols
11 CLUSTERING AND AVAILABILITY Chapter 11. Chapter 11: CLUSTERING AND AVAILABILITY2 OVERVIEW  Describe the clustering capabilities of Microsoft Windows.
70-291: MCSE Guide to Managing a Microsoft Windows Server 2003 Network, Enhanced Chapter 3: TCP/IP Architecture.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Connecting to the Network Introduction to Networking Concepts.
70-293: MCSE Guide to Planning a Microsoft Windows Server 2003 Network, Enhanced Chapter 4: Planning and Configuring Routing and Switching.
An Efficient Gigabit Ethernet Switch Model for Large-Scale Simulation Dong (Kevin) Jin.
+ Routing Concepts 1 st semester Objectives  Describe the primary functions and features of a router.  Explain how routers use information.
Midterm Review Chapter 1: Introduction Chapter 2: Application Layer
Routing Algorithms Lecture Static/ Dynamic, Direct/ Indirect, Shortest Path Routing, Flooding, Distance Vector Routing, Link State Routing, Hierarchical.
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
IP Security (IPSec) Matt Hermanson. What is IPSec? It is an extension to the Internet Protocol (IP) suite that creates an encrypted and secure conversation.
Interaction and Animation on Geolocalization Based Network Topology by Engin Arslan.
Lec4: Introduction to Dynamic Routing Protocol
Introduction to Dynamic Routing Protocol
Network Simulators.
Introduction to Dynamic Routing Protocol
Routing.
Introduction to Dynamic Routing Protocol
Introduction to Local Area Networks
Routing and the Network Layer (ref: Interconnections by Perlman
Routing.
OSPF Protocol.
Presentation transcript:

Student Projects in Computer Networking: Simulation versus Coding Leann M. Christianson Kevin A. Brown Cal State East Bay

Introduction Computer networking is an integral part of computer science education Network protocols involve many entities Creating practical and compelling student assignments in networking is challenging Cal State East Bay

Challenges… Protocols differ in how they respond to corruption, errors, and loss, and replication of results difficult Algorithm performance may only be apparent under high load, negatively impacting other users of the network Cal State East Bay

Challenges (cont’d)… The differences in the performance of transport algorithms may only be apparent if the transmitter and receiver nodes are separated by large distances or if a large number of machines are linked to the network Routing algorithms require communication with tens to hundreds of other nodes Cal State East Bay

Challenges (cont’d)… Security concerns within a university may make it difficult to provide access to live servers with which to interact Super-user access may be needed to use commands that report on network performance Much network code is at the kernel-level requiring recompilation of the kernel in order to modify Cal State East Bay

Networking Algorithms are complex It is beneficial to provide more than a description and explanation Students learn by experimentation The ability to experiment may be provided in (at least) two ways Cal State East Bay

Experimentation Two Methods Provide a simulation environment Allow the students to implement the algorithm themselves and run it on real machines Cal State East Bay

Coding Benefits Computer Science is similar to engineering – Computer Scientists need experience applying what they learn by building workable modules or programs that implement a key concept – Coding skills enhance career opportunities Cal State East Bay

Coding Issues Dedicated equipment is needed – For security – Multiple nodes at great distances must be available Testing – Difficult to duplicate conditions such that all students see identical results – Inducing errors, loss and excess delay is difficult even with a traffic generator – Internet traffic, error, and loss patterns are not reproducible Cal State East Bay

Simulation Software Benefits Allows for rapid configuration - WANs, LANs, intermediary, and host nodes Protocols can be easily interchanged and tested Large distances and multiple nodes can be simulated Errors, losses, and delay rates can be defined to follow a chosen distribution pattern Results are reproducible Dedicated equipment and super user access not required Long time periods can be simulated quickly Cal State East Bay

Simulation Software Issues Requires investment of class time Simulation model may not accurately reflect real traffic patterns May be difficult to reproduce a particular event as some simulation applications do not allow the user to modify all simulation entities Students will not gain experience writing actual networking code and interacting with live standards- based servers Cost, support, and license management must be considered Cal State East Bay

Simulation Software OPNET University Program provides – Free IT Guru software for each student – Runs on Windows XP – Unix version for university – Cal State East Bay

Example 1 TCP vs UDP packet delay Simulate client/server communication over an IP network Observe the effect of packet size on delay for both TCP and UDP transport layer protocols for file transfer

OPNET: FTP client and server Cal State East Bay

TCP vs UDP Results Simulation can be rerun with different packet sizes Results can be graphed for easy comparison TCP packet delay is longer than UDP packet delay due to the added complexity of the protocol Delay to process each TCP packet increases with packet size

TCP vs UDP FTP: Packet Delay Cal State East Bay

TCP vs UDP Simulation Benefits Students can easily change parameters such as link speed, packet size, and background traffic load and observe how these affect their initial results A variety of background application traffic (web, database, or ) can be chosen Easy to view and compare results graphically

Cal State East Bay TCP vs UDP Simulation Disadvantages Students do not gain valuable coding and testing experience

Cal State East Bay TCP vs UDP Coding Write a client and server program that sends a small packet back and forth via a TCP socket 10,000 times Run program 100 times, noting the round trip time for a round of 10,000 sends Graph delay times Repeat with a pair of programs using UDP sockets

Cal State East Bay TCP vs UDP Coding Benefits Provides experience with socket programming – Often a first for CS majors Allows students experience with the software lifecycle – develop, run, test, and document results

Cal State East Bay TCP vs UDP Coding Disadvantages Difficult to generate a consistent level of background traffic Inability to control the actions of other users competing for network resources Programming languages (C++ or Java) and operating systems (Unix or Windows) will affect delay times Takes additional time to import results to Excel and create graphs

Example 2 Routing Convergence Time Convergence is the time it takes for routes between network nodes to stabilize after start up or after a link has gone down Common routing algorithms such as Open Shortest Path First (OSPF), the Routing Information Protocol (RIP), or others can be used Cal State East Bay

RIP Routing Convergence Simulation Create a network of router nodes configured to use a particular routing algorithm (RIP) Evaluate the routing tables created by the routing algorithm and trace a path between two nodes. Break a link and run the simulation again Determine the routing table convergence time after a link is broken Cal State East Bay

OPNET: Routing Convergence Cal State East Bay

Routing Table: node 0 after 8 sec Cal State East Bay

Routing Simulation Benefits Rapid and easy configuration Routing tables are automatically created Can “break” links and rerun the simulation easily Simulation runs quickly Cal State East Bay

Routing Convergence Simulation Disadvantages Students do not gain experience implementing a routing algorithm on their own Difficult to calculate the exact convergence time due to timing of simulation events Some routing protocols are not offered Cal State East Bay

Routing Convergence Coding Provide an input file with nodes, distances, and weights for initial topology Implement a routing algorithm on the topology and run the program until convergence Output routing tables after convergence Write an additional program to trace routes through the tables Cal State East Bay

Routing Convergence Benefits Substantial assignment provides a great coding experience Allows students experience with the software lifecycle – develop, run, test, and document results Students who complete the project successfully understand convergence and the way the routing protocol works Cal State East Bay

Routing Convergence Disadvantages Problem is complex and requires a large time investment Students get bogged down with the coding details and lose sight of the purpose of the assignment Many give up or fail to write programs that generate correct results Cal State East Bay

Conclusions Simulation software allows more concentration on the performance of the protocol and allows for an easier visualization of results Students are more apt to “play” with their simulations and experiment beyond the bounds of the assignment Cal State East Bay

Conclusions Programming, though viewed by the students as more difficult, allows them to practice and gain skills that will be useful in their future careers The authors feel that a balance of both programming and simulation activities is the best practice Cal State East Bay

THANK YOU! OPNET Lab Manuals – Brown & Christianson, Lab Manual for Data and Computer Communications 7/E by William Stallings,Prentice Hall, 2005 – Christianson & Brown, Lab Manual for Business Data Communications 5/E by William Stallings, Prentice Hall, 2005 – Brown & Christianson, The Networking and Data Communications Laboratory Manual, Labs 5-8, edited by Frances Grodzinsky, Prentice Hall, Cal State East Bay

Contact Us… Cal State East Bay