SCHEME & SYLLABUSOF VII & VIII SEMESTERS B.E. · practice. 7. Environment and ... End Exam Marks....

Applicable for the academic year 2017-18 Batch: 2014

Department of Information Science & Engg., 1

SCHEME & SYLLABUS OF

VII & VIII SEMESTER B.E.

INFORMATION SCIENCE & ENGINEERING

2017-18



Vision

To develop young minds in a learning environment of high academic ambience by synergizing spiritual values and technological competence. Mission

To provide education of excellent quality to facilitate all learners to develop their full potential as individuals by imparting a clear knowledge of the fundamentals and applied aspects of Information Science and Engineering to make them acceptable to Industries, higher Institutions of learning and society.

Program Educational Objectives of Information science and

Engineering

The objectives of Information Science and Engineering degree program are to prepare students to meet the academic excellence, professionalism, and ability to solve a broad range of problems in rapidly

changing technological, economic and social environment.

1) Graduates of the program will pursue careers as Information Technology professional.

2) Graduates of the program will engage in life-long learning through

pursuit of higher education, skill development, and certification

courses in Information Technology and inter disciplinary domains.

3) Graduate of the program will understand professionalism; ethical and societal responsibilities demonstrate a commitment to teamwork and effectively communicate and perform in diverse

environments as leaders and contributing members in the society.

Programme Outcomes (POs):

To achieve the above objectives, Information Science and Engineering degree programme strives to obtain the following outcomes which should

be achieved by all graduates at the time of their graduation. Engineering Graduates will be able to: 1. Engineering knowledge: Apply the knowledge of mathematics, science,

engineering fundamentals, and an engineering specialization to the solution of complex engineering problems. 2. Problem analysis: Identify, formulate, review research literature, and

analyze complex engineering problems reaching substantiated conclusions using first principles of mathematics, natural sciences, and engineering sciences. 3. Design/development of solutions: Design solutions for complex engineering problems and design system components or processes that meet the specified needs with appropriate consideration for the public



health and safety, and the cultural, societal, and environmental

considerations. 4. Conduct investigations of complex problems: Use research-based knowledge and research methods including design of experiments,

analysis and interpretation of data, and synthesis of the information to provide valid conclusions. 5. Modern tool usage: Create, select, and apply appropriate techniques, resources, and modern engineering and IT tools including prediction and modeling to complex engineering activities with an understanding of the limitations.

6. The engineer and society: Apply reasoning informed by the contextual knowledge to assess societal, health, safety, legal and cultural issues and

the consequent responsibilities relevant to the professional engineering practice. 7. Environment and sustainability: Understand the impact of the professional engineering solutions in societal and environmental

contexts, and demonstrate the knowledge of, and need for sustainable development. 8. Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms of the engineering practice. 9. Individual and team work: Function effectively as an individual, and as a member or leader in diverse teams, and in multidisciplinary

settings.

10. Communication: Communicate effectively on complex engineering activities with the engineering community and with society at large, such as, being able to comprehend and write effective reports and design documentation, make effective presentations, and give and receive clear instructions.

11. Project management and finance: Demonstrate knowledge and understanding of the engineering and management principles and apply these to one’s own work, as a member and leader in a team, to manage projects and in multidisciplinary environments. 12. Life-long learning: Recognize the need for, and have the preparation and ability to engage in independent and life-long learning in the

broadest context of technological change.



Sl.

No Sub. Code Title Teaching Dept.

Teaching Hours/ Week Examination Credits

L T P Duratio

n (Hrs.)

C.I.E. Marks

End Exam

Marks. Total

Marks

1 7CCI1 Cryptography and Network Security

ISE 4 - - 3 50 50 100 4.0

2 7IS01 Software Testing ISE 4 - - 3 50 50 100 4.0

3 ISPEX Professional Elective

– II ISE 3 - - 3 50 50 100 3.0

4 ISPEX Professional Elective

–III ISE 3 - - 3 50 50 100 3.0

5 HS Humanities-II -- 3 - - 3 50 50 100 3.0 6 OE Open Elective – III -- 3 - - 3 50 50 100 3.0

7 7ISL1 Networks Laboratory ISE - - 3 3 50 50 100 1.5

8 7ISL2 Software Testing Laboratory

ISE - - 3 3 50 50 100 1.5

