See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/3516040

Traffic control scheme for interconnection of FDDI networks through ATM

network

Conference Paper · February 1993

DOI: 10.1109/INFCOM.1993.253335 · Source: IEEE Xplore

CITATIONS READS
8 61

6 authors, including:

Chikara Ohta Hideki Tode

Kobe University Osaka Prefecture University
95 PUBLICATIONS   258 CITATIONS    270 PUBLICATIONS   918 CITATIONS   

SEE PROFILE SEE PROFILE

Some of the authors of this publication are also working on these related projects:

Network service platfome for edge computing View project

Quality of Service for Integrated Services Packet Networks View project

All content following this page was uploaded by Chikara Ohta on 20 September 2013.

The user has requested enhancement of the downloaded file.

 Trac Control Scheme for Interconnection of FDDI Networks
through ATM Network
Miki YAMAMOTOy, Toshihito HIRATAy, Chikara OHTAy, Hideki TODEy,
Hiromi OKADAy and Yoshikazu TEZUKAz
y
Faculty of Engineering, Osaka University zFaculty of Engineering, Kansai University
2-1 Yamadaoka, Suita, Osaka 565 JAPAN 3-3-35 Yamate-cho, Suita, Osaka 564 JAPAN

ABSTRACT the ATM network. One of them is adjustment of con-

