Escolar Documentos
Profissional Documentos
Cultura Documentos
I. I NTRODUCTION
As the Internet continues to grow in size and complexity,
even short time failure can cause enormous inuences on
communications. For this reason, high-speed restoration for
network failures has been attracting more attention, and the
key to realize fast restoration could be reduction of packet
loss in the time from failure occurrence to repair. It is known
that some restoration methods for ring structure networks can
actualize high-speed restoration [1], [2]. In addition, these
methods have a little control messages, because only two
end nodes of a failed communication link can restore the
failure. These failure recovery methods are highly reliable and
have been deployed in commercial networks. However, these
methods work on limited network topologies, i.e. a single ring
or multi-ring structure; therefore, it would be effective if these
methods could be expanded for mesh networks.
On the other hand, some restoration methods focusing on
ring structures (cycles) underlying in a mesh network have
been proposed [3]. These methods can grow the bandwidth
efciency for backup paths by increasing recoverable links of
a single cycle. Thus, the methods expand the size of a cycle
and append recoverable links straddling the cycle. However,
nding cycles with minimizing the bandwidth efciency would
require huge amount of calculation [4]. In order to reduce
the computational complexity, approximate methods have also
been proposed, but cycles obtained by such methods could
cover just a part of links in the entire network. Furthermore,
the optimal cycles tend to include a larger cycle such as the
hamiltonian cycle [9], thus backup paths would be also much
longer.
Previous researches [10], [11] propose a theoretical basis for
network management using fundamental tie-sets which can be
1550-445X/13 $26.00 2013 IEEE
DOI 10.1109/AINA.2013.81
II. R ELATED
WORKS
Fig. 1.
This paper applies a concept of fundamental tie-sets dened by graph theory to failure recovery. A set of vertices
V = {v1 , v2 , , v|V | } denotes network equipment such
as routers and switches. E = {e1 , e2 , , e|E| } represents
links connecting network equipment, and graph G = (V, E)
indicates information network. Because this paper deals with
failure recovery, all graphs are bi-connected. We call a elementary closed path a tie-set and dene a tree T E as
the maximum edge set that include no tie-sets. T = E T
denotes the co-tree of a tree T , and the number of edges |T |
is |E| |T | = |E| |V | + 1. For any e T in graph G, it
is known that T {e} include one fundamental tie-set L, and
the union of fundamental tie-sets obtained from a tree hold all
links in a bi-connected graph. This feature of tie-sets enable
us failure recovery of any link.
Fig. 2.
The proposed method establishes communication tree consisting of communication paths. The communication paths are
paths from each node to one node on the communication
tree. Then, the method produces fundamental tie-sets from
a communication tree, and establishes backup paths from
the fundamental tie-sets. When a link failure occurs on a
communication tree, the proposed method uses a fundamental
tie-set including the failed link. Figure 3 shows an example
of failure recovery that uses tree = {e1 , e3 , e4 , e5 , e8 } and
fundamental tie-sets L1 , L2 , L3 , L4 . If the link e4 failed, tiesets L3 or L4 can detour the failure. Communication messages
passing the failed link e4 toward node v4 will use the backup
path (v3 , v5 , v4 ) when a tie-set L3 is used for recovery.
Counter direction communication messages toward node v3
are transmitted along the backup path (v4 , v5 , v3 ).
299
TABLE I
T REE TABLES OF THE NODE v4 .
Key (destination address)
N1
N2
N3
N4
N5
N6
Output port
p2
p2
p2
p1
p2
p4
TABLE II
T IE - SET TABLES OF THE NODE v4 .
Key (tie-set ID)
L3 Forward
Fig. 3.
L3 Backward
L4 Forward
L4 Backward
Fig. 4.
Action
strip tie-set header
L3 Forward
none
none
none
Output port
p3
p2
p4
p2
Fig. 5.
receives a recovery message that contains an ID of tieset including this node, the node transfers a communication
message referring to its tie-set tables. Otherwise, the node
transfers the message according to its communication path
tables.
D. Tables of a node
Each node contains tables of communication paths and tiesets. A table of a communication path indicates a transfer port
of communication messages in order to reach a destination
address. For example, table I shows the communication path
tables of node v4 in g. 4. A tie-set table indicates a transfer
port of a backup path on a tie-set whose direction is Forward or
Backward. In order to switch communication messages from a
backup path to a communication path, a tie-set table detaches
a recovery message when the link joined to the transfer port
is included in a co-tree. For instance, table II indicates tie-set
tables of the node v4 which belongs to tie-sets L3 and L4 . L3
Forward row of table II detaches a recovery message from a
communication message because port p3 of node v4 connects
to co-tree link e7 .
Figure 5 describes the message transfer process of a node
with its communication path and tie-set tables. When a node
300
TABLE III
O PEN F LOW RULE .
In
Port
VLAN
ID
Src
Ethernet
Dst Type
Src
IP
Dst
Proto
TCP
Src
Dst
Fig. 6.
301
TABLE IV
F LOW
Node
v0
v1
v2
v3
v4
dl
dl
dl
dl
dl
TABLES OF A TREE .
Rules
dst=00:00:00:01:00:01
dst=00:00:00:01:00:01
dst=00:00:00:01:00:01
dst=00:00:00:01:00:01
dst=00:00:00:01:00:01
Actions
output:p1
output:p3
output:p4
output:p3
output:p3
priority
65533
65533
65533
65533
65533
TABLE V
L2 ( DIRECTION IS v4
dl
dl
dl
dl
Rules
vlan ID=v4 v0
vlan ID=v4 v0
vlan ID=v4 v0
vlan ID=v4 v0
Actions
strip vlan,output:p2
output:p3
output:p1
output:p5
TO v0 ).
priority
65534
65534
65534
65534
Actions
priority
mod vlan vid
(ID=v4 v0 ),
v1
dl dst=00:00:00:01:00:01
65534
output:p1
mod vlan vid: modify the VLAN ID eld of Ethernet
header to specied number
Fig. 7.
Rules
B. Results
Figure 8 indicates the number of lost packets in the time
from failure occurrence to repair. In g. 8, the x-axis and the yaxis show the number of nodes and the number of lost packets,
respectively. The number of lost packets remains around 40
packets regardless of the number of nodes. Thus, the proposed
method can restrain the lost packets even on large networks.
Figure 9 describes the number of control messages during
the initialization and the failure recovery. The initialization
is the number of messages required for the construction of
communication and backup paths. On the other hand, the
V. V ERIFICATION EXPERIMENTS
A. Environment and procedure of experiments
We installed an experimental environment on a virtual
machine. The host PC and the guest PC used for experiments
have Windows 7 as host OS, Intel Core i7 960 3.20GHz CPU,
302
Fig. 8.
Fig. 10.
R EFERENCES
Fig. 9.
[1] ITU-T Rec. G.8032, Ethernet Ring Protection Switching, June 2008.
[2] ANSI T1. 105.01-1998, Telecommunications Synchronous Optical Network (SONET) Automatic Protection Switching, Jan. 1998.
[3] M.S. Kiaei, C. Assi and B. Jaumard, A Survey on the p-Cycle Protection
Method, IEEE Communications Surveys & Tutorials, Vol. 11, Issue 3,
pp.5370, 2009.
[4] W.D. Grover and D. Stamatelakis, Cycle-oriented distributed preconguration: ring-like speed with meth-like capacity for self-planning
network restoration, Proc. of IEEE International Conference on Communications, pp.537543, Atlanta, Georgia, USA, June 1998.
[5] W.D. Grover and D. Stamatelakis, Bridging the ring-mesh dichotomy
with p-cycles, Proc. of Design of Reliable Communication Networks,
pp.92104, Munich, Germany, April 2000.
[6] H. Zhang and O. Yang, Finding protection cycles in DWDM networks,
Proc. of IEEE International Conference on Communications, vol.5,
pp.27562760, New York, USA, April 2002.
[7] J. Doucette, D. He, W.D. Grover, O. Yang, Algorithmic approaches
for efcient enumeration of candidate p-cycles and capacitated p-cycle
network design, Proc. of Design of Reliable Communication Networks,
pp.212220, Banff, Alberta, Canada, Oct. 2003.
[8] C. Liu and L. Ruan, Finding good candidate cycles for efcient p-cycle
network design, Proc. of 13th International Conference on Computer
Communication and Networks, pp.321326, Chicago, USA, Oct. 2004.
[9] A. Sack and W. D. Grover, Hamiltonian p-cycles for ber-level
protection in homogeneous and semi-homogeneous optical networks,
IEEE Network, Special Issue on Protection, Restoration, and Disaster
Recovery, Nov./Dec. 2003.
[10] N. Shinomiya, T. Koide and H. Watanabe, A theory of tie-set graph
and its application to information network management, International
J. of Circuit Theory and Applications, Vol.29, No.4, pp.367-379, July
2001.
[11] T. Koide, H. Kubo, and H. Watanabe, A study on the tie-set graph theory
and network ow optimization problems, International J. of Circuit
Theory and Applications, Vol.32, pp.447-470, 2004.
[12] K. Nakayama and N.Shinomiya, Autonomous recovery for link failure
based on tie-sets in information networks, Proc. of 2011 IEEE Symposium on Computers and Communications, pp.671-676, Corfu, Greece,
June 2011.
[13] N. McKeown, T. Anderson, H. Balakrishnan, G. Parulkar, L. Peterson,
J. Rexford, S. Shenker, J. Turner, OpenFlow: Enabling Innovation
in Campus Networks, ACM SIGCOMM Computer Communication
Review, Vol. 38, Issue 2, pp.6974, April 2008.
[14] TremaChttps://github.com/trema
303