9 7ISMP Major Project ISE - - 3 - 50 - - 2.0 10 7ISIT Industrial Training 50 -

Total 20 - 09 450 400 850 25.0

SIDDAGANGA INSTITUTE OF TECHNOLOGY, TUMKUR

DEPARTMENT OF INFORMATION SCIENCE AND ENGINEERING

B.E. (Information Science and Engineering)

VII Semester academic year 2017-2018 (Batch 2014 )



SIDDAGANGA INSTITUTE OF TECHNOLOGY, TUMKUR

DEPARTMENT OF INFORMATION SCIENCE AND ENGINEERING

B.E. (Information Science and Engineering)

VIII Semester academic year 2017-2018 (Batch 2014 )



CRYPTOGRAPHY AND NETWORK SECURITY Contact Hours/ Week : 4 Credits : 4 Total Lecture Hours : 52 CIE Marks : 50 Sub. Code : 7CCI1 SEE Marks : 50

Course Outcomes: Upon completion of this course the student will be able to:

CO1:Describe fundamental concepts of computer security CO2:Explain the basic concepts of symmetric & asymmetric cryptography CO3:Describe the major types of cryptographic algorithms and typical

applications. CO4:Identity security weaknesses in different networking environment CO5:Identify the appropriate cryptography scheme & security mechanism for different computing environment and information systems

UNIT I

INTRODUCTION:

Introduction: Computer Security concepts, The OSI Security Architecture, Security Services, Mechanisms and Attacks, A Model of Network Security. SYMMETRIC CIPHERS: Classical Encryption Techniques: Symmetric Cipher Model, Substitution Techniques, Transposition Techniques, Rotor machine, Steganography. Block Cipher and the Data Encryption Standard: Block Cipher Principles, The Data Encryption Standard, DES Example,

Strength of DES, Differential and Linear Cryptanalysis. 10 Hrs

UNIT II

SYMMETRIC CIPHERS(cont..)

Block Cipher Operation: Multiple Encryption and triple DES, Electronic Code Book, Cipher Block Chaining Mode, Cipher Feedback Mode, Output

feedback Mode, Counter Mode. Pseudorandom Number Generation and stream ciphers: Principles of Pseudorandom Number Generation, Pseudorandom Number Generators, Pseudorandom Number Generation using a block cipher, Stream cipher, RC4. 10 Hrs

UNIT III

Number Theory: Prime Numbers, Fermat’s and Euler’s Theorems, Testing for Primality. PUBLIC-KEY CRYPTOGRAPHY AND RSA: Principles of Public-Key Cryptosystems, The RSA Algorithm. Diffie-Hellman Key Exchange.

CRYPTOGRAPHIC DATA INTEGRITY ALGORITHMS: Cryptographic Hash Functions: Applications of Cryptographic hash functions, Two simple hash Functions, Secure Hash Algorithm.



10 Hrs

UNIT IV MESSAGE AUTHENTICATION: Authentication Requirements, Authentication Functions, Message Authentication Codes, Security of

MACs, MACs based on Hash Functions : HMAC. DIGITAL SIGNATURES: Digital Signatures, Digital Signature Standard. KEY MANAGEMENT AND DISTRIBUTION: Symmetric Key distribution using symmetric encryption, Symmetric Key distribution using Asymmetric encryption, Distribution of public keys, X.509 certificates, Kerberos.

11 Hrs UNIT V

TRANSPORT-LEVEL SECURITY Transport level security: Web Security considerations, Secure Sockets Layer and Transport Layer Security. Transport Layer Security. HTTPS, Secure Shell.

INTERNET SECURITY:

Electronic Mail Security: Pretty Good Privacy, S/MIME. IP Security: Overview, IP Security Policy. SYSTEM SECURITY:

Intruders: Intruders, Intrusion detection. Malicious Software: Types of Malicious Software, Viruses.

Firewalls: The need for Firewalls, Firewall Characteristics, Types of

Firewalls. 11 Hrs

TEXT BOOK:

