Hálózat méretezés: tervezés méretezés és optimálás működtetés Tervezés:

PPKE ITK

2009/10tanév

8.félév

(tavaszi)

Távközlő rendszerekTávközlő rendszerekforgalmi elemzéseforgalmi elemzése

TájékoztatásTájékoztatáshttp://digitushttp://digitus.itk.ppke.hu/~gosztony/.itk.ppke.hu/~gosztony/

11.

Távközlő rendszerek forgalmi elemzése – 2010. 04. 12.Távközlő rendszerek forgalmi elemzése – 2010. 04. 12. 22

Hálózat méretezés:Hálózat méretezés:• tervezéstervezés• méretezés és optimálásméretezés és optimálás• működtetésműködtetés

Tervezés:Tervezés:• forgalmi mátrix és frissítéseforgalmi mátrix és frissítése• hálózat szerkezethálózat szerkezet• forgalom menedzsmentforgalom menedzsment• forgalmi teljesítmény mérése (példa)forgalmi teljesítmény mérése (példa)• forgalom irányításforgalom irányítás

Méretezés és optimálásMéretezés és optimálás• közelítő és pontos forgalmi számításokközelítő és pontos forgalmi számítások• optimálás (lásd a tankönyvet)optimálás (lásd a tankönyvet)

Hálózatok forgalmi tervezése Hálózatok forgalmi tervezése


Forgalmi mátrix 1.Forgalmi mátrix 1.

ii

jj

kk

iikk

kkii

iiii

kkkk

jjjj

kkjj

jjkkiijj

jjii





Kruithof féle kettős tényező módszerKruithof féle kettős tényező módszer

SSkk az aktuális az aktuális sorsor ill. ill. oszloposzlop összegösszeg

??

Forgalmi Forgalmi előrejelzésekbőlelőrejelzésekbőlfeltételezett adatokfeltételezett adatok

Céltáblázat:Céltáblázat:

Kiindulási táblázat:Kiindulási táblázat:



1. iteráció 1. iteráció („oszlop”)(„oszlop”)::(10 x 45/30)(10 x 45/30)

(60 x 100/90)(60 x 100/90)


2. iteráció 2. iteráció („sor”)(„sor”)::

(30 x 105/70)(30 x 105/70)(20 x 45/30)(20 x 45/30)

(40 x 105/70)(40 x 105/70)

??

Kiindulási táblázat:Kiindulási táblázat:

(30 x 100/90)(30 x 100/90)(45 x 50/60)(45 x 50/60)

(15 x 50/60)(15 x 50/60)



1. iteráció:1. iteráció:


2. iteráció:2. iteráció:

4. iteráció 4. iteráció („sor”)(„sor”)::(33.33 x 45/45.83)(33.33 x 45/45.83)

??

3. iteráció3. iteráció („oszlop”)(„oszlop”)::(32.73 x 100/99.93)(32.73 x 100/99.93)



A Kruithof módszer fontos jellemzői :A Kruithof módszer fontos jellemzői :


Takács Gy.:KomRendsz_2006

Hálózat szerkezetekHálózat szerkezetek

ISMÉTLÉS!ISMÉTLÉS!


ComparisonComparisonof wireline of wireline and wireless and wireless

systemssystems

Takács Gy.:Komea/2003

Helyhez kötött és mobil hálózat Helyhez kötött és mobil hálózat



Telephone network structure of MATAVTelephone network structure of MATAV

Secondary exchange

Primary exchange

Backbone network

Localexchange

Subscriber

Accessnetwork

Interexchangenetwork

Takács Gy.:Komea/2003

Hierarchikus hálózat Hierarchikus hálózat



T-COM területen lévő összes település: 2 440 db Központtal rendelkező település: 953 db

primer körzetprimer körzet

budapest i primer körzet

Nk

TranzithálózatKörzethálózatHálózat hozzáférési pnt

nemzetközi áramkörök

Helyközi tranzithálózat

S1

P1 P2P3

T

H1

H2 H3 H4 H5

Kf Kf Kf KfKf

SnS/P

S/P S/P

Nemzetközi központ

Szekunderközpont

Primerközpont

Tandemközpontok

Helyiközpont

Kihelyezett elõfizetõi fokozat

Helyhez kötött hálózatok 3. Helyhez kötött hálózatok 3.

T-COMT-COMPSTN/ISDNPSTN/ISDN

Ügyfél: 2.43 millióKözpontok száma:1 198 db

