Chng 6:

Mng chuyn mch gi

(Packet switching)

bvhieu@cse.hcmut.edu.vn
Ni dung
Gii thiu mng chuyn mch gi
Tm ng
X.25

B mn K thut my tnh
Khoa Khoa
Ni dung
Gii thiu mng chuyn mch gi
Tm ng
X.25

B mn K thut my tnh
Khoa Khoa
Hn ch ca chuyn mch mch
Cc ti nguyn c dnh ring cho cuc
gi
Hu ht thi gian kt ni ng truyn rnh
Tc d liu c nh
Thit b hai u phi chy cng tc

B mn K thut my tnh
Khoa Khoa
Nguyn l chuyn mch gi
D liu c truyn thnh cc gi nh
Thng thng l 1000 byte
D liu ln c chia thnh chui cc gi nh
truyn
Mi gi gm d liu cng thm thng tin iu
khin

Cc gi c nhn, lu tm thi v truyn

cho node k tip (store and forward)

B mn K thut my tnh
Khoa Khoa
u im chuyn mch gi
Tng hiu sut ng truyn
Mt kt ni node-node c th dng chung bi
nhiu gi
Cc gi xp hng v truyn i nhanh nht c th
Chuyn i tc d liu
Mi trm kt ni vi node cc b bng tc ca
trm
Cc node m d liu nu cn thit cn bng
tc
Cc gi c nhn ngay khi mng ang bn
Vic pht c th chm li
C th phn u tin cho cc thng bo

B mn K thut my tnh
Khoa Khoa
K thut chuyn mch
Trm chia thng bo di thnh nhiu gi nh
Tng gi c gi ln lt vo mng
Cc gi c x l theo 2 cch
Datagram
Virtual circuit

B mn K thut my tnh
Khoa Khoa
Datagram
Mi gi c x l c lp
Cc gi c th i theo bt c ng thch
hp no
Cc gi c th n ch khng theo th t
gi
Cc gi c th tht lc trn ng i
Bn nhn phi sp xp li cc gi mt trt t
v khi phc cc gi tht lc

B mn K thut my tnh
Khoa Khoa
Minh ha Datagram
3 2
1

(a)

3
2
1

(b)

2
1

(c)

2 1

(d)

3
2
1

(e)

B mn K thut my tnh
Khoa Khoa
Virtual circuit
ng i c to trc khi gi cc gi d
liu
Cc gi yu cu cuc gi v chp nhn cuc
gi c dng to kt ni (handshake)
Mi ng i c gn mt s ID
Mi gi cha ID ca ng i thay v a ch
my ch
Khng cn tm ng cho tng gi
ng i khng dnh ring

B mn K thut my tnh
Khoa Khoa
Minh ha Virtual circuit
3 2
1

(a)

3
2
1

(b)

3
2
1

(c)

3 2 1

(d)

3
2
1

(e)

B mn K thut my tnh
Khoa Khoa
So snh Virtual Circuit Datagram
S trnh t v iu khin li ?
Thi gian tr truyn c mt gi ?
Thi gian tr truyn cc gi sau gi u
tin ?
Kh nng chu li ?
Tnh linh ng v ng i ?

B mn K thut my tnh
Khoa Khoa
Vn kch thc gi (a) 1-packet message (b) 2-packet message (c) 5-packet message (d) 10-packet message

1
Header 1
Data 2 1
1
Data 2 1 3 2 1

4 3 2
3 2 1
5 4 3
Data Data
2 1 4 3 2 6 5 4

7 6 5
5 4 3
8 7 6
Data Data
Data
2 1 5 4 9 8 7
Time

10 9 8
5
10 9
Data
X a b Y 10
2

X a b Y
X a b Y

Data

X a b Y

B mn K thut my tnh
Khoa Khoa Figure 10.14 Effect of Packet Size on Transmission Time
Circuit vs. Packet Switching
Circuit Switching Datagram Packets Virtual Circuit Packets
ng truyn dn dnh ng truyn dn khng ng truyn dn khng
ring dnh ring dnh ring
D liu truyn lin tc D liu truyn theo gi D liu truyn theo gi
nhanh cho ng dng nhanh cho ng dng nhanh cho ng dng
tng tc tng tc tng tc
Thng bo khng c Thng bo c th c Thng bo c lu tr
lu tr lu tr cho n khi n cho n khi n phn
phn pht pht
ng truyn dn c ng i c thit lp ng i c thit lp
thit lp cho ton b qu cho mi gi cho ton b qu trnh
trnh trao i trao i

