Computer Networking
The Master of Science in computer networking may be earned through the M.S. with thesis option or through the non-thesis option. Either option may be used as preparation for further graduate study or employment in industrial research, development or design environment, although students planning to continue on for a Ph.D. should discuss the option selected with their advisors.
The Master of Science in Computer Networking is also available as on online degree program. This degree has a non-thesis option, does not require on campus attendance, and may be used in preparation for further graduate student or employment in an industrial research, development or design environment. The program is available to USA residents and to United States military personnel serving overseas and it is offered online through Engineering Online.
Master's Degree Requirements
Computer networking core courses constitute 9 of the 30 minimum credit hours. Students take 12 additional credit hours of computer networking courses from one of four currently defined technical concentration areas: network design, network hardware, network software, or networking services. The remaining 9 credit hours may be taken from an approved management concentration sequence, as additional courses in the computer networking technical concentration areas, or as 6 hours of thesis and 3 credit hours from the list of approved computer networking courses. At least 6 of the 30 credits must come from the 700 level, and non-letter graded courses such as individual studies courses may account for a maximum of 3 credit hours.
Faculty
- Jacob James Adams
- Winser E. Alexander
- Aydin Aysu
- B. Jayant Baliga
- Amay Jairaj Bandodkar
- Mesut E. Baran
- Dror Zeev Baron
- Michela Becchi
- Salah M. A. Bedair
- Subhashish Bhattacharya
- George F. Bland
- Gregory Edward Bottomley
- Laura J. Bottomley
- Alper Yusuf Bozkurt
- Gregory T. Byrd
- Aranya Chakrabortty
- Rada Yuryevna Chirkova
- Mo-Yuen Chow
- David H. Covington
- Huaiyu Dai
- Michael Daniele
- William Rhett Davis
- Alexander G. Dean
- James Paul Dieffenderfer
- Alexandra Duel-Hallen
- Michael James Escuti
- Do Young Eun
- Robert Joseph Evans
- Brian Allan Floyd
- Paul D. Franzon
- John J. Grainger
- Edward Grant
- Qing Gu
- Rachana Ashok Gupta
- Ismail Guvenc
- Khaled Abdel Hamid Harfoush
- John R. Hauser
- Robert Wendell Heath
- Douglas C. Hopkins
- Brian L Hughes
- Steven Wade Hunter
- Iqbal Husain
- Andrew J. Rindos III
- Steven D. Jackson
- Yaoyao Jia
- Frederick Anthony Kish Jr.
- Robert Dwight Oden Jr.
- Tildon H. Glisson Jr.
- Ki Wook Kim
- Robert Michael Kolbas
- Hamid Krim
- Michael W. Kudenov
- Bongmook Lee
- Shih-Chun Lin
- Michael A. Littlejohn
- Yuchen Liu
- Xiaorui Liu
- Edgar Lobaton
- Ning Lu
- David Lee Lubkeman
- Srdjan Miodrag Lukic
- Leda Lunardi
- Thomas Kenan Miller III
- David Franklin McAllister
- Veena Misra
- Aritra Mitra
- Rainer Frank Mueller
- John F. Muth
- H. Troy Nagle Jr.
- Arne Nilsson
- Omer Oralkan
- John-Paul Ore
- Carlton M. Osburn
- Mehmet Cevdet Ozturk
- Hatice Orun Ozturk
- Zeljko Pantic
- Tania Milkova Paskova
- Spyridon Pavlidis
- Harilaos George Perros
- Wilbur Carroll Peterson
- Nuria Gonzalez Prelcic
- Sarah Ann Rajala
- Bradley Galloway Reaves
- Douglas Stephen Reeves
- David Ricketts
- Eric Rotenberg
- Muhammad Shahzad
- Nitin Sharma
- Mihail Lorin Sichitiu
- Wesley E. Snyder
- Daniel D. Stancil
- Michael B. Steer
- Wenyuan Tang
- J K Townsend
- James Tuck
- Daryoosh Vashaee
- Abraham Vazquez-Guardado
- Elena Nicolescu Veety
- John Victor Veliadis
- Suresh Venkatesh
- Ioannis Viniotis
- Wenye Wang
- Leonard Wilson White
- Jonathan Wierer
- Cranos M. Williams
- Chau-Wai Wong
- Tianfu Wu
- Lirong Xiang
- Chengying Xu
- Donna G. Yu
- Wensong Yu
- Huiyang Zhou
- Yong Zhu
Courses
General introduction to computer networks. Discussion of protocol principles, local area and wide area networking, OSI stack, TCP/IP and quality of service principles. Detailed discussion of topics in medium access control, error control coding, and flow control mechanisms. Introduction to networking simulation, security, wireless and optical networking.
Prerequisite: ECE 206 or CSC 312, ³§°ÕÌý371, CSC 258 and Senior standing or Graduate standing
Typically offered in Fall and Spring
Principles and issues underlying provision of wide area connectivity through interconnection of autonomous networks. Internet architecture and protocols today and likely evolution in future. Case studies of particular protocols to demonstrate how fundamental principles applied in practice. Selected examples of networked clinet/server applications to motivate the functional requirements of internetworking. Project required.
Prerequisite: CSC/·¡°ä·¡Ìý570
Typically offered in Fall, Spring, and Summer
This course presents foundational concepts of computer and network security and privacy. It covers a wide breadth of concepts, including; Fundamentals of computer security and privacy, including security models, policies, and mechanisms; Cryptography for secure systems, including symmetric and asymmetric ciphers, hash functions, and integrity mechanisms; Authentication of users and computers; Network attacks and defenses at the network and application layers; Common software vulnerabilities and mitigation strategies; Secure operating systems and seminal access control models and policies; Principles of intrusion detection; Privacy, including considerations of end-user technologies.
Prerequisite: (°ä³§°äÌý316 or ECE309) and (°ä³§°äÌý401 or ECE407) or equivalent
Typically offered in Fall and Spring
Introduction to cellular communications, wireless local area networks, ad-hoc and IP infrastructures. Topics include: cellular networks, mobility mannagement, connection admission control algorithms, mobility models, wireless IP networks, ad-hoc routing, sensor networks, quality of service, and wireless security.
Prerequisite: ECE/°ä³§°äÌý570
Typically offered in Spring only
Topics related to design and management of campus enterprise networks, including VLAN design; virtualization and automation methodologies for management; laboratory use of open space source and commercial tools for managing such networks.
Typically offered in Fall only
Algorithm design techniques: use of data structures, divide and conquer, dynamic programming, greedy techniques, local and global search. Complexity and analysis of algorithms: asymptotic analysis, worst case and average case, recurrences, lower bounds, NP-completeness. Algorithms for classical problems including sorting, searching and graph problems (connectivity, shortest paths, minimum spanning trees).
Prerequisite: °ä³§°äÌý316 and °ä³§°äÌý226
Typically offered in Fall, Spring, and Summer
Basic concepts of graph theory. Trees and forests. Vector spaces associated with a graph. Representation of graphs by binary matrices and list structures. Traversability. Connectivity. Matchings and assignment problems. Planar graphs. Colorability. Directed graphs. Applications of graph theory with emphasis on organizing problems in a form suitable for computer solution.
Prerequisite: °ä³§°äÌý226 or ²Ñ´¡Ìý351.
Typically offered in Spring only
Workload characterization, collection and analysis of performance data, instrumentation, tuning, analytic models including queuing network models and operational analysis, economic considerations.
Prerequisite: CSC 312 or ECE 206 and ²Ñ´¡Ìý421
Typically offered in Fall and Spring
Introduction for new graduate students to (a) information about graduate program, department, and university resources, and (b) research projects conducted by CSC faculty.
Typically offered in Fall and Spring
Introduction to the design and performance evaluation of network services. Topics include top-down network design based on requirements, end-to-end services and network system architecture, service level agreements, quantitative performance evaluation techniques. Provides quantitative skills on network service traffic and workload modeling, as well as, service applications such as triple play, internet (IPTV), Peer-to-peer (P2P), voice over IP (VoIP), storage, network management, and access services.
Prerequisite: CSC(ECE) 570 and CSC(ECE) 579
Typically offered in Spring only
Analytic modeling and topological design of telecommunications networks, including centralized polling networks, packet switched networks, T1 networks, concentrator location problems, routing strategies, teletraffic engineering and network reliability.
Prerequisite: CSC(ECE) 570
Typically offered in Spring only
The study of advanced topics of special interest to individual students under direction of faculty members.
Prerequisite: Graduate standing
Typically offered in Fall, Spring, and Summer
Thesis research.
Prerequisite: Master's student
Typically offered in Fall, Spring, and Summer
This course deals with the signal processing principles underlying recent advances in communications and networking. Topics include: smart-antenna and multi-input multi-output (MIMO) techniques; multiuser communication techniques (multiple access, power control, multiuser detection, and interference managment); signal processing in current and emerging network applications such as cognitive radio and social networks. Knowledge of linear alegbra and stochastic analysis is required.
Prerequisite: Graduate standing
Typically offered in Fall only