Abstract: We propose a data transmission model in a special topology network in which two players(network nodes) seek to send as many randomly appearing data packets as possible through acommon node. It is assumed that the players do not have complete information about whether theother player has a data packet for possible transfer. For the solution, it is proposed to usecooperative and noncooperative approaches in accordance with which a cooperative solution andNash equilibrium are found. The price of anarchy is calculated to compare the total payoffs of theplayers in the cooperative solution and the Nash equilibrium.