Page 106 - R2017-REC-ECE-UG Syllabus
P. 106

Department of ECE, REC




                UNIT I        NETWORK ROUTING                                                     9
                An  Introduction  to  Routing  algorithms,  Functions  of  Router  IP  Addressing,  Protocol  Stack  Architecture,
                Network Topology and Management architectures, PSTN, Communication Technologies, Network Protocol
                Analyzer.

                UNIT II ROUTING ALGORITHMS: SHORTEST PATH AND WIDEST PATH                         9
                Bellman Ford algorithm and distance vector approach, Dijikstra’s algorithm, Comparison of Bellman Ford
                algorithm  and  Dijikstra’s  algorithm,  shortest  and  widest  path  computation,    k-shortest  path  algorithms,
                Routing Protocols: Framework and Principles.

                UNIT III      ROUTING IN IP NETWORKS                                              9
                IP Routing and Distance Vector Protocol Family, Routers, Networks, and Routing information Basics, RIP
                v1,v2  –  IGRP  –  EIGRP,  OSPF  and  integrated  IS-IS,  IP  Traffic  Engineering,  BGP,  Internet  Routing
                Architectures.

                UNIT IV        ROUTING IN WIRELESS NETWORKS                                       9
                Internet based mobile ad-hoc networking, Destination sequenced Distance Vector (DSDV), Dynamic source
                Routing  (DSR),  Ad-hoc  on  demand  Distance  Vector  (AODV),  Temporarily  Ordered  Routing  algorithm
                (TORA).

                UNIT V        ROUTING IN OPTICAL WDM NETWORKS                                     9
                Classification of RWA algorithms, RWA algorithms, Fairness and Admission Control, Distributed Control
                Protocols,  Permanent  Routing  and  Wavelength  Requirements,  Wavelength  Rerouting  Benefits  and  Issues,
                Light path Migration, Rerouting Schemes, Algorithms- AG, MWPG.
                                                                                       TOTAL= 45 PERIODS

                OUTCOMES:
                    •  Ability to understand the data transfer mechanisms over the conventional network.
                    •  Foster ability to select the optimal routing algorithm for any given network based on path distance.
                    •  Acquired knowledge about routing in IP networks.
                    •  Ability to manifest the skills in applying suitable routing technique for wireless networks.
                    •  Demonstrate the ability to understand the features of routing in WDM networks.




                REFERENCES:
                1.  D.Medhi  and  K.Ramasamy,  Network  Routing:  Algorithms,  Protocols  and  Architectures,  Morgan
                    Kaufmann Publishers, First Edition 2007.
                2.  Steen Strub M, Routing in Communication networks, Prentice Hall International, 1995.
                3.  C.Siva Ram Murthy and B.S.Manoj, Adhoc Wireless Networks, Pearson Education, 2007.
                4.  Internetworking Technologies Handbook, Inc. Cisco Systems, ILSG Cisco.
                5.  William  Stallings,  ‗  High  speed  networks  and  Internets  Performance  and  Quality  of  Service‘,  IInd
                    Edition, Pearson Education Asia. Reprint India 2002.
                6.  M. Steen Strub, ‗ Routing in Communication network, Prentice –Hall International, Newyork, 1995.
                7.  S. Keshav, ‗An engineering approach to computer networking‘Addison Wesley 1999.
                8.  William Stallings, ‗High speed Networks TCP/IP and ATM Design Principles, Prentice- Hall, New York,
                    1995.
                9.  C.E Perkins, ‗Ad Hoc Networking‘, Addison – Wesley, 2001.

                Curriculum and Syllabus | B.E. Electronics and Communication Engineering | R2017     Page 106
   101   102   103   104   105   106   107   108   109   110   111