Helyi: 194 dbKihely. fok.: 1004 db

Sípos et al. PKI Nap 2004.




U.S. and Canadian U.S. and Canadian Telephone Switch Telephone Switch HierarchyHierarchy

Public switched telephone networkPublic switched telephone networkWikipedia – 2009.March.Wikipedia – 2009.March. ISMÉTLÉS!ISMÉTLÉS!


KTV elérés

KTV elérés

Gigabit routert

maghálózat

GE

Dial-up

ATM connectivity

NB elérésEdge

ADSL

Edge

198 150ADSL felhasználó

12 523KTV felhasználó

11 487 dial-up port

1 366 1 260

Budapest

Dial-upATM

connectivity

ADSL

Edge

Sípos et al. PKI Nap 2004.

T-COM IP hálózat

Helyhez kötött hálózatok Helyhez kötött hálózatok 55. .




Koós A. Koós A. OECD Forum, OECD Forum,

Bp. 2006.10.03.Bp. 2006.10.03.




Koós A. Koós A. OECD Forum, OECD Forum, Bp. 2006.10.03.Bp. 2006.10.03.



BartolitsNGN és Szélessáv Fórum2007




Hálózatok logikai elemei 1.Hálózatok logikai elemei 1.

ITU-T Rec. E.360.1 ITU-T Rec. E.360.1 (2002/05) (2002/05) – Framework for QoS routing and related traffic engineering methods for IP ......– Framework for QoS routing and related traffic engineering methods for IP ......

Written terminology including:Written terminology including:

linklinklogical linklogical linknodenodepathpathrouterouteroutingroutingrouting tablerouting table

can be found in subsequent slidescan be found in subsequent slides



3.173.17 linklink: A bandwidth transmission medium between nodes : A bandwidth transmission medium between nodes that is engineered as a unit.that is engineered as a unit.

3.183.18 logical linklogical link: A bandwidth transmission medium of fixed : A bandwidth transmission medium of fixed bandwidth (e.g. T1, DS3, OC3, etc.) at the link layer (layer 2) bandwidth (e.g. T1, DS3, OC3, etc.) at the link layer (layer 2) between 2 nodes, established on a path consisting of (possibly between 2 nodes, established on a path consisting of (possibly several) physical transport links (at layer 1) which are switched, several) physical transport links (at layer 1) which are switched, for example, through several optical cross-connect devices.for example, through several optical cross-connect devices.

3.193.19 nodenode: A network element (switch, router, exchange) : A network element (switch, router, exchange) providing switching and routing capabilities, or an aggregation providing switching and routing capabilities, or an aggregation of such network elements representing a network.of such network elements representing a network.

3.243.24 pathpath: A concatenation of links providing a connection/: A concatenation of links providing a connection/bandwidth-allocation between an bandwidth-allocation between an OO(rigin)(rigin)‑‑DD(estination)(estination) pair. pair.




3.313.31 routeroute:: A set of paths connecting the same originating A set of paths connecting the same originating node-destination node pair.node-destination node pair.

3.323.32 routingrouting:: The process of determination, establishment, and The process of determination, establishment, and use of routing tables to select paths between an input port at the use of routing tables to select paths between an input port at the ingress network edge and output port at the egress network edge; ingress network edge and output port at the egress network edge; includes the process of performing both call routing and connection includes the process of performing both call routing and connection routing (see call routing and connection routing).routing (see call routing and connection routing).

3.333.33 routing tablerouting table:: Describes the path choices and selection Describes the path choices and selection rules to select one path out of the route for a connection/bandwidthrules to select one path out of the route for a connection/bandwidth-allocation request.-allocation request.



TTE hálózatokban 1.TTE hálózatokban 1.

Traffic engineering functionsTraffic engineering functions




regulateregulatess the service provided by the network the service provided by the network throughthrough capacity and routing adjustments.capacity and routing adjustments.

InputInput

„„noisy”noisy”traffic loadtraffic load

unkownunkownforecastforecast

errorerror

predicted average demandpredicted average demand instantaneousinstantaneoushour-to-hourhour-to-hourday-to-dayday-to-day

week-to weekweek-to weekseasonalseasonal

load variationsload variations

FeedbackFeedback

the the time constantstime constants of the feedback controls are of the feedback controls are matched to the load variationsmatched to the load variations

