The course introduces analytical models and methodologies for modern networking, with focus on congestion control and routing. Topics from queueing theory, optimization, graph theory, distributed and asynchronous algorithms and their application to networking will be studied.
Networking - Theory and Fundamentals (EE 554)
Programs\Type | Required | Core Elective | Area Elective |
MA-European Studies | |||
MA-European Studies-Non Thesis | |||
MA-Political Science | |||
MA-Political Science-Non Thes | |||
MA-Visual Arts&Vis. Com Des-NT | |||
MA-Visual Arts&Visual Com Des | |||
MS-Bio. Sci. & Bioeng. LFI | |||
MS-Bio. Sci. & Bioeng. LFI-ENG | |||
MS-Biological Sci&Bioeng. | * | ||
MS-Computer Sci.&Eng. LFI | |||
MS-Computer Sci.&Eng. LFI-ENG | |||
MS-Computer Science and Eng. | * | ||
MS-Cyber Security(with thesis) | * | ||
MS-Data Science | |||
MS-Elec. Eng&Comp Sc.LFI-ENG | |||
MS-Electronics Eng&Comp Sc.LFI | |||
MS-Electronics Eng&Computer Sc | * | ||
MS-Electronics Eng. | * | ||
MS-Electronics Eng. LFI | |||
MS-Electronics Eng. LFI-ENG | |||
MS-Energy Techno.&Man. | * | ||
MS-Industrial Eng. LFI-ENG | |||
MS-Industrial Engineering | * | ||
MS-Industrial Engineering LFI | |||
MS-Manufacturing Eng-Non Thes | * | ||
MS-Manufacturing Engineering | * | ||
MS-Materials Sci & Engineering | * | ||
MS-Materials Sci. & Eng. LFI | |||
MS-Materials Sci.&Eng. LFI-ENG | |||
MS-Mathematics | |||
MS-Mechatronics | * | ||
MS-Mechatronics LFI | |||
MS-Mechatronics LFI-ENG | |||
MS-Physics | |||
MS-Physics-Non Thesis | * | ||
MS-Psychology | |||
MS-Psychology-Non Thesis | |||
PHD-Biological Sci&Bioeng. | * | ||
PHD-Comp. Sci and Eng.after UG | * | ||
PHD-Computer Science and Eng. | * | ||
PHD-Cyber Security | * | ||
PHD-Electronics Eng&ComputerSc | * | ||
PHD-Electronics Eng. | * | ||
PHD-Electronics Eng. after UG | * | ||
PHD-Experimental Psychology | |||
PHD-Industrial Engineering | * | ||
PHD-Management | |||
PHD-Manufacturing Eng after UG | * | ||
PHD-Manufacturing Engineering | * | ||
PHD-Materials Sci.&Engineering | * | ||
PHD-Mathematics | |||
PHD-Mechatronics | * | ||
PHD-Mechatronics after UG | * | ||
PHD-Physics | |||
PHD-Physics after UG | |||
PHD-Social Psychology | |||
PHDBIO after UG | * | ||
PHDCYSEC after UG | * | ||
PHDEECS after UG | * | ||
PHDEPSY after UG | |||
PHDIE after UG | * | ||
PHDMAN after UG | |||
PHDMAN after UG-Finance | |||
PHDMAN after UG-Man. and Org. | |||
PHDMAN after UG-Op.&Sup. Cha. | |||
PHDMAN-Finance Area | |||
PHDMAN-Man. and Org. Area | |||
PHDMAN-Op. & Supp. Chain Area | |||
PHDMAT after UG | * | ||
PHDMATH after UG | |||
PHDSPSY after UG |
CONTENT
OBJECTIVE
As networking systems such as the Internet, wireless and mobile networks are becoming increasingly versatile and complex, mathematical methods for modeling, analysis, and design of computer networks and their protocols have become important. A wide variety of mathematical tools and techniques drawn from the areas of convex optimization, stochastic modeling, and control theory help to unify and to understand the key concepts of protocol design for optimum performance in computer networks. Concern for optimal operation of networks is quite often of crucial importance in protocol design due to the scarcity of resources such as wireless spectrum and battery lifetime.
In this course, some of the major mathematical concepts and techniques underlying modern network design are described in the setting of concrete examples drawn from network design problems such as congestion control, wireless scheduling, and multi-access protocols. The significance of these concepts and tools goes far beyond the setting of the specific examples in which they are presented. As the mathematical topics we use here are quite vast and varied fields by themselves, we focus on how these different tools are often brought together to provide an understanding of the given problem in network design. We do not develop the mathematics beyond what is necessary to understand the networking examples we consider.
Update Date:
ASSESSMENT METHODS and CRITERIA
Percentage (%) | |
Final | 30 |
Midterm | 30 |
Term-Paper | 10 |
Participation | 5 |
Presentation | 25 |
RECOMENDED or REQUIRED READINGS
Textbook |
Bertsekas, Gallager, Data Networks |
Readings |
Papers from the literature will be distributed. |