Asset Details
Do you wish to reserve the book?
The Reliable, Economic Addition of Functionality to a Network
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
The Reliable, Economic Addition of Functionality to a Network
Do you wish to request the book?
The Reliable, Economic Addition of Functionality to a Network
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
The Reliable, Economic Addition of Functionality to a Network
2024
Overview
In communication and computer networks, the Device Placement Location (DPL) is concerned with locating the placement of the corresponding electronic device (such as Hub, switches, routers... etc.) within certain existing user locations. It considers the cost of the device placement location and routing users. This will involve deciding which user locations will have devices placed at them as well as deciding an assignment of users to device locations. This paper measures the reliability of the DPL and assigns the users to the DPL by building the DPLRC & DPLRC algorithms. In fact, our model is similar in spirit to the DPL COST. However, there is a striking difference between them. Here, the users are assigned to the device locations with maximum of network reliability. It is implemented to run in O (nm log (n2/m)) time. In this paper, we discuss the relationship between device locations, routing users, and the effectiveness of the cost on the increase in the DPLs with the aid of tradeoff curves and tables. We also look at the performance of the algorithms by measuring the CPU time taken to find the DPLs.
Publisher
جامعة بنغازي - كلية الآداب والعلوم بالمرج
