Name
Abstract | ||
|---|---|---|
According to the new features of traffic distribution, a novel forwarding migration algorithm (FMA) is proposed. Programmable routers (PR) are used in FMA. One PR sets FMA bit for unbalanced traffic. Another PR forwards related traffic to the FMA link rather than to wait for matching the longest address prefix. Theoretic analysis shows that FMA can reduce the forwarding burden of core router. Simulation proves that FMA obtains a lower transmission delay and packet loss rate. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/ISPA.2009.58 | ISPA |
Keywords | Field | DocType |
programmable router,multipath transmission,unbalanced traffic,fma link,forwarding migration algorithm,theoretical analysis,forwarding migration,traffic distribution,programmable routers,longest address prefix,telecommunication traffic,telecommunication network routing,distributed processing,jitter,internet,classification algorithms,data mining | Multipath transmission,Computer science,Packet loss rate,Transmission delay,Computer network,Algorithm,Real-time computing,Core router,Jitter,Statistical classification,Distributed computing | Conference |
Volume | Issue | ISBN |
null | null | 978-0-7695-3747-4 |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Laiquan Han | 1 | 5 | 2.96 |
| jinkuan wang | 2 | 94 | 33.64 |
| Jianhua Tang | 3 | 0 | 0.34 |
| Peijun He | 4 | 0 | 0.34 |