Interconnection of multiple MAN's through ATM net-
work will be one of the most important applications of
the ATM network. MAN uses connection less proto-
col, but the ATM network is the connection oriented
network. Thus, interworking of MAN and ATM net-
work is one of the most important technical issues for
MAN interconnection through ATM network. In the
paper, we focus on FDDI networks interconnection
and present a new trac control scheme for FDDI
interconnection through ATM network. The scheme
consists of two parts, a VP bandwidth allocation algo-
rithm and a feedback type buer protection
ow con- In the paper, we focus on the FDDI interconnection
trol. Both use the acknowledge for the frame of FDDI
as an control unit. Simulation results show that VP
bandwidth allocated by the scheme increases accord-
ing to arrival trac when the destination FDDI has
ow control. Both use the acknowledge for the
enough capacity and allocated bandwidth is not in-
creased when its capacity is less than arrival trac.
Thus, our scheme has desirable VP bandwidth alloca-
tion characteristics. Simulation results also show that
the scheme prevents cell loss at a destination gateway
completely.
1 Introduction
B-ISDN is the most promising infrastructure for
the future communication networks. B-ISDN is ex-
pected to enhance not only the geographical net-
work region itself but also the services for users.
Asynchronous Transfer Mode (ATM) has been pro-
posed for the transfer mode of B-ISDN by CCITT[1].
MAN(Metropolitan Area Network) interconnection
through ATM networks is considered to be the most
nectionless communication for MAN's and connection
oriented communication for the ATM networks. MAN
uses a connectionless communication for intra-network
trac. The ATM network uses a connection oriented
communication. Network operations for connection
establishment including bandwidth allocation are nec-
essary for ATM network trac. Thus, bandwidth es-
timation is necessary for inter-MAN trac through
the ATM network. Other problem is the congestion
control for multiple tandem-connected networks. Con-
gestion at intermediate networks or at the connection
point aects a lot to the end-to-end performance.
through the ATM network and a trac control for it.
The control scheme consists of two parts, a bandwidth
allocation algorithm and a feedback type buer pro-
tection
frame of FDDI as an control unit. The feedback type
congestion control is considered to be unapplicable to
the ATM networks because the propagation delay can
not be neglected compared with the cell transmission
delay. A FDDI frame, however, is much longer than
a cell, so feedback type congestion control can be ap-
plied when an FDDI frame is a control unit.
In section 2 of the paper, technical issues for FDDI
network interconnection through the ATM network
are presented and in section 3 we present the trac
control scheme. Performance of the presented scheme
which is obtained from computer simulation is shown
in section 4 and applicability of the scheme to the
CLSF application is investigated in section 5.
2 FDDI Networks Interconnection
important application for B-ISDN in the rst phase of through ATM network
B-ISDN development.
There are a lot of technical problems which should FDDI (Fiber Distributed Data Interface) denes
be overcome to realize MAN interconnection through the high speed communication interfaces[2][3] for the
user group which distributes geographically in a close
area. Enhancement of network area, which leads en-
hancement of applicable data base and network re-
sources, is a potential demand of the network users.
FDDI networks interconnection through the ATM net-
work is one of the promising solutions of this demand.
Concerning about the connection services in the
ATM network, two types of FDDI network intercon-
nection can be considered;
however, has been said to be unapplicable to the ATM
networks due to the long propagation delay.
The paper deals with two challenging issues for
FDDI networks interconnection through the ATM net-
work. One is a bandwidth allocation algorithm which
allocates adequate bandwidth to the ATM connec-
tion(VP) which transmits inter-FDDI trac. The
other is a feedback type trac control which can be
applied to the ATM connection for inter-FDDI traf-
A. Inter-FDDI trac uses ATM network connec-
tion(Fig.1).
B. Inter-FDDI trac is dealt at CLSF(Connection
Less Service Function) in ATM network(Fig.2).
c. To investigate the basic performance of these two
schemes, we choose a simple model of FDDI networks
interconnection(Fig.3), i.e. one pair of FDDI networks
are interconnected through one VP directly. Results
obtained from the model can be applied to the case A
directly and we show how to apply our schemes to the
In the rst case, ATM network connection case B(CLSF case) later.
(VP:Virtual Path) is established for each pair of FDDI
networks. In the second, inter-FDDI trac is concen-
trated at CLSF and transmitted to other CLSF which 3 Trac Control for Congestion Pre-
is located close to the destination FDDI. The rst one
is not adequate when the number of FDDI networks
interconnected is large because a number of VP's are
necessary. Thus, the second one is thought to be more
applicable to the ATM network.
Both types of interconnection above have following
technical problems.
1. Bandwidth allocation for ATM connection.
2. Trac control for tandem connected multiple net-
works.
vention at Destination Gateway
3.1 Basic Concept
The ATM networks support connection oriented
communication and the FDDI networks support con-
nectionless service communication. Thus, a facility,
i.e. a gateway, is necessary for protocol conversion
between ATM interfaces and FDDI. A data unit in
FDDI network is a frame which has a variable length
and whose maximum length is 4500byte. A data unit
in the ATM network is a cell whose length is x and
In both cases (A and B above), inter-FDDI trac 53byte. At the source gateway, a frame for FDDI is
is transmitted through ATM connection in the ATM decomposed to multiple cells. Cells are assembled to
network. In the rst case(case A), a direct communi- FDDI frame at the destination gateway. There are
cation path (VP) is established for inter-FDDI trac some options for the way to identify which frame a cell
transmission of each pair of FDDI networks. In the belongs to. One of the simplest ways is that a VCI is
second case (case B), an ATM connection (VP)is es-
tablished between CLSF. In the ATM network, ade-
quate bandwidth is allocated to each VP and these
allocated bandwidth can be changed dynamically ac-
cording to the trac volume[4][5]. Thus, bandwidth
allocation for the ATM connections which transmit
inter-FDDI trac is one of the essential technical is-
sues of the FDDI interconnection.
Inter-FDDI trac is transmitted through a source
FDDI network,an ATM network and a destination
FDDI network. Congestion at each network aects
a lot to the end-to-end performance of the inter-FDDI
trac. One of the solutions for the congestion avoid-
ance for tandem connected networks is the feedback
type congestion control by which \backpressure eect"
is expected. The feedback type congestion control,
used for frame identication. One VCI is allocated to
the cells which belong to the same frame.
We assume that each gateway pair is connected by
VP in the ATM network, which is a simple model of
FDDI interconnection. In this situation, VP band-
width allocation is one of the most important issues
for FDDI interconnection through the ATM network.
The simplest way is that 100Mbps is allocated to the
VP but this is least eective. In [6], VP bandwidth
control method which controls VP bandwidth accord-
ing to the trac volume arrived at the source gate-
way from the source FDDI, has been proposed. This
scheme does not take trac condition of destination
FDDI into consideration. This may lead that too
much trac is transmitted to the destination gate-
way even though the destination FDDI is congested.
This is one of the most serious problems for tandem
connected networks. A solution for this problem is
a congestion control which uses feedback information.
From feedback information, the source gateway can
estimate the capacity of destination FDDI. When VP
bandwidth is changed according to this estimation,
congestion at the destination gateway can be avoided.
Fig.3 shows the basic structure of the proposed
scheme. The source gateway consists of a buer where
ow at
cells decomposed from an arrival frame are stored and
a permit queue. A capacity of the permit queue is
settled to the number of cells which can be stored at
ow control is a frame.
destination gateway buer, i.e. the capacity of it. The
scheme is formulated with two parts, a bandwidth al-
location algorithm and a feedback type buer protec-
ow control
tion trac control. These are described in detail in
the following section.
3.2 Flow Control for Destination Gate-
way Buer Protection
It is not preferable to make cells which arrive at
the destination gateway lost, because they have al-
ready used plenty of network resources in the ATM
network. We present a
ow control scheme which pre-
vents buer over
ow at the destination gateway. The The VP bandwidth compression algorithm is as fol-
detail of the
ow control scheme is as follows; lows;
 At the initial state (where there is no trac at
gateway nor on VP), the permit queue at the
cells related to the FDDI frame, are increased at
the permit queue.
The total amount of permits which include permits
obtained by cells in transmission is same as the ca-
pacity of the destination gateway. So, the number of
cells transmitted into the ATM network without re-
ceiving ACK is restricted under the capacity of the
destination gateway buer. Thus, buer over
the destination gateway is completely prevented.
One ACK is transmitted for an FDDI frame, which
means the control unit of the
An FDDI frame is much longer than a cell. So, prop-
agation delay is relatively short compared with trans-
mission delay. This leads feedback type of
scheme applicable to the ATM network.
3.3 VP Bandwidth Allocation Algorithm
VP bandwidth allocation algorithm presented here
consist of two algorithms; bandwidth compression al-
gorithm and bandwidth enlargement algorithm.
3.3.1 Bandwidth Compression Algorithm
 The source gateway requests VP bandwidth