Tr do qu trnh thit lp, Tr truyn cc gi Tr do qu trnh thit lp,

nhng thi gian tr trong tr truyn cc gi
qu trnh truyn khng
ng k
Tn hiu bn nu bn Ngi gi c th c Ngi gi c thng
nhn khng sn sng thng bo nu cc gi bo nu cc gi khng
khng c phn pht c phn pht

B mn K thut my tnh
Khoa Khoa
Circuit vs. Packet Switching (tt)
Circuit Switching Datagram Packets Virtual Circuit Packets

Qu ti s kha vic Qu ti s tng thi gian Qu ti c th kha vic

thit lp; khng tr khi tr ca gi thit lp; tng thi gian
ng truyn c tr ca gi
thit lp
Chuyn mch c in Node chuyn mch nh Node chuyn mch nh
hoc c iu khin
bi my tnh

User chu trch nhim Mng c th s chu Mng c th s chu

khi cc thng bo b tht trch nhim cho cc gi trch nhim cho chui
lc n l cc gi
Thng khng cn Chuyn i tc v Chuyn i tc v
chuyn i tc v bng m bng m
bng m
Truyn dn bng thng Linh ng s dng bng Linh ng s dng bng
c nh thng thng

Khng tn chi ph d liu Tn km d liu cho mi Tn km d liu cho mi

sau khi thit lp gi gi

B mn K thut my tnh
Khoa Khoa
Hot ng bn ngoi bn trong
Giao tip gia cc node mng (bn trong)
Datagrams hoc virtual circuits
Giao tip gia trm v node mng (bn
ngoi)
Kt ni (Connection oriented)
Trm yu cu kt ni lun l (virtual circuit)
Tt c cc gi c nh du thuc v kt ni v
c nh s th t
Mng phn pht cc gi theo th t
Dch v mch o bn ngoi
Khng kt ni (Connectionless)
Cc gi c x l c lp
Dch v datagram bn ngoi

B mn K thut my tnh
Khoa Khoa
External Virtual Circuit and External Datagram

B mn K thut my tnh
Khoa Khoa
Internal Virtual Circuit and Internal Datagram

B mn K thut my tnh
Khoa Khoa
T hp cc cng ngh
External virtual circuit, internal virtual circuit
ng dnh ring thng qua mng
External virtual circuit, internal datagram
Mng x l mi gi ring bit
Mng lu tr cc gi ti node ch sp xp li
th t
External datagram, internal datagram
Cc gi c i x mt cch c lp bi c
mng v trm
External datagram, internal virtual circuit
Khng c s dng

B mn K thut my tnh
Khoa Khoa
Ni dung
Gii thiu mng chuyn mch gi
Tm ng
X.25

B mn K thut my tnh
Khoa Khoa
Tm ng trong Circuit switching
Mng chuyn mch cng cng c cu trc
cy
ng i tnh (khng thay i theo thi gian)
C th ci tin bng Alternate routing
Thm cc ng kt ni gia cc trung tm
chuyn mch
Lit k cc ng i c th
ng i c chn theo u tin (tc , chi
ph, thi im...)

B mn K thut my tnh
Khoa Khoa
Tm ng trong Packet switching
Phc tp, rt quan trng
Cc c tnh yu cu
Chnh xc (correctness)
n gin (simplicity)
Mnh m (robustness)
n nh (stability)
Cng bng (fairness)
Ti u (optimality)
Hiu qu (efficiency)

B mn K thut my tnh
Khoa Khoa
Tiu chun o tnh hiu qu
c dng nh gi ng i tt
S chng ng (hop) l ti thiu
n gin
Khng chnh xc
Chi ph (cost) ti thiu
Cc yu t bng thng, ti hin ti... c lng
ha thnh chi ph
Phc tp hn
Chnh xc hn
c dng ch yu hin nay