William Stallings, Cryptography and Network Security, Fifth Edition, Prentice Hall of India, 2005 (Chapters 1.1-1.6, 2.1-2.5, 3.1-3.5, 6.1-6.6,

7.1-7.5, 8.1-8.3, 9.1-9.2, 10.1, 11.1-11.2, 11.5, 12.1-12.5, 13.1,13.4, 14.1-14.4, 15.3, 16.1-16.5, 18.1-18.2, 19.1,19.2, 20.1-20.2, 21.1-21.2, 22.1-22.3) REFERENCES:

1. Charlie Kaufman, Radia Perlman, Mike Speciner, Network Security:

Private Communication in a Public World, Second Edition, Pearson

Education Asia, 2002. 2. Atul Kahate, Cryptography and Network Security, Tata Mc GrawHill,

2003.

SOFTWARE TESTING

Contact Hours/ Week : 4 Credits : 4 Total Lecture Hours : 52 CIE Marks : 50



Sub. Code : 7IS01 SEE Marks : 50

Course Outcomes:

Upon completion of this course the student will be able to:

CO 1: Explain a range of different software testing techniques and strategies and be able to apply specific (automated) unit testing method to our projects.

CO 2: Describe the approaches for creating the run-time support for generating and managing test data, creating scaffolding for test execution and automatically distinguishing between correct and incorrect test case executions.

CO 3: Demonstrate the integration testing which aims to uncover interaction and compatibility problems as early as possible.

CO 4: Discuss about the functional testing methods such as boundary value, equivalence class testing and decision table based testing. CO 5: Discuss about defect life cycle.

UNIT-1

A Perspective on Testing, Examples: Basic definitions, Test cases,

Insights from a Venn diagram, Identifying test cases, Error and fault taxonomies, Examples: Generalized pseudo code, The triangle problem, The commission problem, The SATM (Simple Automatic Teller Machine)

problem NextDate function, The currency converter, Saturn windshield wiper. Boundary Value Testing: Boundary value analysis, Robustness testing,

Worst-case testing, Special value testing, Examples, Random Testing, Guidelines for Boundary value testing. [Text book 1] 10hrs

UNIT II

The Equivalence Class Testing, Decision Table-Based Testing:

Boundary value analysis, Robustness testing, Worst-case testing, Special

value testing, for the triangle problem, NextDate function, The commission problem, Guideline Examples, Random testing, Equivalence classes, Equivalence test cases nes and observations. Decision tables, Test cases

for the triangle problem NextDate function, The commission problem, Guidelines and observations.[Text book 1] 12hrs

UNIT III

Path Testing, Data flow testing: DD paths, Test coverage metrics, Basis path testing, guidelines and observations. Definition-Use testing, Define/Use Testing, Examples, du-Paths for Stocks, Locks, du-Paths, Sales, Commission problem, Test coverage Metrics, Slice-based testing, Guidelines and observations. [Text book 1]



Levels of testing : The Need for Levels of Testing, Unit Test, Unit Test

Planning, Designing the Unit Tests. The Class as a Testable Unit, Running the Unit tests and Recording results, Integration tests, Designing Integration Tests, Integration Test Planning, System Test – The Different

Types, Regression Testing, Alpha, Beta and Acceptance Tests. [Text book

2] 12hrs

UNIT IV

Test goals, Policies , Plans, and Documentation: Introductory Concepts , Testing and Debugging Goals and Policies , Test Planning ,Test Plan

Components ,Test Plan Attachments ,Test Design Specifications ,Test Case Specifications ,Test Procedure Specifications ,Locating Test Items: The Test

Transmittal Report ,Reporting Test Results ,The Role of the Three Critical Groups in Test Planning and Policy Development. [Text book 2] 10hrs

UNIT V

Defect analysis and prevention: Processes and Defects, History of Defect Analysis and Prevention , Necessary Support for a Defect Prevention Program , Techniques for Defect Analysis , Defect Causal Analysis , The Action Team: Making Process Changes , Monitoring Actions and Process Changes , Benefits of a Defect Prevention Program , Defect Prevention and

the Three Critical Views. [Text book 2]

8hrs

TEXT BOOK

1. Paul C. Jorgensen: Software Testing, A Craftsman’s Approach, 3rd

Edition, Auerbach Publications, 2008. 2. Ilene Burnstein, Practical software testing‖ , Springer international edition.

Reference

1. Boris Beizer, software system testing and quality assurance,

Vannostrand reinhold , Newyork .

