A tantárgyleírás hatályossága
Hatályosság kezdete:
2026. March 21.
Hatályosság vége:
—
| Subject name (Hungarian, English) |
Network Planning
Network Planning
|
||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Subject code | BMEVITMAV51 | ||||||||||||
| Subject type | — | ||||||||||||
| Training Level | — | ||||||||||||
| Course types and hours (weekly/semester) |
|
||||||||||||
| Assessment type | félévközi érdemjegy | ||||||||||||
| Credits | 2 | ||||||||||||
| Subject coordinator |
DR. Maliosz Markosz
position: egyetemi docens
contact:
maliosz.markosz@vik.bme.hu
|
||||||||||||
| Responsible department |
Távközlési és Mesterséges Intelligencia Tanszék
|
||||||||||||
| Faculty | Villamosmérnöki és Informatikai Kar | ||||||||||||
| Subject website | — | ||||||||||||
| Primary curriculum type | — | ||||||||||||
| Direct prerequisites – Strong prerequisite | none | ||||||||||||
| Direct prerequisites – Weak prerequisite | none | ||||||||||||
| Direct prerequisites – Parallel prerequisite | none | ||||||||||||
| Direct prerequisites – Milestone prerequisite | none | ||||||||||||
| Direct prerequisites – Exclusion | none |
Objectives
Programme
Planning of backbone networks
1. Overview of network planning: inputs, outputs, goals, trends, costs, cost functions; basic algorithms
2. Linear programming, flow problems, heuristics algorithms in network design
Problems
3. Topology design: spanning tree, ring
4. Traffic engineering: shortest path, minimum cost flow, minimum cost multicommodity flow
5. Joint topology and routing design
6. Virtual networks: traffic models, topology planning, dimensioning
Protection and restoration
7. Availability
8. Dedicated and shared protection
9. Restoration and protection
10. Multi-layer protection
Planning of access networks
11. Triple play, service architectures in access networks
12. Ethernet: bridging, forwarding, topology, spanning tree protocols, VLAN
13. Carrier Ethernet: multicast, scalability, management
14. Load balancing, traffic engineering, QoS and protection
1. Overview of network planning: inputs, outputs, goals, trends, costs, cost functions; basic algorithms
2. Linear programming, flow problems, heuristics algorithms in network design
Problems
3. Topology design: spanning tree, ring
4. Traffic engineering: shortest path, minimum cost flow, minimum cost multicommodity flow
5. Joint topology and routing design
6. Virtual networks: traffic models, topology planning, dimensioning
Protection and restoration
7. Availability
8. Dedicated and shared protection
9. Restoration and protection
10. Multi-layer protection
Planning of access networks
11. Triple play, service architectures in access networks
12. Ethernet: bridging, forwarding, topology, spanning tree protocols, VLAN
13. Carrier Ethernet: multicast, scalability, management
14. Load balancing, traffic engineering, QoS and protection
In the course students
will learn network planning, design, operation, and maintenance of
infocommunication networks, with particular emphasis also on practical aspects.
Topics: Design and configuration issues with planning and optimization methods,
reliability, survivability, protection and recovery requirements and methods.
Learning outcomes
Ez a tantárgy a KKK rendeletben meghatározott, következő kompetenciák fejlesztését szolgálja:
Knowledge
No learning outcomes recorded.
Skills
No learning outcomes recorded.
Attitudes
No learning outcomes recorded.
Autonomy and responsibility
No learning outcomes recorded.
Oktatási módszertan
Two hours of classroom
lecture weekly The lectures include practical case studies and design examples
too.
Tanulástámogató anyagok
Online források
Handbook of; Optimization in Telecommunications, Edited by Mauricio G. C. Resende and Panos; M. Pardalos, Published by Spinger Science + Business Media Inc., New York.; March 2006, ISBN: 0-38-730662-5; Planning Telecommunication Networks, Thomas G.; Robertazzi, Published by Wiley-IEEE Press, December 1998, ISBN:; 780347021; Slides of the lectures.
Recommended preliminary knowledge for completing the subject
Knowledge type competencies
(azon előzetes ismeretek összessége, amelyek megléte nem kötelező, de a tantárgy eredményes teljesítését nagyban elősegíti)
Computer
Networks, Telecommunication Networks, Network technologies, Theory of
Algorithms
Skill type competencies
(azon előzetes képességek és készségek összessége, amelyek megléte nem kötelező, de a tantárgy eredményes teljesítését nagyban elősegíti)
nincs
Recommended (non-compulsory) preliminary competencies
(azon ajánlott (nem kötelező) előzetesen megszerzendő kompetenciák összessége, amelyek jelentősen hozzájárulnak a tantárgy eredményes teljesítéséhez)
Computer
Networks, Telecommunication Networks, Network technologies, Theory of
Algorithms
General rules
Requirements:
a. During the semester: one mid-semester in-class
test at the end of semester and homework assignment. Final mark is given by the
results of mid-semester test and homework by 60 / 40%. Grading: 0-39% : 1, 40-52% : 2, 53-65% : 3, 66-79% : 4, 80-100% : 5
b. In the examination period: -
c. Early-exam: -
Additional possibilities:
Failed or missed mid-semester
in-class test may be repeated once in the repeat period. Homework assignment
may be handed in late until the end of the repeat period.
Assessment methods
In-term assessments
No detailed assessments provided.
Weight of in-term assessments
No weights provided.
Exam-period assessments
No detailed assessments provided.
Weight of exam elements
No weights provided.
Grade calculation
No grade thresholds provided.
Attendance requirements
No attendance requirements provided.
Rules for retake and resubmission
Not provided.
Short description
Not provided.
Detailed description
Not provided.
Recommended courses
Not provided.
Workload to complete the subject
No workload breakdown provided.
Validity of subject requirements
Requirements valid from:
—
Requirements valid until:
—
Curriculum placement
No curriculum placements recorded for this subject version.