The week's pick
Random Articles
Reseach Article
Algorithms to Optimally Use Hardware Forwarding Resources in a Router Domain
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 4 - Number 11 |
| Year of Publication: 2010 |
| Authors: Dr.T.Bhaskara Reddy, B.G.Prasanthi |
10.5120/870-1222
|
Dr.T.Bhaskara Reddy, B.G.Prasanthi . Algorithms to Optimally Use Hardware Forwarding Resources in a Router Domain. International Journal of Computer Applications. 4, 11 ( August 2010), 13-17. DOI=10.5120/870-1222
Abstract
Routers and Forwarders in a Router domain would likely have different amount of hardware Resources. The least capable switch should not hold the performance of the Router network domain to ransom. This write up lists some smart choices the forwarders and routers in the Router domain can make to most efficiently utilize the hardware forwarding capabilities of each node in the network.
References
- Ben-Shaul I. et al, 2004. Dynamic adaptation and deployment of distributed components in HADAS. The IEEE Transactions on Software Engineering, 27, 9, 769-787.Fu X., 2003. Infrastructure support for accessing network services in dynamic network environments. Phd thesis. NewYork University.
- Gross T. et al, 1999. Adaptive distributed applications on heterogeneous networks. In Proceedings of the 8th Heterogeneous Computing Workshop. 209.Kejariwal A. and Nicolau A., 2005. An Efficient Load Balancing Scheme for Grid-based High Performance Scientific Computing. In Proceedings of the 4th International Symposium on Parallel and Distributed Computing (ISPDC’05).CA. USA. 217- 225.
- Kichkaylo T., 2005. Construction of Component-Based Applications by Planning. Phd thesis. New York University.Kichkaylo T. et al, 2003. Constrained Component Deployment in Wide-Area Networks Using AI Planning Techniques.In Proceedings of International Parallel and Distributed Computing Symposium (IPDPS’03). Nice. France.
- Kichkaylo T. and Karamcheti V., 2004. Optimal resource-aware deployment planning for component-based distributed applications. In Proceedings of 13th IEEE International Symposium on High Performance Distributed Computing.150 – 159.
- Malek S. et al, 2005. A Decentralized Redeployment Algorithm for Improving the Availability of Distributed Systems. In Proceedings of 3rd International Working Conference on Component Deployment (CD‘05). Grenoble. France.Michalewicz Z. and Fogel D. B. 2000. How to solve it: modern heuristics. Berlin: Springer.
- Perttunen M. et al, 2007. A QoS Model for Task-Based Service Composition. 4th International Workshop on Managing Ubiquitous Communications and Services (MUCS 2007), Munich, Germany, 25 May.
- Ranganathan A. and Campbell R., Autonomic Pervasive Computing Based on Planning. In Proceedings of the First International Conference on Autonomic Computing (ICAC'04), 17-19 May 2004, New York, NY, USA, pp. 80-87.Roman M. et al, 2002. “A middleware infrastructure for active spaces”. Pervasive Computing, IEEE, Vol. 1, 4, pp. 74-83.
- Satyanarayanan M., 2001. “Pervasive computing: vision and challenges”, IEEE Pers. Commun., Vol. 8, 4, pp. 10-17.Tanenbaum A. and Maarten S., 2002. Distributed Systems: Principles and Paradigms. Prentice Hall.
- Wang S. et al, 2004. Component Allocation with Multiple Resource Constraints for Large Embedded Real-Time Software Design. In Proceedings of IEEE Symposium on Real-Time and Embedded Technology and Applications(RTAS’04). Toronto. Canada.
Index Terms
Keywords