Balancing throughput and delay performance by effective shortest path routing

Authors:
Nagi-Ki Fong;Fan Yan;Kai-Hau Yeung
Affiliations:
City University of Hong Kong, Department of Electronic Engineering, Hong Kong S.A.R.;City University of Hong Kong, Department of Electronic Engineering, Hong Kong S.A.R.;City University of Hong Kong, Department of Electronic Engineering, Hong Kong S.A.R.
Venue:
AIC'09 Proceedings of the 9th WSEAS international conference on Applied informatics and communications
Year:
2009

Citing 5
Cited 1

On power-law relationships of the Internet topology

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Graph structure in the Web

Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
An Incremental Procedure for Improving Path Assignment in a Telecommunications Network

Journal of Heuristics
A Comparison of Heuristics for the Discrete Cost Multicommodity Network Optimization Problem

Journal of Heuristics
Optimizing OSPF/IS-IS weights in a changing world

IEEE Journal on Selected Areas in Communications

Methodology for SIP infrastructure performance testing

WSEAS Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, effective shortest path routing algorithm is proposed to balance the throughput and delay performance in the scale free networks. The model under packet retransmission condition is created to model the some protocols, like TCP, more accurately. The ESP is compared to other routing algorithms, such as shortest path first and optimal routing. The result shows ESP has better throughput than SPF does and less delay than OR does.