|
|
|
|
a novel most reliable path problem for data transmission
|
|
|
|
|
|
|
|
نویسنده
|
tayyebi javad ,kazemi seyyed mohammad reza
|
|
منبع
|
دوازدهمين همايش ملي رياضي دانشگاه پيام نور - 1404 - دوره : 12 - دوازدهمين همايش ملی ریاضی دانشگاه پيام نور - کد همایش: 04250-24418 - صفحه:0 -0
|
|
چکیده
|
Reliable data transmission is crucial for efficient computer networks. this paper proposes a new approach to finding the most reliable path, considering factors like reliability, distance, and capacity of network links. it also takes into account the volume of data being transmitted. due to the dynamic and distributed nature of networks, efficient algorithms for finding suitable paths are essential. this paper presents a novel algorithm that solves this problem in polynomial time.
|
|
کلیدواژه
|
algorithm ,reliability ,routing ,data transmission ,computer networks
|
|
آدرس
|
, iran, , iran
|
|
پست الکترونیکی
|
kazemi@birjandut.ac.ir
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|