B mn K thut my tnh
Khoa Khoa
Yu t quyt nh chin thut tm ng
Thi im quyt nh
Mch o hay theo tng gi (packet)
Ni quyt nh
Phn tn (Distributed)
c thc hin ti tng node
Tp trung (Centralized)
c thc hin ti mt node chuyn bit
Ti ngun gi (Source)
c thc hin ti node gi

B mn K thut my tnh
Khoa Khoa
Yu t quyt nh chin thut tm ng
Ngun thng tin v mng
Quyt nh tm ng thng thng (khng phi
lun lun) c da trn cc thng tin v mng
Tm ng phn tn (Distributed routing)
Node s dng cc thng tin cc b
C th thu thp thng tin t cc node k cn
C th thu thp thng tin t cc node trn ng tim
nng
Tm ng tp trung (Central routing)
Thu thp thng tin t tt c cc node

B mn K thut my tnh
Khoa Khoa
Yu t quyt nh chin thut tm ng
Thi im cp nht thng tin
Khi no thng tin s c cp nht
Tm ng c nh: khng c cp nht
Tm ng ng (adaptive): cp nht sau mt
khong thi gian n nh trc
Thi gian ny nn ln hay nn nh ?

B mn K thut my tnh
Khoa Khoa
Cc chin thut tm ng
Fixed routing
Flooding routing
Random routing
Adaptive routing

B mn K thut my tnh
Khoa Khoa
Fixed Routing
ng i c nh, khng thay i
ng i c xc nh dng gii thut chi
ph ti thiu
ng i c th thay i nu c s thay i
cu hnh mng

B mn K thut my tnh
Khoa Khoa
Fixed routing - Hin thc CENTRAL ROUTING DIRECTORY

8 From Node
CENTRAL ROUTING DIRECTORY
1 2 3 4 5 6
5 3 From Node
2 3 5 1 2 3 4 1 5 6 1 5 2 4 5
6
1 1 5 2 2 4 25 5 2 4 5
2 8 6
2 2 5 2 4 5
3 4 3 5 3 5
3 2 3 3 4 3 To
Node 5 3 5
2 1
3 1 To Node 2 4 4 4 5 4 5
4 4 4 5 4 5
4 5 45 4 5 5 5
1 1 5 4 4 5 5

1 6 4 4 5 5 6 6 4 4 5 5 6
7 4 5
1

Node 1 Directory Node 2 Directory Node 3 Directory

Node 1 Directory Node 2 Directory Node 3 Directory
Destination Next Node Destination Next Node Destination Next Node
2 2 Destination
1 Next1Node Destination
1 5 Next Node Destination Next No
Figure 12.2 Example Packet-Switching Network
3 4 2 3 32 2 1 5 1 1 5
4 4 3 4 44 4 3 5 3 2 5
5 4 5 4 5 5
4 4 4 4 4 5
6 4 6 4 6 5
5 4 5 4 5 5

Node 4 Directory 6 Node 5 Directory

4 Node66 Directory 4 6 5
Destination Next Node Destination Next Node Destination Next Node
1 2 1 4 Directory
Node 4 1 5
Node 5 Directory Node 6 Directory
2 2 2 4 2 5
Destination Next Node Destination Next Node Destination Next No
3 5 3 3 3 5
1 2 1 4 1 5
5 5 4 4 4 5
6 5 2 6 62 5 2 5 4 2 5
3 5 3 3 3 5
B mn K thut my tnh Figure 12.3 Fixed
5 Routing (using
5 Figure 12.2) 4 4 4 5
Khoa Khoa
Flooding Routing
Khng cn thng tin mng 2 3

Node gi cc gi ti mi node k 1

Cc gi nhn c s c truyn trn tt 4 5

c cc kt ni ngoi tr kt ni gi n
(a) First hop

Cui cng s c mt s copy ca gi s n

2 3

ch 1

Gi n u tin l i trn ng tt nht2 3

4

(b) Second hop

5

2 3 2 3
1
6 6
4 5

1 (a) First hop 1

