|
|
|
|
|
ABSTRACT:
A Network is a set of devices connected by communication links. Network must be able to meet a certain number of criteria. In a network, message can be transmitted from source to sink nodes. The messages are drawn from a specified alphabet. The proposed research work focus on fractional coding for networks in the special case of routing. The routing capacity is the supremum of ratios of message dimensions edge capacity for which a routing solution exists and also we will prove that the routing capacity of every network is achievable and rational. An alternative method to find fractional routing solution is to be developed. When the variety of related properties of fractional routing is used to solve a network, the dimension of the messages need not be same as the capacity of the edges. We will prove fractional routing capacity for some solvable network using cost matrix model.
|
|
|
|
STATISTICS
|
|
Click on # to view
|
|
Citations
|
|
0
|
|
References
|
|
0
|
|
Comments
|
|
0
|
|
Quality
|
|
0/0.00
|
|
Interest
|
|
0/0.00
|
|
View(er)s
|
|
1/103
|
|
|
|
|
|
|
| Prev |
Next |
|