change to the ATM network every N seconds (we
source gateway is lled up with permits and VP
is allocated initial bandwidth.
 An FDDI frame which arrives at the source gate-
way from the source FDDI network, is decom-
posed into cells. These cells are stored at the
source gateway FIFO buer.
 When there is an available permit in the permit
queue, a cell at the head of buer obtains one
permit and is transmitted into the ATM network
call N(sec) as slide interval). Every N seconds,
total amount of frames transmitted to the desti-
nation FDDI from the destination gateway is es-
timated from ACK's received during the latest M
slide intervals (i.e. MN seconds)(Fig.4). We call
M as a measuring interval. Request bandwidth
is calculated from this estimated amount of infor-
mation by raising to a unit of Mbps. For exam-
ple, when the estimated amount value is 3.2Mbps,
the request bandwidth is 4Mbps. In this case,
0.8Mbps is a margin bandwidth.
at the rate dened by the bandwidth allocated to
the VP.
 At the destination gateway, arrived cells are as-
sembled to an FDDI frame according to their
VCI. Whenever one FDDI frame assembled at the
destination gateway is transmitted to the desti-
nation FDDI network, an ACK including FDDI
frame length information is transmitted to the
source gateway.
 When the source gateway receives this ACK, per-
mits whose number is the same as the number of
 When the calculated request bandwidth is less
than a minimum bandwidth (Bmin), the request
bandwidth is settled to Bmin (Mbps).
 When there is enough vacant bandwidth, the
ATM network allocates the requested bandwidth
to the VP.
3.3.2 Bandwidth Enlargement Algorithm
The above bandwidth allocation algorithm can work
for bandwidth compression. But this does not work
well for bandwidth enlargement. Thus, some band-
width enlargement algorithm is necessary for adequate
bandwidth allocation. When trac volume in the des-
tination FDDI network is small, i.e. it has enough
capacity, and trac between two FDDI networks is
small, VP bandwidth is compressed by the above algo-
rithm. If trac between two FDDI networks increases
in this situation, cell transmission rate to the desti-
nation gateway has been regulated by the VP band-
width, so arrival rate of ACK's cannot be so high.
[Frame arrival process to the source gateway]
 NS: The number of active stations (i.e. stations
which have frames to be sent) in the source FDDI
network.
 NG : The number of stations which have frames
sent to the source gateway i.e. inter-FDDI trac.
Inter FDDI trac is modeled as follows(Fig.6).
In this situation, arrival frames to the source gate-
way are stored in the buer even though there are
many permits in the permit queue. When the system
falls into this situation, cell transmission rate from the
source gateway must be increased, i.e. bandwidth for
the VP should be enlarged. We present the following
bandwidth enlargement algorithm.
 A threshold for the buer and a threshold for