4 5 4 5
2 3
(a) First hop (c) Third hop
6

2 3 Figure 12.4 Flooding Example (hop count = 3)

1 6
4 5

1 (b) Second hop

B mn K thut
4 my tnh 5

Khoa Khoa 2 3
Lm sao dng vic pht tn
Mi gi c nh s duy nht
Node c th ghi nh cc gi i qua
Loi b cc node i qua
Gi cha s chng ng ti a
Mi khi truyn, s chng ng gim i mt
Dng pht tn khi s chng ng bng 0

B mn K thut my tnh
Khoa Khoa
nh gi
Tt c cc l trnh u c th
Rt mnh m (robust)
t nht s c mt gi i theo l trnh vi s
chng t nht
C th c dng thit lp ng mch o
Tt c cc node u nhn c packet
Thch hp trong pht tn thng tin

B mn K thut my tnh
Khoa Khoa
Random Routing
T tng: da trn Flooding routing
Node s chn mt ng lin kt ra truyn i
cc gi nhn c thay v gi ra tt c cc lin
kt
Vic chn la c th l ngu nhin hoc xoay
vng (round robin)
C th chn ng lin kt ra da trn vic tnh
ton xc sut

c im: l trnh tm c thng thng

khng phi l ng c chi ph ti thiu hoc
s chng nh nht

B mn K thut my tnh
Khoa Khoa
Random Routing
T tng: da trn Flooding routing
Node s chn mt ng lin kt ra truyn i
cc gi nhn c thay v gi ra tt c cc lin
kt
Vic chn la c th l ngu nhin hoc xoay
vng (round robin)
C th chn ng lin kt ra da trn vic tnh
ton xc sut

c im: l trnh tm c thng thng

khng phi l ng c chi ph ti thiu hoc
s chng nh nht

B mn K thut my tnh
Khoa Khoa
Adaptive Routing
c s dng bi hu ht cc mng chuyn
mch gi
Quyt nh tm ng thay i khi cc iu
kin trn mng thay i
ng kt ni hoc node trung gian h
Tnh trng ngn mch thay i
Cn bit cc thng tin v mng
Quyt nh tm ng phc tp
Tradeoff gia cht lng ca thng tin mng
v chi ph truyn thng tin ny

B mn K thut my tnh
Khoa Khoa
Nhn xt
u im
Hiu sut c ci thin
Tr gip iu khin nghn mng
Hn ch
Quyt nh tm ng phc tp
Tng ti

B mn K thut my tnh
Khoa Khoa
Adaptive Routing Phn loi
Da trn ngun thng tin v mng
Cc b (isolated)
Cc node k (distributed)
Tt c cc node (centralized)

B mn K thut my tnh
Khoa Khoa
Isolated Adaptive Routing
Mi node trong mng t cp nht bng tm
ng ca mnh da vo cc thng tin v
mng m node hc hi c
Khng trao i thng tin tm ng vi cc
node khc
Mt trong nhng phng php n gin nht
ca tm ng ng
t dng (khng dng thng tin c sn)
Ph hp vi cc mng c kch thc nh v
hot ng tng i n nh

B mn K thut my tnh
Khoa Khoa
Distributed adaptive Routing
Thng tin v tnh trng hin hnh ca mng
s c nh k trao i, cp nht gia cc
node
Sau thng tin ny s c phn b v li
cc node trong mng hay mt s node trong
mng lm nhim v tm ng
Cc node ny cp nht li bng routing
Phng php ny p ng c vi nhng
thay i trng thi ca mng, nhng ng
thi cng lm tng lu lng thng tin trong
mng

B mn K thut my tnh
Khoa Khoa
Centralized adaptive routing
Thng tin v tnh trng hin hnh ca mng
s c nh k trao i, cp nht gia cc
node trong ton mng.
Sau thng tin ny s c tp trung v
mt my ch trong mng lm nhim v
routing
p ng c vi nhng thay i tc thi
trong mng
Nhc im l thng tin routing trong ton
mng tp trung v mt my nn khi my ny
khng hot ng th ton mng s khng
hot ng c

