Scribd Logo
Upload

Welcome to Scribd!

  • 28 views

    T1Rist University Faculty of Engineering 5th SEMESTER B.Tech., CSE, 2013-2014 Course Handout

    Uploaded by

    Sujy Cau
    This document provides details about the Computer Networks course offered at Trist University Faculty of Engineering in the 5th semester of B.Tech in CSE for 2013-2014. It includes information about the course objectives, topics to be covered, textbooks, reference books, lecture plan, evaluation scheme and instructor details. The course aims to introduce concepts of data communication and computer networking to understand layers like data link layer, network layer, transport layer and application layer. It will cover topics such as network models, protocols, transmission media, error detection, flow control, routing, transport layer services, security and cryptography. Students will be evaluated through assignments, mid semester exam, end semester exam and lab exams.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd

    T1Rist University Faculty of Engineering 5th SEMESTER B.Tech., CSE, 2013-2014 Course Handout

    Uploaded by

    Sujy Cau
    28 views5 pages
    This document provides details about the Computer Networks course offered at Trist University Faculty of Engineering in the 5th semester of B.Tech in CSE for 2013-2014. It includes information about the course objectives, topics to be covered, textbooks, reference books, lecture plan, evaluation scheme and instructor details. The course aims to introduce concepts of data communication and computer networking to understand layers like data link layer, network layer, transport layer and application layer. It will cover topics such as network models, protocols, transmission media, error detection, flow control, routing, transport layer services, security and cryptography. Students will be evaluated through assignments, mid semester exam, end semester exam and lab exams.

    Original Description:

    course plan

    Original Title

    Network

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document provides details about the Computer Networks course offered at Trist University Faculty of Engineering in the 5th semester of B.Tech in CSE for 2013-2014. It includes information about the course objectives, topics to be covered, textbooks, reference books, lecture plan, evaluation scheme and instructor details. The course aims to introduce concepts of data communication and computer networking to understand layers like data link layer, network layer, transport layer and application layer. It will cover topics such as network models, protocols, transmission media, error detection, flow control, routing, transport layer services, security and cryptography. Students will be evaluated through assignments, mid semester exam, end semester exam and lab exams.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    28 views5 pages

    T1Rist University Faculty of Engineering 5th SEMESTER B.Tech., CSE, 2013-2014 Course Handout

    Uploaded by

    Sujy Cau
    This document provides details about the Computer Networks course offered at Trist University Faculty of Engineering in the 5th semester of B.Tech in CSE for 2013-2014. It includes information about the course objectives, topics to be covered, textbooks, reference books, lecture plan, evaluation scheme and instructor details. The course aims to introduce concepts of data communication and computer networking to understand layers like data link layer, network layer, transport layer and application layer. It will cover topics such as network models, protocols, transmission media, error detection, flow control, routing, transport layer services, security and cryptography. Students will be evaluated through assignments, mid semester exam, end semester exam and lab exams.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    of 5

    T1RIST UNIVERSITY FACULTY OF ENGINEERING 5th SEMESTER B.Tech., CSE, 2013-2014 COURSE AN!

    OUT Date: 03/06/2013 In addition to prescribed syllabus for all courses appended to the timetable this portion gives further specific details regarding the course. C"#$%e N" C"#$%e T&t'e F,c#'tE2,&' 1. C"#$%e !e%c$&1t&"/(
    !o introduce the concepts" terminologies and technologies used in modern days data communication and computer net#or$ing.

    : CS533 ( COM)UTER NET*OR+S : .,-,%#$-, Ve/#0"1,',/ : [email protected]

    2. Sc"1e ,/3 O45ect&6e(


    !o understand computer net#or$ing and communication aspects as applied in modern data communication. !o understand the concepts of data communications. data lin$ layer. net#or$ layer.. transport layer application layer

    3. Te7t B""8(

    !1.

    %ehrou& '. (orou&an" )Data communication and *et#or$ing+" !ata ,c-ra#./ill" 2006.

    4. Re9e$e/ce B""8%(

    01. 02. 03. 0:.

    1ames (. 2urose and 2eith 3. 0oss" )4omputer *et#or$ing: ' !op.Do#n 'pproa!1 (eaturing the Internet+" 5earson 6ducation" 2012. 7arry 7.5eterson and 5seter 8. Davie" )4omputer *et#or$s+" /arcourt 'sia 5vt. 7td." 8econd 6dition. 'ndre# 8. !anenbaum" )4omputer *et#or$s+" 9th 6dition" 5earson 2012. 3illiam 8tallings" )Data and 4omputer 4ommunication+" 8i;th 6dition" 5earson 6ducation" 200<.

    5. C"#$%e )',/( Lect#$e N".


    1 2 3

    Le,$/&/0 O45ect&6e%
    !o understand the concepts of data communications. !o understand the concepts of data communications. !o understand the concepts of data communications. !o understand the concepts of data communications. !o understand the concepts of data communications. !o understand the concepts of data communications. !o understand the concepts of data communications. !o understand the concepts of data communications. data lin$ layer. data lin$ layer. data lin$ layer. data lin$ layer. data lin$ layer. data lin$ layer. data lin$ layer. data lin$ layer. data lin$ layer. data lin$ layer. net#or$ layer net#or$ layer net#or$ layer net#or$ layer net#or$ layer net#or$ layer

    T"1&c% t" 4e c"6e$e3


    4omponents = Data flo# directions" *et#or$ definitions !ypes of connections" topologies *et#or$ ,odels and 4ategories" interconnections !he internet 5rotocols and standards >8I ,odel 7ine 4oding " !ransmission media = guided and unguided ,odems" 08232 Interfacing 6rror detection and correction 5arity" 704" 404" /amming 4ode (lo# and 6rror control 8top A 3ait" go bac$.* '0B 8elective repeat '0B" sliding #indo# /D74 7'*" 6thernet I666 ?02.3 I666 ?02.:" I666 ?02.9 I666 ?02.11" (DDI" 8>*6! %ridges Internet#or$ing 5ac$et s#itching and datagram I5 addressing 8ubnetting fundamentals 8ubnetting advanced 0outing = intrinsic and e;trinsic

    Re9e$e/ce
    !1. 1.1 !1. 1.2 !1. 1.2

    : 9 6 < ? @ 10 11 12 13 1: 19 16 1< 1? 1@ 20 21 22 23 2:

    !1. 1.2 !1. 1.2 !1. 2.3 !1.:.1 [email protected] !1. 10.1 !1.10.3.10.: !1.11.2 !1.11.9 !1.11.9 !1.11.6 !1.13.2 !1.12.2 !1.1:.1"1<.1 !1.19.1 !1.20.1 !1.20.2 [email protected]"21.1 [email protected] [email protected] !1.22.3

    29 26 2< 2? 2@ 30 31 32 33 3: 39 36 3< 3? 3@ :0 :1 :2 :3 :: :9

    net#or$ layer net#or$ layer net#or$ layer net#or$ layer !o study the functions 69of transport layer transport layer transport layer transport layer transport layer transport layer transport layer transport layer transport layer application layer application layer application layer application layer application layer application layer application layer application layer

    Distance vector routing = 0I5 7in$ 8tate 0outing = >85( 0outers 0outing table and I5 0outing !ransport layer services ,utiple;ing a transport layer Demultiple;ing a transport layer 8oc$ets CD5 !45 4ongestion control B>8 Integrated 8ervices D*8 8,!5 (!5 /!!5" 333 !67*6! 8ecurity 4ryptography 8*,5

    !1.22.3 !1.22.3 !1.22.: !1.22.: !1.23.1 !1.23.1 !1.23.1 !1.23.3 !1.23.2 !1.23.3 !1.2:.2.2:.3 !1.2:.9 !1.2:.< !1.29.2.29.: !1.26.2 !1.26.3 !1.2<.3 !1.26.1 !1.30.1 !1.30.2 !1.2?.1.2?.2

    *%: 'mong the four hours of lectures in a #ee$" one hour #ill be considered e;clusively as a tutorial hour. !he above.mentioned lecture hours are #ithout ta$ing into consideration the tutorial hours. 'long #ith the above :9 lectures you #ould also be having 19 hours of tutorial sections" #hi!1 #ould ma$e it to a total of 60 hours :. "2e ,%%&0/2e/t% #ill be announced in the class.

    ;. E6,'#,t&"/ ST1e2e(
    EC N". 1 2 3 : E6,'#,t&"/ C"21"/e/t 4I' I 4I' II 4I' III 8emester 6;am M"3#'e ,86 Bui& 'ssignment 686 !#$,t&"/ <2&/= 120 ..... ..... 1?0 !,te, T&2e > Ve/#e 2nd 'ug 2013 2?th 1une" 12th 1uly 2013 "26th 'ug" 6th 8ep 2013 >ct 2013

    ?. !,te,T&2e,Ve/#e>T1,24e$ C"/%#'t,t&"/ @. M,8e-#1 )"'&c-(

    "#$%( !o be announced in the class.

    ,a$e Cp for any component #ill be given only in genuine cases. In all cases prior intimation must be given to faculty concerned. In case of any $ind of illness a DoctorDs certificate is mandatory.

    10. N"t&ce%( *otices regarding the course #ill be displayed on the general notice board of %loc$ II A the course #eb page.

    Instructor . In =4harge 1ayasurya E

    8plit /ori&on 'nother solution is called split hori&on. In this strategy" instead of flooding the table through each interface" each node sends only part of its table through each interface. If" according to its table" node % thin$s that the optimum route to reach F is via '" it does not need to advertise this piece of information to 'G the information has corne from ' H' already $no#sI. !a$ing information from node '" modifying it" and sending it bac$ to node ' creates the confusion. In our scenario" node % eliminates the last line of its routing table before it sends it to '. In this case" node ' $eeps the value of infinity as the distance to F. 7ater #hen node ' sends its routing table to %" node % also corrects its routing table. !he system becomes stable after the first update: both node ' and % $no# that F is not reachable. 8plit /ori&on and 5oison 0everse Csing the split hori&on strategy has one dra#bac$. *ormally" the distance vector protocol uses a timer" and if there is no ne#s about a route" the node deletes the route from its table. 3hen node % in the previous scenario eliminates the route to F from its advertisement to '" node ' cannot guess that this is due to the split hori&on strategy Hthe source of information #as 'I or because % has not received any ne#s about F recently. !he split hori&on strategy can be combined #ith

    the poison reverse strategy. *ode % can still advertise the value for F" but if the source of information is '" it can replace the distance #ith infinity as a #arning: JDo not use this valueG #hat I $no# about this route comes from you.J

    You might also like