ITU-T Rec. E.360.1 ITU-T Rec. E.360.1 (2002.05) (2002.05) – Framework for QoS routing and related traffic engineering methods for IP..– Framework for QoS routing and related traffic engineering methods for IP..



Traffic engineering functionsTraffic engineering functions include include::

traffic management, traffic management, capacity management, and capacity management, and network planning.network planning.

Traffic managementTraffic management ensures that network performance is maximized ensures that network performance is maximized under all conditions, including load shifts and failures. under all conditions, including load shifts and failures.

Capacity managementCapacity management ensures that the network ensures that the network is designed and provisioned to meet performance objectives for network is designed and provisioned to meet performance objectives for network demands at minimum cost. demands at minimum cost.

Network planningNetwork planning ensures that node and transport capacity is planned ensures that node and transport capacity is planned and deployed in advance of forecasted traffic growth. Figure 1 illustrates and deployed in advance of forecasted traffic growth. Figure 1 illustrates traffic management, capacity management, and network planning as traffic management, capacity management, and network planning as three interacting feedback loops around the network.three interacting feedback loops around the network.

ITU-T Rec. E.360.1 ITU-T Rec. E.360.1 (2002.05) (2002.05) – Framework for QoS routing and related traffic engineering methods for IP ....– Framework for QoS routing and related traffic engineering methods for IP ....



3.353.35 traffic engineeringtraffic engineering: Encompasses traffic management, : Encompasses traffic management, capacity management, traffic measurement and modelling, capacity management, traffic measurement and modelling, network modelling, and performance analysis.network modelling, and performance analysis.

3.363.36 traffic engineering methodstraffic engineering methods: Network functions which : Network functions which support traffic engineering and include call routing; connection support traffic engineering and include call routing; connection routing, QoS resource management, routing table management, routing, QoS resource management, routing table management, and capacity management.and capacity management.

3.373.37 traffic streamtraffic stream: A class of connection requests with the: A class of connection requests with thesame traffic characteristicssame traffic characteristics

ITU-T Rec. E.360.1 ITU-T Rec. E.360.1 (2002.05) (2002.05) – Framework for QoS routing and related traffic engineering methods for IP ...– Framework for QoS routing and related traffic engineering methods for IP ...



3.273.27 QoS (Quality of Service)QoS (Quality of Service): A set of service requirements to : A set of service requirements to bebe met by the network while transporting a Connection or flow; the met by the network while transporting a Connection or flow; the collective effect of service performance which determine the Degree collective effect of service performance which determine the Degree of satisfaction of aof satisfaction of a user user of the of the service service..

3.283.28 QoS resource managementQoS resource management:: Network functions which Network functions which include class-of-service identification, routing table; derivation, include class-of-service identification, routing table; derivation, connection admission, bandwidth allocation, bandwidth protection, connection admission, bandwidth allocation, bandwidth protection, bandwidth reservation, priority routing, and priority queuing.bandwidth reservation, priority routing, and priority queuing.

3.293.29 QoS routingQoS routing:: See QoS Resource Management. See QoS Resource Management.

3.303.30 QoS variableQoS variable:: Any performance variable (such as Any performance variable (such as congestion, delay, etc.) which is perceivable by a user.congestion, delay, etc.) which is perceivable by a user.

ITU-T Rec. E.360.1 ITU-T Rec. E.360.1 (2002.05) (2002.05) – Framework for QoS routing and related traffic engineering methods for IP ....– Framework for QoS routing and related traffic engineering methods for IP ....


TTE - IP hálózatokban - Példa a-1. TTE - IP hálózatokban - Példa a-1.

Rec. ITU-T Rec. ITU-T Y.1543Y.1543 (2007(2007/11/11))Measurements in IP networksMeasurements in IP networks forfor inter-domaininter-domainperformance assessmentperformance assessment

The The performance attributesperformance attributes that are used to that are used to characterize the network performance (inter-characterize the network performance (inter-domaindomain QoS) of a path are:QoS) of a path are:

• • Mean one-way delay.Mean one-way delay.• • One-way packet delay variation.One-way packet delay variation.• • Packet loss ratio.Packet loss ratio.• • Path unavailability.Path unavailability.



ITU-T ITU-T Y.1543Y.1543 ((20200707/11/11)) Measurements in IP networksMeasurements in IP networks forfor inter-domaininter-domain performance performance assessmentassessment

Providers offer assured delivery services Providers offer assured delivery services between different endpointsbetween different endpoints. .

