Route selection algorithms for networks with multiple constraints
In this dissertation, we implemented the shortest path algorithms and proposed a multi-constrainted routine algorithm that finds the k-shortest paths or routes with respect to a cost function based on the link weights and constraints.
Saved in:
Main Author: | Luo, Yang. |
---|---|
Other Authors: | Soong, Boon Hee |
Format: | Theses and Dissertations |
Published: |
2008
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/4834 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Similar Items
-
Energy-efficient routing algorithms for ad hoc wireless networks
by: Yuen, Chau.
Published: (2009) -
Efficient algorithms for multicast routing
by: Aw, Claudment Ah Lam
Published: (2009) -
Efficient algorithms for quorumcast routing
by: Chia, Yew Chong.
Published: (2010) -
Routing in ATM network
by: Gao, Yongqian.
Published: (2008) -
Efficient routing algorithms for group multicast communication
by: Wang, Ning.
Published: (2008)