Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao https://doi.org/10.1...arrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
https://doi.org/10.1109/inm.20...
Article . 2011 . Peer-reviewed
License: STM Policy #29
Data sources: Crossref
DBLP
Conference object . 2020
Data sources: DBLP
versions View all 2 versions
addClaim

A new method of network bottleneck diagnosis

Authors: Juan Li; Yan Qiao; Xuesong Qiu 0001; Guanjue Wang;

A new method of network bottleneck diagnosis

Abstract

We suggest a method of bottleneck diagnosis with more excellent performance. There are some problems with current diagnosis methods, such as extra network packets and sensitivity to time changes. In this paper, for UDP network, we propose a new method of bottleneck diagnosis based on the concept of network utility maximization. This bottleneck diagnosis method overcomes the disadvantages of current methods, since it totally depends on mathematic models and method, instead of sending and processing large numbers of packets. The problem is modeled as a geometric program problem and the link loss rates are computed by solving the maximization problem. In addition, the method is expanded to random input rates, allowing network managers to control the network performance more flexibly. At last, experiments are carried out to compare the new method with the method proposed by Shetty et al [1]. The results indicate that our method has better performance in both networks with fixed rates and with random rates.

Related Organizations
  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
0
Average
Average
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!