1)1)""edge-edgeedge-edge" for services that extend to the edge of a providers' " for services that extend to the edge of a providers' network.network.

2) "2) "site-sitesite-site" for services that extend to the edge of a customer's " for services that extend to the edge of a customer's premises (this is sometimespremises (this is sometimes called end-to-end). called end-to-end).

3) "3) "TE-TETE-TE" for a managed customer network service, we will " for a managed customer network service, we will consider this as extending to aconsider this as extending to a customer's terminal. We note that customer's terminal. We note that some service architectures place one instance of TEsome service architectures place one instance of TE within within the traditional network boundaries, e.g., IP television services.the traditional network boundaries, e.g., IP television services.



ITU-T ITU-T Y.1543Y.1543 ((20200707/11/11)) Measurements in IP networksMeasurements in IP networks forfor inter-domaininter-domain performance performance assessmentassessment


TTE - NGN hálózatokban - Példa b-1. TTE - NGN hálózatokban - Példa b-1.

Recommendation ITU-T Recommendation ITU-T Y.2173Y.2173 (2008.09)(2008.09)Management of performance measurement for NGNManagement of performance measurement for NGN

SummarySummaryThis Recommendation specifies requirements, reference measurement This Recommendation specifies requirements, reference measurement network model, high-level and functional architectures, and procedures network model, high-level and functional architectures, and procedures for performance measurement management. This Recommendation for performance measurement management. This Recommendation together with [Recommendation ITU-T Y.1543] provides overall together with [Recommendation ITU-T Y.1543] provides overall consistency for performance measurement and management of NGN.consistency for performance measurement and management of NGN.

ScopeScopeThis document specifies the management aspects of performance measurement:This document specifies the management aspects of performance measurement:- - Requirements for management of performance measurementRequirements for management of performance measurement........- - A reference measurement network modelA reference measurement network model........- A general and functional architecture for the management of performance A general and functional architecture for the management of performance measurementmeasurement........- Management procedures covering various management scenariosManagement procedures covering various management scenarios........ - Application scenarios for management of performance measurement (MPM) Application scenarios for management of performance measurement (MPM) use casesuse cases..........


TTE - NGN hálózatokban - Példa b-2. TTE - NGN hálózatokban - Példa b-2.

ABGABG = = Access Access Border GatewayBorder Gateway

IBGIBG = = Interconnection Interconnection Border GatewayBorder Gateway

CPNECPNE = =Customer Customer Premises Premises Network EdgeNetwork Edge


A forgalomirányítás lehet:A forgalomirányítás lehet:• állandóállandó

(Fixed Routing –FR)(Fixed Routing –FR)• idő-fűggőidő-fűggő

(Time dependent Routing – TDR)(Time dependent Routing – TDR)• állapotfüggőállapotfüggő

(State Dependent Routing – SDR)(State Dependent Routing – SDR)• eseményfüggőeseményfüggő

(Event Dependent Routing – EDR)(Event Dependent Routing – EDR)

ITU-T Rec. E.350 (00/03)– Dynamic Routing InterworkingITU-T Rec. E.350 (00/03)– Dynamic Routing Interworking

Forgalomirányítás 1.Forgalomirányítás 1.


Fixed RoutingFixed Routing (FR) (FR)

In a fixed routing (FR) method, a routing table is In a fixed routing (FR) method, a routing table is fixed for a traffic stream. Hierarchical orfixed for a traffic stream. Hierarchical or non-non-hierarchical routing structures may be realized hierarchical routing structures may be realized based on fixed routing. In both hierarchical or based on fixed routing. In both hierarchical or non-hierarchical structures, the route set and non-hierarchical structures, the route set and routeroute selection sequence are determined on a selection sequence are determined on a preplanned basis and maintained over a long preplanned basis and maintained over a long period of time.period of time.

ITU-T Rec. E.350 (2000/03) – Dynamic Routing InterworkingITU-T Rec. E.350 (2000/03) – Dynamic Routing Interworking

Forgalomirányítás 1a.Forgalomirányítás 1a.


Time-Dependent RoutingTime-Dependent Routing (TDR) (TDR)

