|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
Prerequisite(s): Undergraduate probability and analysis. Course open to Seniors and Graduate Students in SEAS and Wharton. All others need permission of the instructor. This is an introductory course on packet networks and associated protocols that form the basis of today's communication infrastructure, with a particular emphasis on IP based networks such as the Internet. The course introduces the various design and implementation choices that are behind the development of modern networks, and emphasizes basic analytical understanding in motivating those choices. Topics are covered in a mostly "bottom-up" approach, starting with a brief review of physical layer issues such as digital transmission, error correction and error recovery strategies. This is then followed by a discussion of link layer aspects, including multiple access control (MAC) strategies, local area networks (Ethernet, token rings, and 802.11 wireless LANs), and general store-andforward packet switching. Network layer solutions, including IP addressing, naming, and routing are covered next, before exploring transport layer and congestion control solutions such as TCP. Finally, basic approaches for quality-ofservice and network security are examined. Specific applications and aspects of data compression and streaming may also be covered.
-
3.00 Credits
Prerequisite(s): ESE 530 or STAT 530 or equivalent. Stochastic processes are introduced as drivers of queues to provide an analytical platform for the analysis of delays in networks models. Topics covered are selected from: Delay models in the network layer; the Poisson process; renewal processes, rewards, and the renewal theorem; Little's law; Markov chains; semi-Markov processes; Markov processes; ergodicity, limit laws and stationary distributions; M/M/1, M/M/m, M/M/m/m queues; alternating renewal processes and fluid flow models; M/G/1, G/M/1, G/G/1 queues; the Pollaczek-Khinchin formulae; priority classes; timereversibility; networks of queues; Jackson networks.
-
3.00 Credits
Prerequisite(s): TCOM 500 or equivalent. The course delves into the details of the many protocols whose combined operation is behind modern data networks. It starts with reviewing issues associated with naming and addressing, and in particular solutions that work at the Internet scale. This is followed by an in-depth review of the Internet's "control plane," namely the different routing protocols that govern packet forwarding decisions, including unicast (RIP2, EIGRP, OSPF, BGP, etc.) and multicast (DVMRP, CBT, PIM, etc.) routing protocols. The challenges associated with implementing efficient packet forwarding decisions are then discussed and illustrated through several representative techniques and algorithms. Next, the course introduces technologies that implement advanced functionalities over IP networks, including signaling protocols, e.g., RSVP, used to request service guarantees from the network, and protocols such as MPLS and MP-BGP that enable the efficient deployment of virtual private networks and traffic engineering solutions. If time permits, topics related to service classes and traffic management, as well as interactions between IP and other networking technologies, e.g., ATM, may also be covered.
-
3.00 Credits
Faculty. This course is designed to provide an understanding of the physcial aspects of telecommunications systems. This includes an understanding of waves and wave propagation, basic optics, the operation of optical fibers and fiber communication systems, an introduction to optical networks, free-space optical communications, and an understanding of simple antennas and arrays and their use in wireless communications.
-
3.00 Credits
Prerequisite(s): TCOM 500 or TCOM 512. This course provides a basic introduction to wireless networking. The focus is on layers 2 and 3 of the OSI reference model, design, performance analysis and protocols. The topics covered include: an introduction to wireless networking, digital cellular, next generation PCS, wireless LANs, wireless ATM, mobile IP.
-
3.00 Credits
Prerequisite(s): Undergraduate linear systems and elementary probability theory. System/Network Design, cellular concepts, resource management, radio management, radio channel propagation fundamentals, modulation, fading countermeasure, diversity, coding, spread spectrum, multiple access techniques.
-
3.00 Credits
Prerequisite(s): TCOM 370 (prerequisite) or TCOM 500 (can be corequisite), and sufficient programming knowledge to edit, write, and debug programs in C, and basic undergraduate mathematical background including elementary probability. This course covers the design, analysis, and implementation of application- and transport-level protocols. We teach basic techniques of framing, error recovery, reliable delivery, flow control, adaptation to congestion, presentation (and representation) of data, authentication and security, as applied to conversational, transactional, and dissemination- oriented transport and application level protocols. In addition to hands-on experience designing and implementing network protocols in C using the BSD socket interface, we also teach elementary modeling (through both simulation and analytic models) and measurement of network protocols.
-
3.00 Credits
Prerequisite(s): Requires undergraduate-level knowledge of complex variables, vector calculus and random processes. This graduate level course explores several important topics related to the analysis and design of optical transport networks. Topics covered include the propagation of signals in optical fiber, optical components, signal rates and formats, transmission engineering, time-division multiplexing (TDM), wavelength division multiplexing (WDM), layered network architectures, virtual topology design, network survivability and network management.
-
3.00 Credits
This is an introduction to topics in the security of computer systems and communication on networks of computers. The course covers four major areas: fundamentals of cryptography, security for communication protocols, security for operating systems and mobile programs, and security for electronic commerce. Sample specific topics include: passwords and offline attacks, DES, RSA, DSA, SHA, SSL, CBC, IPSec, SET, DDos attacks, biometric authentication, PKI smart cards, S/MIME, privacy on the Web, viruses, security models, wireless security, and sandboxing. Students will be expected to display knowledge of both theory and practice through written examinations and programming assignments.
-
3.00 Credits
Traffic management and call admission: traffic characterization traffic shaping, admission control, statistical multiplexing, effective bandwidth. Scheduling: fair queuing, rate-controlled service disciplines. Buffer management: pushout, threshold, random early detection, sharing mechanisms (complete partitioning, complete sharing, hybrids), coupling buffer management and scheduling. Markov decision process and application in resource allocation (memory, badwidth allocation). Switching: input queuing, output queuing, shared memory, combined input/output queuing. Maximum throughout in input queued switches, emulating output queuing with input queuing via speedup. Building larger switches: CIOS networks, banyan netowrks, etc. TCP modeling.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|