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.
More Information
Applicant Information
- Delivery Method: On-Campus, Online, Hybrid
- Entrance Exam: GRE (GRE- where required, see program website.)
- Interview Required: None
Faculty
- B. Jayant Baliga
- Mesut E. Baran
- Salah M. A. Bedair
- Subhashish Bhattacharya
- Alper Yusuf Bozkurt
- Gregory T. Byrd
- Rada Yuryevna Chirkova
- Mo-Yuen Chow
- Hantao Cui
- Mihail Cutitaru
- Huaiyu Dai
- William Rhett Davis
- Alexandra Duel-Hallen
- Michael James Escuti
- Do Young Eun
- Demitry Farfurnik
- Brian Allan Floyd
- Paul D. Franzon
- John Gajda
- John J. Grainger
- Edward Grant
- Robert Wendell Heath
- Fu-Chen Hsiao
- Brian L Hughes
- Iqbal Husain
- Ki Wook Kim
- Frederick Anthony Kish Jr.
- Robert Michael Kolbas
- Hamid Krim
- Yuan Liu
- Frederick J. Livingston
- Ning Lu
- Srdjan Miodrag Lukic
- Leda Lunardi
- Thomas Kenan Miller III
- Veena Misra
- Rainer Frank Mueller
- John F. Muth
- H. Troy Nagle Jr.
- Arne Nilsson
- Omer Oralkan
- Mehmet Cevdet Ozturk
- Harilaos George Perros
- Douglas Stephen Reeves
- James Lee Reynolds
- Eric Rotenberg
- Mihail Lorin Sichitiu
- Daniel D. Stancil
- Michael B. Steer
- J K Townsend
- James Tuck
- Daryoosh Vashaee
- John Victor Veliadis
- Ioannis Viniotis
- Wenye Wang
- Jonathan Wierer
- Huiyang Zhou
- Jacob James Adams
- Dror Zeev Baron
- Michela Becchi
- Aranya Chakrabortty
- Alexander G. Dean
- Qing Gu
- Ismail Guvenc
- Khaled Abdel Hamid Harfoush
- Michael W. Kudenov
- Edgar Lobaton
- Zeljko Pantic
- Nuria Gonzalez Prelcic
- David Ricketts
- Nitin Sharma
- Cranos M. Williams
- Chengying Xu
- Aydin Aysu
- Amay Jairaj Bandodkar
- Michael Daniele
- Yaoyao Jia
- Shih-Chun Lin
- Spyridon Pavlidis
- Bradley Galloway Reaves
- Muhammad Shahzad
- Wenyuan Tang
- Chau-Wai Wong
- Tianfu Wu
- Gregory Edward Bottomley
- Laura J. Bottomley
- James Paul Dieffenderfer
- Robert Joseph Evans
- Rachana Ashok Gupta
- Douglas C. Hopkins
- Steven Wade Hunter
- Steven D. Jackson
- Bongmook Lee
- David Lee Lubkeman
- Robert Dwight Oden Jr.
- Hatice Orun Ozturk
- Veety,Elena Nicolescu
- Tania Milkova Paskova
- Andrew J. Rindos III
- Elena Nicolescu Veety
- Leonard Wilson White
- Donna G. Yu
- Wensong Yu
- Winser E. Alexander
- George F. Bland
- David H. Covington
- Tildon H. Glisson Jr.
- John R. Hauser
- Michael A. Littlejohn
- David Franklin McAllister
- Carlton M. Osburn
- Wilbur Carroll Peterson
- Sarah Ann Rajala
- Wesley E. Snyder
- Kaixiong Zhou
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, ST 371, CSC 258 and Senior standing or Graduate standing
Typically offered in Fall, Spring, and Summer
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/ECE 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.
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/CSC 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).
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.
Typically offered in Spring only
This course is offered alternate even years
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 MA 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
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
This course is offered alternate even years