Time-dependent routing (TDR) methods are a Time-dependent routing (TDR) methods are a type of dynamic routing in which the routing type of dynamic routing in which the routing tablestables are altered at a are altered at a fixed point in timefixed point in time during during the day or week. TDR routing tables are the day or week. TDR routing tables are determined on adetermined on a preplanned basis and are preplanned basis and are implemented consistently over a time period. The implemented consistently over a time period. The TDR routing tables areTDR routing tables are determined considering determined considering the time variation of traffic load in the network. the time variation of traffic load in the network. Typically, the TDR routingTypically, the TDR routing tables used in the tables used in the network are coordinated by network are coordinated by taking advantage of taking advantage of non-coincidence of busy hoursnon-coincidence of busy hours among the traffic among the traffic streams.streams.


Forgalomirányítás 1b.Forgalomirányítás 1b.


State-Dependent RoutingState-Dependent Routing (SDR) (SDR)

In state-dependent routing (SDR), the routes in the In state-dependent routing (SDR), the routes in the routing tables are altered automatically accordingrouting tables are altered automatically according to to the the state of the networkstate of the network. For a given SDR method, the . For a given SDR method, the routing table rules are implemented torouting table rules are implemented to determine the determine the route choices in response to changing network status, route choices in response to changing network status, and are used over a relativelyand are used over a relatively short time period. short time period. Information on network status may be collected at a Information on network status may be collected at a central processor orcentral processor or distributed to exchanges in the distributed to exchanges in the networknetwork. The information exchange may be performed . The information exchange may be performed on a periodicon a periodic or on-demand basis. SDR methods use or on-demand basis. SDR methods use the principle of routing calls on the the principle of routing calls on the best available best available routeroute on on the basis of network state information.the basis of network state information.


Forgalomirányítás 1c.Forgalomirányítás 1c.


EEvent-dependent routingvent-dependent routing (EDR) (EDR)

In event-dependent routing (EDR), the routing tables are In event-dependent routing (EDR), the routing tables are updated locally on the basis of updated locally on the basis of whetherwhether calls succeed or calls succeed or fail on a given route choicefail on a given route choice. In EDR, for example, a call is . In EDR, for example, a call is offered first to a fixed,offered first to a fixed, preplanned route often preplanned route often encompassing only a direct route, if it exists. If no circuit encompassing only a direct route, if it exists. If no circuit is available on theis available on the preplanned routes, the overflow traffic preplanned routes, the overflow traffic is offered to a currently selected alternate route. If a call is offered to a currently selected alternate route. If a call isis blocked on the current alternate route choice, another blocked on the current alternate route choice, another alternate route is selected from a set ofalternate route is selected from a set of available available alternate routes for the traffic stream according to the alternate routes for the traffic stream according to the given EDR routing table rules. Forgiven EDR routing table rules. For example, the current example, the current alternate route choice can be updated randomly, alternate route choice can be updated randomly, cyclically, or by some othercyclically, or by some other means, and may be means, and may be maintained as long as a call is established successfully maintained as long as a call is established successfully on the route.on the route.


Forgalomirányítás 1d.Forgalomirányítás 1d.



Two-link routingTwo-link routing requires that requires that each exchange is each exchange is capable of capable of distinguishingdistinguishing between traffic between trafficstreamsstreams originating in one originating in one exchange from traffic streams exchange from traffic streams incoming from other exchanges incoming from other exchanges in the network. Inin the network. In the example the example of Figure 1, exchange C may of Figure 1, exchange C may route traffic streams originating route traffic streams originating in its served areain its served area indirectly, indirectly, for example via exchange D, to for example via exchange D, to exchange B (full line). However, exchange B (full line). However, traffic streams incomingtraffic streams incoming from from exchange A must be directly exchange A must be directly routed to exchange B (dashed line) routed to exchange B (dashed line) and must not be routed viaand must not be routed viaexchange D to optimize the two-link exchange D to optimize the two-link requirement.requirement. ITU-T Rec. E.350 (2000/03) – ITU-T Rec. E.350 (2000/03) –

Dynamic Routing InterworkingDynamic Routing Interworking


Forgalomirányítás 3.Forgalomirányítás 3.TThree types of traffic streams carried by a circuit group (e.g. from A to B)hree types of traffic streams carried by a circuit group (e.g. from A to B) in ain a non-non-hierarchical routing networkhierarchical routing network::1)1) Directly routed traffic from orig Directly routed traffic from orig.. exch exch.. A toA to dest dest.. exch exch.. BB..2)2) Incoming traffic to exch Incoming traffic to exch.. AA fromfrom other orig other orig.. exch exch..s (s (e.g. Ce.g. C) of the) of thenon-hierarchical routing network which also is directly routed by orignon-hierarchical routing network which also is directly routed by orig.. exch exch.. A toA to destdest.. exch exch. . B.B. 3)3) Incoming traffic from Incoming traffic from served area of exchserved area of exch.. AA which is indirectly which is indirectly routed routed via via exchexch. . BB toto another destination another destination exchexch. . in the in the non-hierarchical non-hierarchical routing network routing network ((e.g.e.g. CC).).

