| Author(s): |
Chen, Xiaomin
;
Chamania, Mohit
;
Jukan, Admela
;
Drummond, Andre C.
;
da Fonseca, Nelson L. S.
;
IEEE
Total Authors: 6
|
| Document type: | Journal article |
| Source: | IEEE INFOCOM 2009 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS; v. N/A, p. 2-pg., 2009-01-01. |
| Abstract | |
We present a multi-path computation algorithm to find a set of paths for the given demand and use Integer Linear Programming (ILP) approach to derive an optimal solution to maximize the achievable bandwidth and minimize the required memory size. We discuss the applicability of the proposed methods in multi-domain settings and present three application schemes in a multi-homing environment. Numerical and simulation results show that the proposed multi-path routing algorithm has better performance in bandwidth as compared to traditional single path routing. Especially the multi-path multidomain application schemes can provision more bandwidth even with partial visibility. Therefore, it can be used as a viable solution to accommodate the emerging high-end applications with extremely high bandwidth requirements in current networks. (AU) | |
| FAPESP's process: | 07/54867-4 - Inter-domain peering and provisioning for the next-generation high capacity networks |
| Grantee: | Nelson Luis Saldanha da Fonseca |
| Support Opportunities: | Regular Research Grants |