A UPnP-based Decentralized Service Discovery Improved Algorithm

Authors

Yu Shi-cai
School of Computer and Communication Lanzhou University of Technology
Wu Yan-zhi
School of Computer and Communication Lanzhou University of Technology
Guo Run-niu
DOI: https://doi.org/10.52549/ijeei.v1i1.46
Download PDF
Published: 12-03-2013 • Issue: Vol. 1 No. 1: March 2013 • Section: Computer_&_Informatics

Abstract

The current UPnP service discovery algorithm in the presence of the service can cause severe drops in the digital home network. The reason is that the root devices instantly send delay sending response messages and randomly selected independent response message congestion through simulation analysis. To solve these problems, an improved UPnP service discovery algorithm was given. Considering the length of the message and the bandwidth of the router, derived by testing the router the packet loss rate can be reduced
Keywords: drop; service discovery; UPnP; Queue size Algorithm; Best interval Algorithm

How to Cite

[1]
Y. Shi-cai, W. Yan-zhi, and G. Run-niu, “A UPnP-based Decentralized Service Discovery Improved Algorithm”, IJEEI, vol. 1, no. 1, pp. 21–26, Mar. 2013, doi: 10.52549/ijeei.v1i1.46.