Open Access
Using high level petri nets to
Reads0
Chats0
TLDR
A particular binding is found for the variables sets of these streaming high level Petri graphs in such a way the sink places in the net graph which models the acyclic communication network can be marked with the requested marking.Abstract:
In this paper, we model an acyclic communication network as a net graph, and we use this net graph to define inter session-network coding as high level Petri graph. We then model inter-session network coding as a set of streaming high level Petri net graphs. Finally, we find a particular binding for the variables sets of these streaming high level Petri graphs in such a way the sink places in the net graph which models the acyclic communication network can be marked with the requested marking.read more
Citations
More filters
Journal ArticleDOI
Representing the pairwise intersession network coding by high level petri nets
TL;DR: A new approach to the pairwise inters- ession network coding is introduced, which depends on using high level Petri nets to represent the butterfly network, the grail network, all networks which represent an expansion of the graIL network, and use this representation to determine the solvability of the Pairwise intersession network coding problem.
References
More filters
Journal ArticleDOI
Petri nets: Properties, analysis and applications
TL;DR: The author proceeds with introductory modeling examples, behavioral and structural properties, three methods of analysis, subclasses of Petri nets and their analysis, and one section is devoted to marked graphs, the concurrent system model most amenable to analysis.
Journal ArticleDOI
Network information flow
TL;DR: This work reveals that it is in general not optimal to regard the information to be multicast as a "fluid" which can simply be routed or replicated, and by employing coding at the nodes, which the work refers to as network coding, bandwidth can in general be saved.
Journal ArticleDOI
Linear network coding
TL;DR: This work forms this multicast problem and proves that linear coding suffices to achieve the optimum, which is the max-flow from the source to each receiving node.
Journal ArticleDOI
An algebraic approach to network coding
Ralf Koetter,Muriel Medard +1 more
TL;DR: For the multicast setup it is proved that there exist coding strategies that provide maximally robust networks and that do not require adaptation of the network interior to the failure pattern in question.
Book
Information Theory and Network Coding
TL;DR: This book contains a thorough discussion of the classical topics in information theory together with the first comprehensive treatment of network coding, a subject first emerged under information theory in the mid 1990's that has now diffused into coding theory, computer networks, wireless communications, complexity theory, cryptography, graph theory, etc.