SSelective circuitelective circuitreservation controlreservation control

11

22

33

11

22

33

ITU-T Rec. E.350 (2000/03) – ITU-T Rec. E.350 (2000/03) – Dynamic Routing InterworkingDynamic Routing Interworking



Routing interworking casesRouting interworking casesdenoted by arrows:denoted by arrows:

• D to FD to F

• F to DF to D

• D to DD to D

• F to FF to F







O – D = Origin – Destination O – D = Origin – Destination SDR = State Dependent RoutingSDR = State Dependent RoutingEDR = Event Dependent RoutingEDR = Event Dependent Routing



Forgalomirányítás 7-1.Forgalomirányítás 7-1.

ITU-T Rec. ITU-T Rec. E.350 (2000/03) – E.350 (2000/03) – Dynamic Routing Dynamic Routing InterworkingInterworking


Forgalomirányítás 7-2.Forgalomirányítás 7-2.






Forgalmi számítások 1. Forgalmi számítások 1.

Közelítő számítás:Közelítő számítás:

Feltételezés:Feltételezés:a hálózat vonalnyalábjai függetleneka hálózat vonalnyalábjai függetlenek

kis torlódási valószínűségekre kis torlódási valószínűségekre

Pontos számítás:Pontos számítás:

Állapotvalószínűségeket alkalmazvaÁllapotvalószínűségeket alkalmazvaaz állapotok számaaz állapotok száma

Több dimenziós konvolúciós algoritmus,Több dimenziós konvolúciós algoritmus,(a dimenziók száma a vonalnyalábok(a dimenziók száma a vonalnyalábokdarabszáma)darabszáma)

worst caseworst case


Szolgáltatás védelem 1. Szolgáltatás védelem 1.

Kiemelt előfizetőkKiemelt előfizetők számára számára (pl. mentők, rendőrség (pl. mentők, rendőrség prioritása)prioritása)

Forgalomtól-függőenForgalomtól-függően• normál terhelésnormál terhelés minden hívástípus kb. azonos torlódás minden hívástípus kb. azonos torlódás• túlterhelés túlterhelés egyes hívástípusok előnyben részesítése egyes hívástípusok előnyben részesítése

Digitális kapcsoló központokbanDigitális kapcsoló központokban• call-gappingcall-gapping• prioritások (pl. mobil hálózatokban hand-over igények prioritások (pl. mobil hálózatokban hand-over igények

előnyben vannak)előnyben vannak) HálózatokbanHálózatokban

• csatorna fenntartás (trunk reservation)csatorna fenntartás (trunk reservation)• virtuális csatorna védelem (virtual channels protection) virtuális csatorna védelem (virtual channels protection)



Elsődleges forgalom védelme a túlcsorduló Elsődleges forgalom védelme a túlcsorduló forgalommalforgalommalszemben. szemben. ABAB forgalom csak akkor mehet forgalom csak akkor mehet T T felé, ha felé, ha ATAT--ben több mint ben több mint rr csatorna szabad.csatorna szabad.

PCT-I, azonos tartásidő és single slot forgalom esetén lehet pontos PCT-I, azonos tartásidő és single slot forgalom esetén lehet pontos számítás. – számítás. – HátrányHátrány: csak helyi és egyoldalú stratégia. : csak helyi és egyoldalú stratégia.

Csatorna fenntartásCsatorna fenntartás


Integrált szolgáltatású rendszerekben az összes Integrált szolgáltatású rendszerekben az összes szolgáltatást védeni kell egymás ellen.szolgáltatást védeni kell egymás ellen.

Megoldható pl.:Megoldható pl.:• minimális sávszélesség hozzárendelésselminimális sávszélesség hozzárendeléssel• maximális sávszélesség korlát kijelöléssel (egyetlen maximális sávszélesség korlát kijelöléssel (egyetlen

szolgáltatás sem jut túlsúlyra)szolgáltatás sem jut túlsúlyra)


Virtuális csatorna védelemVirtuális csatorna védelem

Documents

Hálózat méretezés: tervezés méretezés és optimálás működtetés Tervezés: