عنوان البحث(Papers / Research Title)
Design a Petri Net model for Wormhole routing packet
الناشر \ المحرر \ الكاتب (Author / Editor / Publisher)
عباس محسن عبد الحسين البكري
Citation Information
عباس,محسن,عبد,الحسين,البكري ,Design a Petri Net model for Wormhole routing packet , Time 6/20/2011 8:26:34 AM : كلية تكنولوجيا المعلومات
وصف الابستركت (Abstract)
Design a Petri Net model for Wormhole routing packet
الوصف الكامل (Full Abstract)
Design a Petri Net model for Wormhole routing packet
Dr. Abbas M. Al- Bakry Babylon University College of science / Dep. Of Computer science
Email: abbasmoh67@yahoo.com
ABSTRACT:-
In order to check the reliability of moving the wormhole packet from source to destination in a communication network , we need a model that provide a dynamic behavior for this moving. The only one model having this facility is Petri Nets. The dynamic behavior provides by the Petri Net describe briefly wormhole routing packet as in real.
KEYWORDS:-Petri net, wormhole, packet, liveness, bounded, place, token .
INTRODUCTION:-
The implementation principle technique is how to choose a suitable modeling approach which can give a good view for the designer to operate (him/her) design as in real life. Petri Nets can be used for modeling many designs by their properties which can give to the design many facilities. Liveness one of the most properties can be used with communication protocols[Alb03].
Wormhole packet is one of the packet types, having a head, body and tail. This type of packed similar to the wormhole in it s moving. In this work we to design a Petri net model for the wormhole routing packet. What are Petri Nets?[3,6]
A Petri net may de defined by five tuples , PN(P,T,F,W,M0) where:P={p1,p2,…,pm} is a finite set of places,T={t1,t2,…,tn} is a finite set of transitions,F (PXT) U (TXP) is a set of arcs (flow relations),W: F {1,2,3,…} is a weight function,M0: P {0,1,2,….} is the initial marking,P ? T= ? and P U T ? ?
A Petri net may de defined by five tuples , PN(P,T,F,W,M0) where:P={p1,p2,…,pm} is a finite set of places,T={t1,t2,…,tn} is a finite set of transitions,F (PXT) U (TXP) is a set of arcs (flow relations),W: F {1,2,3,…} is a weight function,M0: P {0,1,2,….} is the initial marking,P ? T= ? and P U T ? ? A Petri net structure N=(P,T,F,W) without any specific initial marking is denoted by N.A Petri net with the given initial marking is denoted by (N,M0). In order to simulate the dynamic behavior of a system state or marking in a Petri net is changed according to the following transition (firing) rules:
1- a transition is said to be enabled if each input place P of t is marked with at least w(p, t) tokens where w(p, t) is the weight of the arc from p to t.2- an enabled transition may or may not fire (depending on weather or not the event is actually takes place).3- A firing of enabled transition t removes w(p, t) tokens from each input place p of t, and adds w(t, p) tokens to each output place p of t, where w(t, p) is the weight of arc from t to p.
A transition without any input place called a source transition and one without any output place is called sink transition. Source transition is unconditionally enabled, and the firing of sink transition consumes tokens but does not produce any. A pair of a place p and transition t called self-loop if p is both an input and output place of t. A Petri net is said to be pure if it has no self loop. A Petri net is said to be ordinary if all of its arc weights are 1 s.
Dear visitor , For downloading the full version of the research/article click on the pdf icon above
تحميل الملف المرفق Download Attached File
|
|