Abstract
When designing a local area network (LAN), establishing performance characteristics of the network before putting it into use is of paramount importance; it gives the designer the freedom and flexibility to adjust various parameters of the network in the planning rather than the operational phase. However, it is hard to predict the performance of the LAN unless a detailed analysis of a similar network is available. Information on a similar network is generally hard to come by so that performance modeling of the LAN must be carried out.
Success doesn’t discriminate. It’s an equal opportunity employer—available to everyone willing to pay the price.
—Anonymous
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
J. R. Freer, Computer Communications and Networks. New York: Plenum Press, 1988, pp. 284, 285.
P. J. Fortier, Handbook of LAN Technology. New York: McGraw-Hill, 1989, chap. 16, pp. 305-312.
J. L. Hammond and P. J. P. O’Reilly, Performance Analysis of Local Computer Networks. Reading, MA: Addison-Wesley, 1986, pp. 225-237.
W. Bux, “Local-area subnetworks: a performance comparison,” IEEE Trans. Comm., vol. COM-29, no. 10, Oct. 1981, pp. 1465-1473.
H. Tagaki, Analysis of Polling Systems. Cambridge: MIT Press, 1986.
M. J. Ferguson and Y. J. Aminetzah, “Exact results for nonsymmetric token ring systems,” IEEE Trans. Comm., vol. COM-33, no. 3, March 1985, pp. 223-231.
K. S. Watson, “Performance evaluation of cyclic service strategies -- a survey,” in E. Gelenbe (ed.), Performance ‘84. Amsterdam: North-Holland, 1984, pp. 521-533.
S. W. Fuhrmann and R. B. Cooper, “Application of decomposition principle in M/G/1 vacation model to two continuum cyclic queueing models -- especially token-ring LANs,” AT & T Technical Journal, vol. 64, no. 5, May-June 1985, pp. 1091-1099.
I. Rubin and L. F. M. de Moraes, “Message delay analysis for polling and token multiple-access schemes for local communication networks,” IEEE Jour. Sel. Area Comm., vol. SAC-1, no. 5, Nov. 1983, pp. 935-947.
A. G. Konheim and M. Reiser, “A queueing model with finite waiting room and blocking,” J. ACM, vol. 23, no. 2, April 1976, pp. 328-341.
G. B. Swartz, “Polling in a loop system,” J. ACM, vol. 27, no. 1, Jan. 1980, pp. 42-59.
F. -J. Kauffels, Practical LANs Analysed. Chichester: Ellis Horwood, 1989.
S. R. Sachs et al., “Performance analysis of a token-bus protocol and comparison with other LAN protocols,” Proc. 10th Conf. on Local Computer Networks, Oct. 1985, pp. 46-51.
R. Rom and M. Sidi, Multiple Access Protocols: Performance and Analysis. New York: Springer-Verlag, 1990.
G. E. Keiser, Local Area Networks. New York: McGraw-Hill, 1989.
F. A. Tobagi and V. B. Hunt, Performance analysis of carrier sense multiple access with collision detection, Computer Networks, vol. 4, 1980, pp. 245-259.
S. S. Lam, “A carrier sense multiple access protocol for local networks,” Computer Networks, vol. 4, no. 1, Jan. 1980, pp. 21-32.
J. F. Hayes, Modeling and Analysis of Computer Communications Networks. New York: Plenum Press, 1984, pp. 226–230.
W. Bux, “Performance issues in local-area networks,” IBM Syst. Jour., vol. 23, no. 4, 1984, pp. 351-374.
E. S. Lee and P. I. P. Boulton, “The principles and performance of Hebnet: A 40 Mbits/s glass fiber local area network,” IEEE J. Select. Areas Comm., vol. SAC-1, Nov. 1983, pp. 711-720.
A. E. Kamal, “Star local area networks: a performance study,” IEEE Trans. Comp., vol. C-36, no. 4, April 1987, pp. 484-499.
M. K. Mehmet-Ali et al., “Traffic analysis of a local area network with a star topology,” IEEE Trans. Comm., vol. COM-36, no. 6, June 1988, pp. 703-712.
C. Androne and T. Palade, “Radio coverage and performance analysis for local area networks,” Proc. of 9 th International Symposium on Electronics and Telecommunications, 2010, pp. 213-216
Author information
Authors and Affiliations
Problems
Problems
-
6.1
Describe briefly the seven layers of the OSI model.
-
6.2
Compare and contrast controlled access and random access protocols.
-
6.3
Explain how token ring works.
-
6.4
In a Cambridge ring with a data rate of 5 Mbps, each slot has 37 bits. If 50 stations are connected to the ring and the average internodal distance is 20 m, how many slots can the ring carry? Assume a propagation speed of 2.5 × 108 m/s and that there is a 1-bit delay at each station.
-
6.5
For a token-passing ring, assume the following parameters:
No. of stations
=
50
Transmission rate
=
1 Mbps
Mean packet length
=
1,000 bits (exponentially distributed)
Length of the ring
=
2 km
Token length
=
24 bits
Header length
=
0 bit
Bit delay
=
1 bit
Propagation delay
=
5 μs/km
Calculate the mean delay of a message for exhaustive service discipline for ρ = 0.1, 0.2, …, 0.9.
-
6.6
For both constant exponential packet distributions, calculate the mean delay for a token bus LAN with the following parameters:
No. of stations
=
50
Transmission rate
=
5 Mbps
Mean packet length
=
1,000 bits
Bus length
=
1 km
Token length
=
96 bits
Header length
=
0 bit
Bit latency
=
1 bit
Propagation delay
=
5 μs/km
Try cases for ρ = 0.1, 0.2, …, 0.9 and assume exhaustive service discipline.
-
6.7
Explain how CSMA/CD protocol works.
-
6.8
Repeat problem 6.6 for the CSMA/CD protocol.
-
6.9
(a) Assuming an exhaustive service discipline, calculate the average transfer delay of a token bus with the following parameters.
No. of stations
=
40
Transmission rate
=
1 Mbps
Mean packet length
=
500 bits (exponentially distributed)
Cable length
=
4 km
Token length
=
96 bits
Header length
=
0 bit
Bit delay
=
1 bit
Propagation delay
=
2 μs/km
Traffic intensity
=
0.4
(b) Repeat part (a) for a CSMA/CD bus LAN.
-
6.10
Rework Problem 6.6 for the case of a constant packet length of 1,000 bits.
- 6.11
-
6.12
For the unslotted nonpersistent CSMA/CD, plot the throughput S versus offered local G. Take a = 0.01 and b = 5a.
-
6.13
Repeat 6.12 for slotted nonpersistent CSMA/CD.
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Sadiku, M.N.O., Musa, S.M. (2013). Local Area Networks. In: Performance Analysis of Computer Networks. Springer, Cham. https://doi.org/10.1007/978-3-319-01646-7_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-01646-7_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-01645-0
Online ISBN: 978-3-319-01646-7
eBook Packages: Computer ScienceComputer Science (R0)