Professor’s Contact InformationTA’s Contact Information – will be provided laterGeneral Course InformationAssignments & Academic CalendarCourse PoliciesThese descriptions and timelines are subject to change at the discretion of the Professor.CourseCS 6385ProfessorNeeraj K GuptaTermFall 2014MeetingsM and W 7:00-8:15am ECSS 2.305Professor’s Contact InformationOffice Phone972 883 4656Office LocationECSS 3.207Email [email protected] HoursWed 1:30PM - 2:30 PMTue 10:00 AM - 12:00 PMOther InformationCourse materials available on elearningTA’s Contact Information – will be provided laterNameOffice LocationEmail AddressOffice HoursGeneral Course InformationPre-requisites, Co-requisites, & otherrestrictionsCS 5343 Algorithm Analysis & Data StructuresCS 5348 Operating Systems ConceptsTE 3341 Probability Theory and Statistics or equivalents.Course DescriptionPurpose and content of the course: The purpose of the course is to makestudents familiar with fundamental methods in the design and analysis of telecommunication networks. The main emphasis is on the methodology that remains valid on the long term and does not depend strongly on frequently changing applications.Outline of topics to be addressed: introduction to the network planning problem; mathematical programming for planning; network algorithms for planning; elements of network reliability; optimization for network design; network data analysis; selected topics form link level and networklevel traffic modeling and analysis for traffic engineering.Learning Outcomes By the end of the course, you should have in-depth knowledge of the following topicsFundamental concepts of network planning – b,cOptimization in network design – a,b,c,d,eGraph algorithms for network design – a,b,c,eAlgorithms and models for reliability analysis – a,b,c,eTraffic analysis for network planning – a,b,ca. an ability to understand advanced concepts in theory ofcomputer science;b. an ability to understand advanced concepts in applications of computer sciencec. an ability to apply knowledge of advanced computer science to formulate and analyze problems in computing and solve them;d. an ability to learn emerging concepts in theory and applications of computer science; and,e. an ability to design and conduct experiments as well as to analyze and interpret data.Required Texts &MaterialsNo Text Book.Suggested Texts,Readings, &MaterialsLecture notes. They are available online at the course website ineLearning.Assignments & Academic Calendar[Topics, Reading Assignments, Due Dates, Exam Dates]The following is a list of topics to be covered during the semester.- Fundamental concepts of network planning; Typical problems and issues in network design; Analysis vs. synthesis; Reasons for hardness in network planning; Decompositionapproach to mitigate hardness; Pathways to optimum design: exact, approximate, heuristic.- Optimization in network design; Linear Programming: formulation, solution principles, duality, network planning related applications; Integer Linear Programming: formulation,methods for linearizing non-linear integer programs, solution principles, exact and heuristic algorithms for integer programs, network design related applications.- Graph algorithms for network design; maximum flow; minimum cost flow; multicommodity flow; flow based network design; network vulnerability analysis via graph connectivity; structure of optimally connected graphs under uniform costs, various theorems and algorithms related to graph connectivity; Karger's randomized contraction algorithm for minimum cut, Nagamochi-Ibaraki minimum cut algorithm. Outlook to recent new results.- Algorithms and models for reliability analysis; Reliability concepts; Basic reliability configurations; More complex reliability configurations; Algorithms to compute exact and approximate network reliability; Lifetime measures; Computing network lifetime measures in various settings.- Traffic analysis for network planning; Integrating flow and queuing models in network planning to capture traffic considerations; Link capacity dimensioning for given flow andnetwork topology; Flow routing for given topology and link capacities; Combined capacity and flow assignment when only the network topology and the traffic demand is given; Heuristic methods for optimizing capacities, flow routing, and network topology together, when only the traffic matrix is known; Blocking probability models at the link level, and at the network level; Reduced load approximation and the Erlang fixed point equations (optional).Course PoliciesGrading (credit)Criteria Programming Projects (3-4), 60%, Final Exam, 40%.ALL WORK MUST BE INDIVIDUAL WORK. Cases of cheating will be forwarded to the Judicial Affairs office.Make-up Exams Only by consent of instructor under severe reasons.Extra Credit NoneLate Work Not allowedClass AttendanceI do not check for class attendance, but given the difficulty of the topics it is obviously necessary.ClassroomCitizenshipPlease participate and ask questions during class. It tends to slow down the pace and make the lectures more enjoyable.Other Misc.Items- Please bring your photo ID to each exam- NO RESTROOM BREAKS DURING EXAMS: I don’t take a restroom break, so neither do you!- Please in all your answers in your exams at least give a brief one or two sentence explanation of your answer. A “yes” or “no” answer is not allowed.- The final exam is given during the 3 hour slot indicated in the final exam schedule of the university. Please do not make travel reservations to leave town on a date earlier than this date.UT DallasSyllabus Policiesand ProceduresThe information contained in the following link constitutes the University’s policies and procedures segment of the course syllabus. Please go to http://go.utdallas.edu/syllabus-policies for these policies.These descriptions and timelines are subject to change at the discretion of the
View Full Document
Unlocking...