2. Gordon schulmeyer , Zero defect software, McGraw hill book. 3. Watts Humphrey, Managing the software process, Addison Wesel, pub .co.inc .

SOFTWARE TESTING LABORATORY Lab Hours/ Week : 3 Credits : 1.5

Sub. Code : 7ISL2 CIE Marks : 50

SEE Marks : 50



PART A:

1. Design and develop a program in a language of your choice to solve the triangle problem defined as follows: Accept three integers which are supposed to be the three sides of a triangle and determine if the three

values represent an equilateral triangle, isosceles triangle, scalene triangle, or they do not form a triangle at all. Assume that the upper limit for the size of any side is 10. Derive test cases for your program based on boundary-value analysis, execute the test cases and discuss the results.

Test Data : Enter the 3 Integer Value( a , b And c )

Pre-condition: 1 ≤ a ≤ 10 , 1 ≤ b ≤ 10 and 1 ≤ c ≤ 10 and a < b + c , b < a + c and c < a +

b

2. Design and develop a program in a language of your choice to solve the triangle problem defined as follows: Accept three integers which are supposed to be the three sides of a triangle and determine if the three values represent an equilateral triangle, isosceles triangle, scalene triangle, or they do not form a triangle at all. Assume that the upper limit for the size of any side is 10. Derive test cases for your program

based on equivalence class partitioning, execute the test cases and discuss the results.

3. Design, develop, code and run the program in any suitable language to implement the NextDate function. Analyze it from the perspective of Equivalence partition testing, derive different test cases, execute these test cases and discuss the test results.

Test data : Enter the three integer value

Pre-condition : Month 1 to 12 , DAY 1 TO 31 AND YEAR 1812 TO 2014

4. Design, develop, code and run the program in any suitable language to

solve the commission problem. Analyze it from the perspective of dataflow testing, derive different test cases, execute these test cases and

discuss the test results. Test data : price Rs for lock - 45.0 , stock - 30.0 and barrel - 25.0

sales = total lock * lock price + total stock * stock price + total barrel * barrel price commission : 10% up to sales Rs 1000 , 15 % of the next Rs 800 and 20 % on any sales in

excess of 1800

Pre-condition : lock = -1 to exit and 1< =lock < = 70 , 1<=stock <=80 and 1<=barrel<=90

5. Design, develop, code and run the program in any suitable language to

solve the commission problem. Analyze it from the perspective of decision table-based testing, derive different test cases, execute these test cases and discuss the test results.

Test Data : Enter the 3 Integer Value( a , b And c )

Pre-condition : 1 ≤ a ≤ 10 , 1 ≤ b ≤ 10 and 1 ≤ c ≤ 10 and a < b + c , b < a + c and c < a + b



Test data : price Rs for lock - 45.0 , stock - 30.0 and barrel - 25.0

sales = total lock * lock price + total stock * stock price + total barrel * barrel price

commission : 10% up to sales Rs 1000 , 15 % of the next Rs 800 and 20 % on any sales in excess of 1800

Pre-condition:lock = -1 to exit and 1< =lock < = 70 , 1<=stock <=80 and

1<=barrel<=90

6. Design, develop, code and run the program in any suitable language to solve the commission problem. Analyze it from the perspective of boundary value testing, derive different test cases, execute these test cases and discuss the test results.

Part –B

1) Write and test a Program to automate Gmail Login, Logout.

2) Write and test Program to calculate and testing the GCD of number using webpage. 3) Write and test a Program to update 10 student records into Spreadsheet. 4) Write and test a program to select the number of students who have scored less than 60 in any subject from the existing Spreadsheet to the

new Spreadsheet.

5) Write and test a program to provide total number of objects present / available on the given path.

6)Write and Test a Program to search a 16 character license key from the provided input spreadsheet.

Note: (Input spreadsheet must contain minimum 20 input data and duplicate entry may present)

NETWORK LABORATORY Lab Hours/ Week : 3 Credits : 1.5

Sub. Code : 7ISL1 CIE Marks : 50

SEE Marks : 50

Part – A

The Following experiments are conducted using NS.

1. Simulate a three nodes point to point network with duplex links between them. Set the queue size and vary the bandwidth. Determine the total number of packets dropped.

2. Simulate a network topology with the links connected as follows:

Test data : price Rs for lock - 45.0 , stock - 30.0 and barrel - 25.0