the permit queue in the source gateway are set-
tled. At the timing of bandwidth request (ev-
ery N(sec)) bandwidth for the VP is increased by
an increment unit of bandwidth when the buer
length and the permit queue length in the source
gateway are over each threshold.
4 Performance Evaluation
We evaluate the performance of the trac control
for congestion prevention at destination gateway (we
call our scheme DGW scheme) by computer simula-
tion. First, we compare the DGW scheme and the VP
bandwidth control proposed in [6] (we call this SGW
scheme because it controls VP bandwidth according
to the trac volume arrived at the source gateway).
And we investigate the system parameter of the DGW
scheme.
4.1 Simulation Model
FDDI is the token ring network which uses the
Timed Token Rotation Protocol[7]. Mean token ro-
tation time is less than TTRT(Target Token Rotation
Time) and maximum token rotation time is exactly
less than twice the TTRT[7][8]. On a heavy trac
condition, token rotation time reaches close to the
TTRT and interarrival time of the token reaches a
 Buer capacity of each station is innity.
 Frame arrival process to each station is a Poisson
process with mean arrival rate 1 (frames/sec).
 The ratio of inter-FDDI trac is P .
 The token holding time(THT) of each station
is exponentially distributed with mean TTRT NS
(sec).
 The time interval between the time when the i-
th inter-FDDI station releases the token and the
time when the (i +1)-th inter-FDDI station holds
the token, is exponentially distributed with mean
TTRT  NS ?NG (sec).
NS NG
[Frame service process in the destination FDDI]
 NR: The number of active station in the desti-
nation FDDI.
 Interarrival process of the token to the destination
gateway is Arlang distribution of phase (NR ? 1)
with mean TTRTN(RNR ?1) (sec).
 Token Holding Time(THT) for the destination
gateway is exponentially distributed with mean
TTRT (sec).
NR
Simulation parameters are settled as follows;
 The distance between two FDDI networks is
500(km).
 Buer capacity of both the source and destination
gateway is 50 maximum length frames (50  4500
byte).
 FDDI frame length is truncated exponentially dis-
xed value[9][10]. Taking these characteristics of the tributed with mean 70cells. Maximum length is
FDDI into consideration, the source FDDI network 103cells and minimum length is 50cells.
and the destination FDDI network are modeled as a
cyclic server with idle period.  TTRT is 167.77216(msec).
  Time necessary for VP bandwidth allocation is
50(msec).
 Propagation delay is 5.0 (sec/km).
 A minimum bandwidth(Bmin ) is 1(Mbps).
 Pay load type of the cell is type 3 i.e. pay load is
44byte.
4.1.1 Comparison with SGW scheme
In this section, we investigate DGW scheme and SGW
scheme. For SGW scheme, we assume following as-
sumptions.
 Bandwidth request is made every N(sec) accord-
ing to the arrival trac volume arrived at the
source gateway and measured in the previous
M  N (sec). Request bandwidth is calculated
from this evaluated amount of arrived informa-
tion by raising to a unit of Mbps.
 Threshold for the buer at the source gateway is