B mn K thut my tnh
Khoa Khoa
Bi ton tm ng i ngn nht
Cho mt th c trng s
Tm ng i ngn nht t mt node n
cc node khc

B mn K thut my tnh
Khoa Khoa
Gii thut Dijkstra
Input
th G(V, E) trong V l tp nh, E l tp
cnh c trng s khng m
nh ngun S: S V
Output
ng i ngn nht t nh ngun S n tt c
cc nh cn li

B mn K thut my tnh
Khoa Khoa
Gii thut Dijkstra
K hiu
Di : ng i ngn nht t node ngun S n
node i ti bc chy hin hnh ca gii thut
M: tp cc nh xt ti bc chy hin hnh
ca gii thut
dij : trng s trn cnh ni t node i n node j
dij = 0 nu i trng j
dij = Eij nu i khc j

B mn K thut my tnh
Khoa Khoa
Gii thut Dijkstra
Bc 1: khi ng
M = {S}
Di = dSI
Bc 2: cp nht ng i ngn nht
Chn nh N V sao cho: DN = min {Di} i V
\M
M = M {N}
Dj = min {Dj, DN + dNj } j V\M
Bc 3: lp li bc 2 cho n khi M=V
Kt qu Di s l ng i ngn nht t node
ngun S n node i

B mn K thut my tnh
Khoa Khoa
Gii thut Dijkstra
Tm ng i ngn nht t node ngun 1
n tt c cc node cn li
5

2 3
2 3 5

1 2 1 6
3

1 2
4 5
1

B mn K thut my tnh
Khoa Khoa
Gii thut Dijkstra

B mn K thut my tnh
Khoa Khoa
Gii thut Bellman - Ford
Input
th G(V, E) trong V l tp nh, E l tp
cnh c trng s
nh ngun S: S V
Output
th c chu trnh m khng tn ti ng i
ngn nht
ng i ngn nht t nh ngun S n tt c
cc nh cn li

B mn K thut my tnh
Khoa Khoa
Gii thut Bellman - Ford
K hiu
D(h)i : ng i ngn nht t node ngun S n
node i c ti a h on (link).
dij: trng s trn cnh ni t node i n node j
dij = 0 nu i trng j
dij = Eij nu i khc j

B mn K thut my tnh
Khoa Khoa
Gii thut Bellman Ford
Bc 1: khi ng
D(1)N = dSN, N V\{S}
Bc 2: cp nht ng i ngn nht
D(h+1)N = min {D(h)j + djN} j V\{S}
Bc 3: lp li bc 2 cho n khi khng c
ng i mi no ngn hn c tm thy
th dng
Kt qu D(h)N s l ng i ngn nht t
node ngun S n node N

B mn K thut my tnh
Khoa Khoa
Gii thut Bellman Ford
Tm ng i ngn nht t node ngun 1
n tt c cc node cn li
5

2 3
2 3 5

1 2 1 6
3

1 2
4 5
1

B mn K thut my tnh
Khoa Khoa
Gii thut Bellman Ford

B mn K thut my tnh
Khoa Khoa
Bi tp
Tm ng ngn nht t node 1 n cc
node cn li
Theo gii thut Dijkstra
Theo gii thut Bellman Ford
4
1 2
3

1 3 6
2
1
3 2 4 5
3
4
3
5 1 7

B mn K thut my tnh
Khoa Khoa
Bi tp
Tm ng ngn nht t node 1 n cc
node cn li
Theo gii thut Dijkstra
Theo gii thut Bellman Ford

E 1 A 1 B
1 1
5
G 1
C
3
1 D F
2 1
1 4
1
H K J

B mn K thut my tnh
Khoa Khoa
nh gi
Ph thuc vo thi gian x l ca cc gii
thut
Ph thuc vo lng thng tin yu cu t
cc node khc
Ph thuc vo vic hin thc
Cng hi t v mt li gii di iu kin
topology tnh v chi ph khng thay i
Nu chi ph lin kt thay i, cc gii thut s
tnh li theo kp s thay i