sales = total lock * lock price + total stock * stock price + total barrel * barrel price

commission : 10% up to sales Rs 1000 , 15 % of the next Rs 800 and 20 % on any sales in excess of 1800

Pre-condition : lock = -1 to exit and 1< =lock < = 70 , 1<=stock <=80 and 1<=barrel<=90



s1 s4

\ /

1Mb,10ms \ 0.2Mb,10ms / 1Mb,10ms r1 ----------------- ----r2

1Mb,10ms / \ 1Mb,10ms / \

s2 s3

Apply TCP agent between S1-S4 and UDP between S2-S3. Apply relevant applications over TCP and UDP agents. By varying the

parameters, determine the packet delivery fraction for TCP and UDP.

3. Simulate the different types of Internet traffic such as FTP and TELNET over a network. Plot and analyze the instantaneous throughput using

Xgraph. 4. Simulate any topology of N nodes (6-10), change error rate and data rate

and compare the throughput of the link where error is introduced. 5. Simulate a topology of n nodes and plot the congestion window (use

slow start) for each source – destination pair.

6. Simulate the transmission of ping messages over a network of N nodes

and find the round trip time of each ping message.

Part – B

Implement the following in C++/Java 1. Using TCP/IP sockets, write a client – server program, the client sends

the file name and the server sends back the content of requested text file if present.

2. Using FIFO files as IPC channel , write a client – server program, the client sends the file name and the server sends back the content of requested text file if present

3. For the given network graph, write a program to implement Distance

Vector routing algorithm to build a routing table for the given node. 4. Write a program for frame sorting technique used in buffers.



5. Write a program for simple RSA algorithm to encrypt and decrypt the

data. 6. Write a program for error detecting code using CRC-CCITT (16- bits).

Open Ended Experiment

The Following experiments are conducted using Wireshark. 1. Use Wireshark to capture packets and perform packet analysis of HTTP

for the following. a. Basic HTTP GET/response interaction

Send a HTTP request to the following URL http://gaia.cs.umass.edu/wireshark-labs/HTTP-wireshark-file1.html using a web browser and Answer the following questions

i. Is your browser running HTTP version 1.0 or 1.1? What version of

HTTP is the server running? ii. What languages (if any) does your browser indicate that it can accept

to the server? iii. What is the IP address of your computer? Of the gaia.cs.umass.edu

server? iv. What is the status code returned from the server to your browser?

v. When was the HTML file that you are retrieving last modified at the

server? vi. How many bytes of content are being returned to your browser?

b. HTTP Conditional GET/response interaction

Send a HTTP request to the following URL

http://gaia.cs.umass.edu/wireshark-labs/HTTP-wireshark-file2.html and Answer the following questions

i. Inspect the contents of the first HTTP GET request from your browser to the server. Do you see an “IF-MODIFIED-SINCE” line in the HTTP GET?

ii. Inspect the contents of the server response. Did the server explicitly

return the contents of the file? How can you tell?

iii. Now inspect the contents of the second HTTP GET request from your browser to the server. Do you see an “IF-MODIFIED-SINCE:” line in the HTTP GET? If so, what information follows the “IF-MODIFIED-SINCE:” header?

iv. What is the HTTP status code and phrase returned from the server in

response to this second HTTP GET? Did the server explicitly return the contents of the file? Explain.

c. Retrieving the long documents.

http://gaia.cs.umass.edu/wireshark-labs/HTTP-wireshark-file1.html




Use the following URL into your browser to retrieve a long document

http://gaia.cs.umass.edu/wireshark-labs/HTTP-wireshark-file3.html and answer to the following.

i. How many HTTP GET request messages did your browser send? Which

packet number in the trace contains the GET message for the Bill or Rights?

ii. Which packet number in the trace contains the status code and phrase associated with the response to the HTTP GET request?

iii. What is the status code and phrase in the response? iv. How many data-containing TCP segments were needed to carry the

single HTTP response and the text of the Bill of Rights?

d. HTML Documents with Embedded Objects. Use the following URL http://gaia.cs.umass.edu/wireshark-labs/HTTP-wireshark-file4.html to capture the data and answer the following questions.

i. How many HTTP GET request messages did your browser send? To which Internet addresses were these GET requests sent?

