Professional Documents
Culture Documents
Applying Reliability Solutions To A Cooperative Network: International Arab Journal of Information Technology June 2009
Applying Reliability Solutions To A Cooperative Network: International Arab Journal of Information Technology June 2009
net/publication/331560115
CITATIONS READS
0 619
1 author:
Yahya T Qassim
Griffith University
17 PUBLICATIONS 72 CITATIONS
SEE PROFILE
Some of the authors of this publication are also working on these related projects:
All content following this page was uploaded by Yahya T Qassim on 29 January 2020.
Keywords: Network reliability, redundancy, recovery time, spanning tree protocol, rapid spanning tree protocol,
etherchannel
university network. Mosul university network was ●2 Fast Ethernet ports, 2 serial
●Dynamic
Routing= IGRP
established in 2004. The purpose of the network is to Cisco Router
2800 1
ports
●IOS=12.3
●Extended access
connect the different locations of the university by a ●Support=Rip1,Rip2,EIGRP,IGR
list,Static NAT
●No Encrypted
P,OSPF,IS-BGP,VPN,VLAN,VTP
high speed (1 Gigabit Ethernet) links. The network Password
introduces several services to its client (2200 user in Cisco Switch
●Layer 2 switch
●1VLAN/Switch
●24 Fast Ethernet ports
2008), such as internet sharing, Email accounts, web 2950
30
● IOS=12.3
●No Encrypted
Password
hosting and internal chatting. The future may witness ● VLAN, VTP
probability that the nodes in the network can The resulting tree "spans" (i.e. connects) all switches,
communicate to each other, taking into account the but eliminates loops. The steps in order to best
possible failures of network links. The effectiveness of accomplish this process are [2]:
this approach is demonstrated by performing
1. Allowing all switches to send messages to each
experiments on several large networks represented by
other that convey their identity and link "cost".
stochastic graphs. Jain, S.P. and Gopal, K [11] defined
2. Electing a single switch, among all the switches in
and evaluated Global reliability of a network using
the network to be a "root", or central switch.
spanning trees of the network graph. An algorithm for
3. Permitting all other switches to calculate the
generating spanning trees (termed, appended spanning
direction and cost of the shortest path back to the
trees) that are mutually disjoint is proposed. Each
root using messages received from switches closer
appended spanning tree represents a probability term in
to the root. Each switch must have only one way to
the final global reliability expression.
forward frames to the root.
This paper focuses on suggesting a methodology for
4. If two switches servicing the same LAN exchange
the transparent addition of various reliability solutions
messages with each other, the one with the lowest
to a previously installed network. In the following
cost to the root will service the LAN. The other
sections, several methods and techniques were
switch will discard all frames received from that
examined in order to select the best method to serve
LAN, thus opening the link and blocking a traffic
the purpose of building highly available and more
loop.
robust network.
The STP protocol has proved to be the tried and
3. Links Redundancy tested method for providing path redundancy while
eliminating loops. The STP protocol does suffer from a
3.1. Introduction to Spanning Tree Protocol number of drawbacks that limit its applicability,
(STP) and Rapid STP (RSTP) namely [13]:
The IEEE 802.1D standard Spanning Tree Protocol • STP has lengthy failover and recovery times. When
(STP) has been available for use with managed a link fails in STP, a backup link to the root requires
switches and bridges for several years. This software at least 30 second to recognize that it is the best (or
provides a mechanism for resolving redundant physical only) path to the root and become usable (actions of
connections in order to maintain operation of standard different timers of the protocol).
Ethernet LANs that does not allow more than one path • When a failed link returns to service, information
for a packet to be in use at a given time. The Spanning about the "better" route will instantly cause a
Tree Protocol is included with the managed switch backup link to start blocking. But the portion of the
software provided by all major Ethernet managed network below the link that is returning to service
switch product suppliers, and is widely available in the will be isolated (for about 4 seconds) until that link
marketplace. Further, STP has proven in general use becomes forwarding.
over many years to be interoperable, and commercial
• Another problem with STP is that it requires that all
systems utilizing products from multiple vendors are
links must pass through a lengthy period of address
routinely implemented. Standard STP supports
learning, even if the link is a point-to-point link to a
redundant configurations of any type: meshes or rings
device such as an ordinary PC.
or combinations [2].
Ethernet switches operate by forwarding traffic As an Alternative, Rapid Spanning tree protocol
between their ports. The switch examines each (RSTP IEEE802.3W) was suggested to solve STP's
Ethernet frame and records (learns) its MAC address problem with failover time by a number of means.
and the port upon which it resides. When a frame Whereas STP switches store only the best path to the
arrives for a given MAC address, the switch decides on root switch, RSTP switches store all potential paths.
which outgoing port to send it. If a frame arrives and When links fail, RSTP has pre-calculated routes to fall
its destination MAC address is unknown, the switch back upon. Additionally, unlike STP switches, an
will "flood" the frame out all of its ports [3]. RSTP switch will respond to another switch that
If switches in the network are connected in a loop a advertises an inferior or incorrect route to the root
‘broadcast storm’ will result where a single broadcast switch. This information allows the switch with
frame will circulate endlessly. This condition incorrect information to be rapidly trained [14].
consumes all available bandwidth on the loop making RSTP solves STP's problem with lengthy recovery
the network unusable [12]. time by introducing a procedure called proposing-
The Spanning Tree Protocol (IEEE 802.1D) was agreeing. Proposing and agreeing works after a better
designed to solve the fundamental problem of traffic path to the root is restored by "shuffling" the restored
loops. The key idea in STP is to prune (looping) links part of the network one hop at a time towards the
in order to reduce the network topology to that of a tree. network edge. This method also enables the network to
12 International Arab Journal of e-Technology, Vol. 1, No. 2, June 2009
paused for (90 Sec.) until STP finish its path finding with Etherchannel-Ring topology, while Dual-Ring
procedure. could be applied on the less important network sectors.
Data Storage server, security server, management that allows him to react to a problem before it becomes
server and antivirus server. catastrophic.
Mosul
University
AP for Service Provider
WLAN Bridge with
Omni-Directional Antenna
ﺟﺎﻣﻌﺔ
WLANاﻟﻤﻮﺻﻠﺼﻤﺸﻰ
WLAN Access point with
Directional Antenna
1.5 km
References
[9] Mastran D, Singpurwalla N. “A Bayesian
[1] Alex K., " Network Reliability and Resiliency in estimation of the reliability of coherent structure”,
Next Generation Networks at Physical, Data link, Oper Res, 26(4), pp 663–72, 1994.
and Network Layers ", MSC Thesis , Victoria [10] Hardy G., Lucet C., and Limnios N., ”Computing
University of Wellington, 2007. all-terminal reliability of stochastic networks
[2] Forouzan B.,”Data Communications and with Binary Decision Diagrams”.
Networking”, 4’Th Edition, Mcgraw-Hill [11] Jain S. Gopal K., “An efficient algorithm for
Publishing, 2006. computing global reliability of a network”, IEEE
[3] Keiser G.,”Local Area Networks”, Mcgraw-Hill Transactions on Reliability, vol. 37, Issue 5, pp.
Publishing, 1989. 488 – 492, 1988.
[4] Hui-Ling Liu; Shooman, M.L. “Simulation of [12] Tanenbaum A.,”Computer Networks”, 4’Th
computer network reliability with congestion”, Edition, Prentice-Hall Publishing, 2003.
Reliability and Maintainability Symposium, [13] Stallings W. ,”Data & Computer
Proceedings, Annual Volume, Issue, 18-21, Communications, ”Sixth Edition, Prentice-Hall
pp.208–213, 1999. Publishing, 2003.
[5] Jina T., Coitb D., “Approximating network [14] Konak A. and Smith A., “A General Upper
reliability estimates using linear and quadratic Bound for All-Terminal Network Reliability and
unreliability of minimal cuts” NJ 08854-8018, Its Uses”, Proceedings of the Industrial
USA, 2003. Engineering Research Conference, Banff,
[6] Lynn N, Singpurwalla N, Smith A., “Bayesian Canada, May, CD Rom format, 1998.
assessment of network reliability. SIAM Rev; [15] Srivaree-ratana C., Konak A., and Smith A.
40(2), pp. 202–227, 1998. “Estimation of all-terminal network reliability
[7] Harms D, Kraetzl M, Colbourn C, Devitt J. using an artificial neural network, ”Computers
“Network reliability: experiments with a and Operations Research 29 (7): 849–68, 2002.
symbolic algebra environment”, Boca Raton, FL, [16] Cisco Systems,”Internetworking technology
CRC Press; 1995. handbook”, Indianapolis: Cisco Publication,
[8] Tang J, Tang K, and Moskowitzs H. “Exact (2001).
Bayesian estimation of system reliability from [17] Cisco Systems, “packet-switching performance
component test data. Naval Res Logist, 44, over the Fast EtherChannel bundle” Cisco
pp127–46, 1997. Publication, 2003.
Applying Reliability Solutions to a Cooperative Network 17
Qutaiba Ali was born in Mosul, Yahya Qassim was born in Mosul,
Iraq, on October ,1974. He received Iraq, on October ,1972, he received
the B.S. and M.S. degrees from the the B.Sc. degree in Electronic and
Department of Electrical Communications Engineering from
Engineering, University of Mosul, the University of Mosul, Iraq in
Iraq, in 1996 and 1999, respectively. 1994, and in 2004 he received the
He received his Ph.D. degree (with M.Sc. degree in Computer
honor) from the Computer Engineering Department, Engineering from University of
University of Mosul, Iraq, in 2006. Since 2000, he has Mosul. From 2004 till now he is being a lecturer in
been with the Department of Computer Engineering, Computer Engineering Department, Mosul University.
Mosul University, Mosul, Iraq, where he is currently a His research interests include computer architecture &
lecturer. His research interests include computer digital logic design using FPGA technique.
networks analysis and design, real time networks and
systems, embedded network devices and network
security and managements. Dr. Ali has attended and
participates in many scientific activities and invited to
be a member in many respectable organizations such as
IEEE, IENG, ASTF and many others. Currently, he
and has 20 published papers.
Salah Alabady was born in
Mosul, Iraq, on October,1972, he
received the B.Sc. degree in
Electronic and Communications
Engineering from the University
of Mosul, Iraq in 1996, and in
2004 he received the M.Sc. degree
in Computer Engineering from
University of Mosul. From 2004
till now he is being a lecturer in Computer Engineering
Department, Mosul University. His research interests
include optical fiber communications, optical network
architecture, network security and computer networks
design. Alabady gets 10 certifications from Cisco
Network Academy, and he is working as Instructor,
Curriculum Leader, and Legal Main Contact in Mosul
University Regional Academy for Cisco Network
Academy program.