B mn K thut my tnh
Khoa Khoa
Tm ng trong ARPANET (t c)
Th h u tin
1969
Distributed adaptive
Dng thi gian tr c tnh lm tiu chun nh
gi hiu qu
Dng gii thut tm ng Bellman-Ford
Cc node trao i thng tin (cc vector thi gian
tr) vi cc node k
Cp nht bng tm ng da trn thng tin n
Khng quan tm n tc ng truyn, ch
quan tm chiu di hng i ti cc node
Chiu di hng i khng phi l cch o chnh
xc ca thi gian tr
p ng chm vi nghn mch
B mn K thut my tnh
Khoa Khoa
ARPANET Tm ng
Th h th 2
1979
Dng thi gian tr lm tiu chun nh gi hiu
qu
Thi gian tr c o trc tip
Dng gii thut tm ng Dijkstra
Thch hp cho mng c ti trung bnh hoc nh
Khi mng ti nng, c t tng quan gia thi
gian tr o c v thi gian tr gp phi

B mn K thut my tnh
Khoa Khoa
ARPANET Tm ng
Th h th 3
1987
Vic tnh ton chi ph ca lin kt c thay
i
Thi gian tr trung bnh c o trong 10 giy
cui
Bnh thng ha da trn gi tr hin ti v kt
qu trc

B mn K thut my tnh
Khoa Khoa
Ni dung
Gii thiu mng chuyn mch gi
Tm ng
X.25

B mn K thut my tnh
Khoa Khoa
Mng truyn s liu X.25
1976, CCITT
Giao tip gia trm v mng chuyn mch
gi
Ph bin trong cc mng chuyn mch gi
v chuyn mch gi ca mng ISDN
nh ngha 3 lp
Vt l
Lin kt
Gi

B mn K thut my tnh
Khoa Khoa
Lp vt l
Giao tip gia trm v lin kt kt ni trm
vi node mng
DTE: thit b ca ngi dng
DCE: node mng
Dng c t lp vt l X.21 (i khi thay th
bng EIA-232)
Truyn d liu tin cy thng qua lin kt vt
l
Cung cp tun t ca cc frame

B mn K thut my tnh
Khoa Khoa
Lp lin kt
Link Access Protocol Balanced (LAPB)
Tp con ca nghi thc HDLC
Xem thm ti liu

B mn K thut my tnh
Khoa Khoa
Lp gi (packet)
External virtual circuits
Kt ni lun l (virtual circuits) gia cc thu
bao

B mn K thut my tnh
Khoa Khoa
Dch v mch o
Cho php kt ni lun l
gia hai trm
Mch o bn ngoi
Xc nh ng i thng
qua mng
Mch o bn trong
Thng c mi quan h
1-1 gia mch o bn
ngoi v mch o bn
trong
C th s dng X25 vi
mng kiu datagram
Mch o bn ngoi yu
cu knh lun l ring
B mn K thut my tnh
Khoa Khoa
Cc dch v mch o
Virtual Call (SVC Switched Virtual Circuit)
Virtual circuit c to ng cho mi giao dch
Permanent virtual circuit
Virtual circuit c gn trc c nh
Khng cn thit lp v xa kt ni
Fast Select call
Dng truyn thng bo/lnh nh (<128 octet) trong
qu trnh thit lp/xa kt ni

B mn K thut my tnh
Khoa Khoa
X.25 nh dng gi

B mn K thut my tnh
Khoa Khoa
X.25 Gi d liu
S VC (12 bits)
4 bit logical group number
+ 8 bit logical channel number.
Thng thng 2 trng ny c xem nh mt
Dng ch th loi kt ni hoc knh gia cc
DTE
Cc loi kt ni khc nhau cho php nhiu phin
giao dch gia cng mt cp DTE
C th ln n 4095 knh lun l trn cng mt
ng giao tip vt l

B mn K thut my tnh
Khoa Khoa
X25- Gi d liu
Q bit (Qualifier bit)
Khng c nh ngha trong chun
Thng phn bit cc gi cha d liu (Q=0) v cc gi
cha thng tin iu khin (Q=1)
D bit
Bng 0 khi gi ny l mt phn ca gi b phn mnh
Cng c dng iu khin dng
Khi D=0, iu khin dng c thc hin cc b (gia DTE v cc
b DCE)
Khi D=1, iu khin dng c thc hin gia DTE v DTE xa
M bit (More bit)
Gi d liu ln c phn thnh nhiu gi
Ngoi tr gi cui cng, cc gi s c bit M bng 1
P(R) ch s nhn tun t
P(S) ch s gi tun t

