Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Khoi Anh Phan

dblp:38/4371 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2008
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Internet architecture and protocols · 87% Network performance modeling · 13%
Software engineering, system software, and programming languages
1 paper
Services computing and microservices · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Internet architecture and protocols › multicast
application-layer multicast
0.112008
Similarity-Based SOAP Multicast Protocol to Reduce Bandwith and Latency in Web Services · IEEE Trans. Serv. Comput. 2008
Internet architecture and protocols
multicast
0.112008
Similarity-Based SOAP Multicast Protocol to Reduce Bandwith and Latency in Web Services · IEEE Trans. Serv. Comput. 2008
Services computing and microservices
web services
0.112008
Similarity-Based SOAP Multicast Protocol to Reduce Bandwith and Latency in Web Services · IEEE Trans. Serv. Comput. 2008

Methods — techniques the papers use, named apart from their topics

message aggregation · 0.2XML indexing · 0.2
YearPublicationVenuePosition
2008 Similarity-Based SOAP Multicast Protocol to Reduce Bandwith and Latency in Web Services
abstract
Web Services technology provided several advantages over other technologies, however it still has serious limitations, including high latency and high protocol overhead. To improve performance, SOAP network traffic needs to be substantially reduced. This paper presents a novel approach, called similarity-based SOAP multicast protocol (SMP), to address the issue of latency. SMP reduces network traffic by aggregating syntactically similar SOAP messages to form a "compact SMP message";. The addresses of clients are encoded as strings in the SMP message header. The similarity of SOAP messages is measured in pairs and is based both on the message template and on the values of each XML tag in the messages. Each XML node in a SOAP message is indexed with an identifier and its position in the SOAP message. Only the indexed form of a SOAP message is sent to clients. Intermediary routers along the paths from server to clients parse the content of each SMP message passing through them and perform necessary operations to forward it to neighbouring routers. Experiments show that SMP can achieve up to 70% reduction in network traffic compared to traditional SOAP unicast.
Khoi Anh Phan, Zahir Tari, Peter Bertók
IEEE Trans. Serv. Comput.1
2007 eSMP: A Multicast Protocol to Minimize SOAP Network Traffic in Low Bandwidth Environments
abstract
Web services, which are built on SOAP as the transport protocol, have emerged in recent years as a promising technology to enable interoperability between distributed applications. As such, SOAP may be used to handle a large number of transactions; and consequently it is desirable to have SOAP perform efficiently in high traffic environments. This paper presents eSMP, an extension of our previous work on a similarity-based SOAP multicast protocol (SMP). eSMP offers improvements over SMP in terms of traffic size by using its own routing protocol instead of the conventional shortest path algorithm to route messages to paths that will minimize the number of bytes transmitted in the network. From extensive experiments, it is shown that eSMP achieves a minimum of 25 percent reduction in total network traffic than SMP with a trade-off of 10 percent increase in average response time. Compared to unicast, bandwidth consumptions can by reduced by up to 80 percent when using eSMP and 70 percent when using SMP. Therefore, eSMP is suitable for applications where bandwidth requirement is critical but not time.
Khoi Anh Phan, Zahir Tari, Peter Bertók
LCN1