Ms.E.Pandiyammal1,
Mr.P.N.Karthikayan2
1PG student- Department of CSE - Vellammal college of
Engineering and technology, Madurai, Tamilnadu, India.
2Assistant Professor - Department of CSE- Vellammal
college of Engineering and technology, Madurai, Tamilnadu,
India.
In network, multiple paths are existing
between source and destination. Source splits the traffic among its entire
available path. But how we achieve the lowest transmission rate per unit time
is a problem here. If any traffic terminus between two nodes then consumes the
reverse path for packet transmission. This type of packet transmission method
is called as “REVERSE CARPOOLING”. And also the reverse path is called as “HYPERLINKS”.
In reverse carpooling technique, use the longer paths at lowest cost by
conveying a hyperlink capacity to each node. Conversely there is a strange situation among sources (i.e.) if there is
traffic in both directions of a shared path, deliberate as a problem of routing
with network coding. By conveying a hyperlink capacity, permitting
sources to split their traffic selfishly in a scattered fashion, and then
altering the hyperlink capacity based on user actions. Additionally, each
hyperlink has a scheduling restriction in terms of the maximum number of
transmissions allowed per unit time.