B mn K thut my tnh
Khoa Khoa
X.25 Gi iu khin
6 nhm:
Thit lp kt ni
iu khin dng
Gim st
Xc nhn
Chun on
Ngt qung

B mn K thut my tnh
Khoa Khoa
X.25 Gi iu khin
Gi thit lp kt ni
4 loi: Call Request, Incoming Call, Call
Accepted, v Call Connected
c dng trong giai on thit lp mch o
Gi iu khin dng
3 loi: Receive Ready (RR), Receive Not Ready
(RNR), v Reject (REJ)
c dng trong giai on truyn d liu (cc gi
u cha P(R))

B mn K thut my tnh
Khoa Khoa
X.25 Gi iu khin
Gi gim st
Bao gm: Restart Request/Indication, Clear
Request/Indication, Reset Request/Indication
Restart Request c dng trong tnh hung xu
(host crash) xa VC do DTE ny ang gi
Clear Request dng xa VC (c ch ra trong
VC number)
Reset Request c dng reset ch s nhn/
gi tun t v 0 trong ch truyn d liu

B mn K thut my tnh
Khoa Khoa
X.25 Gi iu khin
Gi xc nhn
Dng xc nhn cc yu cu trc (cho
Restart, Clear, Reset, v Interrupt)
Gi chun on
Do mng to ra cho mc ch chun on li
Gi ngt qung
c truyn trong qu trnh truyn d liu, v
khng cha ch s gi/nhn tun t.
Cc gi ngt qung c truyn ti DTE ch vi
u tin cao hn cc gi d liu

B mn K thut my tnh
Khoa Khoa
X.25 Set v Reset
Reset
Khi to li virtual circuit
S tun t c t bng 0
Cc gi ang qu cnh b mt
Ty vo cc protocol cp cao khi phc li cc gi
b mt
Kch hot bi vic mt cc gi, sai s tun t,
nghn mch, mt internal virtual circuit
Restart
Tng ng vi yu cu xa tt c cc virtual
circuit
E.g. mt tm thi vic truy cp mng

B mn K thut my tnh
Khoa Khoa
X.25 Th tc thit lp kt ni
DTEa DCEa PSN DCEb DTEb (DTEa
mun kt ni vi DTEb)
DTEa nhn mt virtual circuit number (VCN)
DTEa gi gi call-request cho DTEb (cha VCN, a ch
DTEa, a ch DTEb)
DCEa tm ng i bng qua mng PSN cho gi ny
n DCEb
DCEb nhn mt VCN mi v gi gi incoming-call n
DTEb (gi cha VCN mi v cc thng tin a ch
ngun/ch)
DTEb chp nhn kt ni bng cch gi gi call-
accepted qua DCEb n DCEa
DCEa nhn c gi call-accepted v gi gi call-
connected ti DTEa
Sau qu trnh ny, DTEa v DTEb c th gi cc
gi d liu qua li
B mn K thut my tnh
Khoa Khoa
X.25 Th tc gii phng kt ni
DTEa DCEa PSN DCEb DTEb
(DTEa mun xa kt ni vi DTEb)
DTEa gi gi clear-request ti DCEa
DCEa gi gi clear-indication ti DTEb (thng
qua DCEb)
DTEb gi clear-indication ti DTEa (thng qua
cc DCEb v DCEa)

B mn K thut my tnh
Khoa Khoa
Virtual Call

B mn K thut my tnh
Khoa Khoa
X.25
iu khin dng v iu khin sai
HDLC (chng 5)
Chui cc gi
Chui y cc gi
Cho php khi d liu ln c truyn qua mng
vi kch thc gi nh hn m khng mt tnh
ton vn ca khi
2 loi gi
Cc gi A
M bit 1, D bit 0
Chiu di gi ti a
Cc gi B
Phn cn li

B mn K thut my tnh
Khoa Khoa