ii. Can you tell whether your browser downloaded the two images serially, or whether they were downloaded from the two web sites in parallel?

e. HTTP Authentication

Capture the data for the following URL

http://gaia.cs.umass.edu/wireshark-labs/protected_pages/HTTP-wireshark-file5.html and use the following data , username (wireshark-students) and password (network) while capturing and answer the following

i. What is the server’s response (status code and phrase) in response to

the initial HTTP GET message from your browser? ii. When your browser’s sends the HTTP GET message for the second time,

what new field is included in the HTTP GET message?

2. Use Wireshark to capture DNS packets and perform packet analysis of

DNS by making use of nslookup command.

a. With your browser, visit the Web page: http://www.google.com and answer the following questions

i. Locate the DNS query and response messages. Are then sent over UDP or TCP?

ii. What is the destination port for the DNS query message? What is the source port of DNS response message?

iii. To what IP address is the DNS query message sent? Use nm-tool to determine the IP address of your local DNS server. Are these two IP addresses the same?




http://gaia.cs.umass.edu/wireshark-labs/protected_pages/HTTP-wireshark-file5.html

http://gaia.cs.umass.edu/wireshark-labs/protected_pages/HTTP-wireshark-file5.html

http://www.google.com/



iv. Examine the DNS query message. What “Type” of DNS query is it?

Does the query message contain any “answers”? v. Examine the DNS response message. How many “answers” are

provided? What do each of these answers contain?

b. Do an nslookup on www.google.com and answer the following

questions i. What is the destination port for the DNS query message? What is the

source port of DNS response message?

ii. To what IP address is the DNS query message sent? Is this the IP address of your default local DNS server?

iii. Examine the DNS query message. What “Type” of DNS query is it?

Does the query message contain any “answers”? iv. Examine the DNS response message. How many “answers” are

provided? What do each of these answers contain?

c. Execute the following command “nslookup –type=NS www.google.com ”

to answer the following questions i. To what IP address is the DNS query message sent? Is this the IP

address of your default local DNS server? ii. Examine the DNS query message. What “Type” of DNS query is it?

Does the query message contain any “answers”? iii. Examine the DNS response message. What google nameservers does

the response message provide? Does this response message also provide the IP addresses of the google nameservers?

d. Execute the following command “nslookup www.gmail.com

ns1.google.com ” and answer the following questions i. To what IP address is the DNS query message sent? Is this the IP

address of your default local DNS server? If not, what does the IP address correspond to?

ii. Examine the DNS query message. What “Type” of DNS query is it? Does the query message contain any “answers”?

iii. Examine the DNS response message. How many “answers” are provided? What does each of these answers contain?

3. a. Use Wireshark to perform packet analysis of TCP. Capture a bulk TCP

transfer from your computer to a remote server. Do the following.

1. Start up your web browser. Go to the http://gaia.cs.umass.edu/wireshark-labs/alice.txt and retrieve an ASCII copy of Alice in Wonderland. Store this file somewhere on your computer.

2. Next go to http://gaia.cs.umass.edu/wireshark-labs/TCP-wireshark-file1.html.



http://gaia.cs.umass.edu/wireshark-labs/alice.txt

http://gaia.cs.umass.edu/wireshark-labs/TCP-wireshark-file1.html

http://gaia.cs.umass.edu/wireshark-labs/TCP-wireshark-file1.html



3. Next Upload the alice.txt file to capture the data. Answer the following queries i. What is the IP address and TCP port number used by the client

computer (source) that is transferring the file to gaia.cs.umass.edu? ii. What is the IP address of gaia.cs.umass.edu? On what port number is

it sending and receiving TCP segments for this connection? iii. What is the sequence number of the TCP SYN segment that is used to

initiate the TCP connection between the client computer and gaia.cs.umass.edu? What is it in the segment that identifies the

segment as a SYN segment? iv. What is the sequence number of the SYNACK segment sent by

gaia.cs.umass.edu to the client computer in reply to the SYN? What is

the value of the Acknowledgement field in the SYNACK segment? How did gaia.cs.umass.edu determine that value? What is it in the segment that identifies the segment as a SYNACK segment?

v. What is the sequence number of the TCP segment containing the HTTP POST command?

vi. Consider the TCP segment containing the HTTP POST as the first segment in the TCP connection. What are the sequence numbers of the first six segments in the TCP connection (including the segment containing the HTTP POST)? At what time was each segment sent?

