A UPnP-Based Decentralized Service Discovery Improved Algorithm

Author

Yu Shi-Cai ; Yan-Zhi Wu ; Run-Niu Guo

Author_Institution

Sch. of Comput. & Commun., Lanzhou Univ. of Technol., Lanzhou, China

fYear

2013

fDate

21-23 June 2013

Firstpage

1413

Lastpage

1416

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 select 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, it is derived by testing the router and the packet loss rate can be reduced.

Keywords

computer networks; home computing; protocols; telecommunication network routing; UPnP-based decentralized service discovery improved algorithm; delay sending response messages; digital home network; independent response message congestion; message length; packet loss rate; router bandwidth; router testing; simulation analysis; universal plug-and-play; Algorithm design and analysis; Bandwidth; Bismuth; Computers; Educational institutions; Mathematical model; Routing protocols; Best interval Algorithm; Queue size Algorithm; UPnP; drop; service discovery;

fLanguage

English

Publisher

ieee

Conference_Titel

Computational and Information Sciences (ICCIS), 2013 Fifth International Conference on

Conference_Location

Shiyang

Type

conf

DOI

10.1109/ICCIS.2013.373

Filename

6643291