settled and bandwidth is increased by an incre-
ment unit of bandwidth when the buer length is
over the threshold.
The mean frame arrival rate to the source gateway,
2 and mean service rate of frames at the destination
gateway is as follows;
2 = 1  P  NG (frame/s)
=
100  106  1 (frame/s)
both schemes have high applicability to bandwidth in-
crement required from increase of arrival trac to the
source gateway.
Fig.10 shows transient behavior of the allocated
bandwidth of the SGW scheme and the DGW scheme
under the trac condition depicted in Fig.9. The
frame service rate at the destination gateway () de-
creases for two seconds (20{22 sec) and during this in-
terval  is less than 2. This leads temporary overload
condition and VP bandwidth should be compressed as
soon as possible. As shown in Fig.10, the SGW scheme
can not compress the VP bandwidth in this situation
at all because it only uses the trac information at the
source gateway. The DGW scheme decreases the VP
bandwidth about 1(sec) after the capacity of the des-
tination gateway decreases. These results show high
applicability of the DGW scheme for bandwidth com-
pression required from capacity decrease of the des-
tination FDDI. The reason for about 1(sec) delay of
bandwidth compression is that request bandwidth is
calculated from the trac information obtained dur-
ing the previous M  N (sec). When M  N is small,
the VP bandwidth will be varied quickly according to
the capacity change of the destination gateway. But,
too small M  N leads too sensitive bandwidth allo-
cation. We investigate the performance of the DGW
scheme for these system parameters in the following
section.
[Average VP bandwidth]
Fig.11 shows average VP bandwidth characteristics
where the capacity ratio ( 2 ) is varied by increasing
L  44  8 NR 2 ( is xed). When 2 is less than , the VP band-
where L is average frame length(cell). We dene the
capacity ratio ,

= 2
 ideal bandwidth allocation is as shown in Fig.11. The
[Bandwidth allocation]
We investigate the transient behavior of the scheme
when inter-FDDI trac or the capacity of the desti-
nation FDDI changes temporarily.
Fig.8 shows transient behavior of the allocated
bandwidth of the SGW scheme and the DGW scheme
under the trac condition depicted in Fig.7. Frame
arrival rate to the source gateway(2) increases close
to the frame service rate at the destination gate-
way (, frame transmission rate to the destination
FDDI) for two seconds (20{22 sec) as shown in Fig.7.
In both schemes, the allocated bandwidth increases
about 1(sec) after 2 increases. These results show
width should be decided according to the value of 2.
When 2 is greater than , the VP bandwidth should
be restricted according to the value of . Thus, the
SGW scheme only uses trac information of the ar-
rival frames to the source gateway. This means that
it does not take into account the capacity of the desti-
nation FDDI. Simulation results of the SGW scheme
represent that average allocated VP bandwidth in-
creases according to increase of arrival frames even
when the arrival rate (2 ) exceeds the capacity of the
destination FDDI (). However, the DGW scheme in-
creases average allocated VP bandwidth when 2 < ,
and stops to increase when 2  . Thus, the DGW
scheme can allocate VP bandwidth in more adequate
way than the SGW scheme.
[Frame Loss Probability]
 Fig.10 shows frame loss probability characteristics
of the SGW scheme and the DGW scheme. The DGW
scheme represents better frame loss probabilities than
the SGW scheme, even though both schemes are allo-
cated similar VP bandwidth where the capacity ratio
is less than 1.0. For the DGW scheme, frame loss
(cell loss) can not occur at the destination gateway
because of the permit mechanism. In this simulation,
frame loss (cell loss) happens to occur only at the des-
tination gateway for the SGW scheme. Cells arriving
at the destination gateway uses network resources as
they are transmitted through the ATM network. Fur-
thermore, cell loss at the destination gateway leads cell
retransmission (or frame retransmission) and increase
of ATM trac load. Thus, cell loss at the destination
gateway is not desirable, so the DGW scheme is more
adequate than the SGW scheme.
4.1.2 System Parameter for DGW Scheme
The DGW scheme has four system parameters which
should be decided beforehand, measuring interval,
slide interval, a threshold and an increment unit of
bandwidth for the bandwidth enlargement algorithm.
Fig.13 presents average VP bandwidth and frame
loss probability characteristics where the measuring
interval(M) is varied. Simulation results show that the
more M is, the smaller both average VP bandwidth
and frame loss probability are. The DGW scheme
calculates request bandwidth based on ACK informa-
tion received during the previous M  N (sec). So, too
small M leads too sensitive bandwidth request. When
M is small and ACK arrival rate happens to be small
temporarily, the VP bandwidth can be too restricted.
In this case, bandwidth enlargement algorithm may
work frequently, and this leads too much bandwidth
allocation. M should have rather large value taking
into account of the sensitivity of the scheme.
Fig.14 shows average VP bandwidth and frame loss
probability characteristics where the slide interval(N)
is varied. Simulation results show that the more N is,
the smaller average VP bandwidth is and the larger
frame loss probability is. Great value of N leads ef-
fective bandwidth allocation for the same reason de-
scribed above consideration of a parameter M. But
large N leads insensitivity for temporary trac change
and frame loss probability increases. Thus, N leads
more the threshold is and the less the increment unit
of bandwidth is, the smaller average VP bandwidth is
and the larger frame loss probability is. So, threshold
value and the increment unit of bandwidth also lead
tradeo relation between average VP bandwidth and
frame loss probability.
5 Applicability of DGW Scheme for
CLSF Approach
In the paper, we assume one pair of FDDI net-
works are interconnected through ATM VP because
the basic characteristics of the DGW scheme is to
be investigated. As described in section 2, CLSF ap-
proach(Fig.2) is adequate for the ATM network which
should include a lot of FDDI network interconnections.
In CLSF approach, VP is also settled between CLSF.
The DGW scheme can be applied to the CLSF ap-
proach in the following way.
The DGW scheme is applied to the VP between one
pair of CLSF's. The CLSF connected with the desti-
nation FDDI network returns ACK to the CLSF con-
nected with the source FDDI when it receives all cells
which are decomposed from one FDDI frame. The
CLSF connected with the source FDDI receives ACK's
from multiple FDDI's connected to the other CLSF of
the pair and controls the VP bandwidth based on the
trac information obtained from these ACK's in the
similar way of the DGW scheme. The only dierence
between the DGW scheme and these operations for
CLSF application is that VP request bandwidth is cal-
culated from group of ACK's received from multiple
FDDI networks.
6 Conclusions
In this paper, we present a new trac control
scheme for the FDDI interconnection through the
ATM network. The scheme prevents cell loss at the
destination gateway by using a permit operation. Per-
mits are increased at the source gateway when it re-
ceives ACK of a frame from the destination gateway.
The source gateway controls bandwidth of the VP
which connects two FDDI's based on not only the traf-
tradeo relation between average VP bandwidth and
frame loss probability
Fig.15 and Fig.16 show average VP bandwidth
and frame loss probability characteristics where the
threshold and an increment unit of bandwidth are
varied, respectively. Simulation results show that the
c condition of the destination FDDI obtained from
ACK but also arrival trac to it from the source
FDDI. The scheme belongs to the feedback type of
trac control. Feedback type of trac controls are
said to be unapplicable to the ATM network because
propagation delay of a cell cannot neglected compared
 with its transmission time. A control unit of the
scheme is an FDDI frame which is much longer than
a cell, so propagation delay is rather small, which en-
ables a feedback type of trac control applicable to
the ATM network. Simulation results show that band-
width allocated to the VP increases according to ar-
rival trac when the destination FDDI has enough ca-
pacity and allocated bandwidth is not increased when
its capacity is less than arrival trac. Thus, our
scheme has desirable VP bandwidth allocation char-
acteristics.
In tandem connected network, end-to-end trac
control is necessary for the complete prevention of cell
loss. It is our remained work for future to investigate
the performance of the end-to-end trac control which
is constructed with three feedback type of trac con-
trols in the source FDDI network, the ATM network
and the destination FDDI network.
[8 ] K.C.Sevik and M.J.Johnson, \Cycle Time Prop-
erties of the FDDI Token Ring Protocol," IEEE
Trans. on Software Engineering, Vol.SE-13,No.3
(1987 March)
[9 ] W.L.Genter,\Performance Analysis of the To-
ken Passing Bus Network with Priority Classes,"
Ph.D. Dissertation, Rensselaer Polytechnic Insti-
tute, Troy, New York (1990 May)
[10 ] W.L.Genter and K.S.Vastola,\Performance of
High Priority Trac on a Token Bus Network,"
Proc. of 27th IEEE Conf. on Decision and Con-
trol, Austin, Texas (1988 Dec.)

References
[1 ] CCITT Study Group XVIII Draft Documents
on B-ISDN and ATM Techniques, Study Group
XVIII,Geneva (1990 Jan.)
[2 ] American National Standards Institute ANSI
X3.139- 1987:\Fiber Distributed Data Inter-
face (FDDI) { Token Ring Media Access Con-
trol"(1987)
[3 ] F.E.Ross,\An Overview of FDDI: The Fiber
Distributed Data Interface," IEEE Journal on
Selected Areas in Communications, Vol.SAC-7,
No.7, pp.1043-1051 (1989 Sept.)
[4 ] S.Shioda and H.Uose,\Virtual Path Bandwidth
Control for ATM Networks," IEICE Technical
Report, IN91-3 (1991 April)(in Japanese)
[5 ] K.Kusuda et.al, \Control of Virtual Path Capac-
ity in ATM Network," Proc. of the 1992 IEICE
Spring Conf., B-683 (1992 March)(in Japanese)
[6 ] P.Crocetti, G.Gallassi and M.Gerla,\Bandwidth
Advertising for MAN/ATM Connectionless In-
terworking," IEEE INFOCOM'91, pp.1145-
1150(1991 April)
[7 ] W.Stallings,\Handbook of
Computer-Communications Standards,"
Vol.2,chapter7, New York: Macmillan Publishing
Co.

View publication stats