When was the ACK for each segment received? Given the difference between when each TCP segment was sent, and when its

acknowledgement was received, what is the RTT value for each of the six segments?

vii. What is the length of each of the first six TCP segments? viii. What is the minimum amount of available buffer space advertised at

the received for the entire trace? Does the lack of receiver buffer space ever throttle the sender?

ix. Are there any retransmitted segments in the trace file? What did you check for (in the trace) in order to answer this question?

x. What is the throughput (bytes transferred per unit time) for the TCP connection? Explain how you calculated this value.

b. Use Wireshark to perform packet analysis of UDP and answer the

following. i. Select one UDP packet from your trace. From this packet, determine

how many fields are there in the UDP header. Name these fields. ii. By consulting the displayed information in Wireshark’s packet content

field for this packet, determine the length (in bytes) of each of the UDP header fields.

iii. The value in the Length field is the length of what? iv. What is the maximum number of bytes that can be included in a UDP

payload? v. What is the largest possible source port number?



vi. What is the protocol number for UDP? Give your answer in both

hexadecimal and decimal notation. vii. Examine a pair of UDP packets in which your host sends the first UDP

packet and the second UDP packet is a reply to this first UDP packet.

Describe the relationship between the port numbers in the two packets.

4. Use Wireshark to capture an IP packet and analyze the header and

payload of IP packet. Sending a request to gaia.cs.umass.edu using

traceroute command and set three different packet sizes : say 56bytes, 2000bytes and 3500bytes respectively to capture the same.

a. IP basics

Answer the following Questions i. Select the first ICMP Echo Request message sent by your computer,

and expand the Internet Protocol part of the packet in the packet details window. What is the IP address of your computer?

ii. Within the IP packet header, what is the value in the upper layer protocol field?

iii. How many bytes are in the IP header? How many bytes are in the payload of the IP datagram? Explain how you determined the number

of payload bytes. iv. Has this IP datagram been fragmented? Explain how you determined

whether or not the datagram has been fragmented. v. Which fields in the IP datagram always change from one datagram to

the next within this series of ICMP messages sent by your computer? vi. Which fields stay constant? Which of the fields must stay constant?

Which fields must change? Why?

b. Fragmentation Sort the packet listing according to time again by clicking on the Time column. Answer the following Questions.

1. Find the first ICMP Echo Request message that was sent by your

computer after you changed the Packet Size to be 2000. Has that message been fragmented across more than one IP datagram?

2. Print out the first fragment of the fragmented IP datagram. What information in the IP header indicates that the datagram been

fragmented? What information in the IP header indicates whether this is the first fragment versus a latter fragment? How long is this IP datagram?

3. Print out the second fragment of the fragmented IP datagram. What information in the IP header indicates that this is not the first datagram fragment? Are the more fragments? How can you tell?



4. What fields change in the IP header between the first and second

fragment? Now find the first ICMP Echo Request message that was sent by your

computer after you changed the Packet Size to be 3500. 5. How many fragments were created from the original datagram? 6. What fields change in the IP header among the fragments? Note:

1. Two experiments to be executed in the exam based on lots.

2. One experiment is from Part B and another experiment can be from Part A.

3. One experiment each from Part A and Part B is Compulsory.

References: 1. Computer Networking: A Top-Down Approach by James F. Kurose ,

Keith W. Ross, Sams Teach Yourself Series (6th Edition) 2012. 2. www.wireshark.org/ 3. www.isi.edu/nsnam/ns/ 4. Computer Networks: A Systems Approach, Larry L Peterson and

Bruce S Davie 5th Edition, Elsevier ,2011

5. Advanced Programming in the Unix Environment by W. Richard Stevens, Stephen A. Rago Addison-Wesley, 2008

http://www.google.co.in/search?tbo=p&tbm=bks&q=inauthor:

http://www.google.co.in/search?tbo=p&tbm=bks&q=inauthor:

SCHEME & SYLLABUSOF VII & VIII SEMESTERS B.E. · practice. 7. Environment and ... End Exam Marks....

Documents

Transcript of SCHEME & SYLLABUSOF VII & VIII SEMESTERS B.E. · practice. 7. Environment and ... End Exam Marks....