A novel architecture for resource management in active networks using a directory service

10th International Conference on Telecommunications, ICT 2003

Volumn 1, Issue , 2003, Pages 45-52

  Sabrina, Fariza ^a   Jha, Sanjay ^a  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

Australia; Bandwidth; Computer architecture; Computer network management; Computer networks; Computer science; Intelligent networks; Load management; Resource management; Scheduling algorithm

Indexed keywords

ACTIVE NETWORKS; BANDWIDTH; COMPUTER ARCHITECTURE; COMPUTER NETWORKS; COMPUTER SCIENCE; ELECTRIC LOAD MANAGEMENT; INTELLIGENT NETWORKS; KNOWLEDGE BASED SYSTEMS; MEMORY ARCHITECTURE; NATURAL RESOURCES MANAGEMENT; NETWORK ARCHITECTURE; NETWORK MANAGEMENT; RESOURCE ALLOCATION; SCHEDULING; SCHEDULING ALGORITHMS;

AUSTRALIA; DIRECTORY SERVICE; INCOMING PACKETS; KNOWLEDGE BASE SYSTEM; NODE RESOURCES; NOVEL ARCHITECTURE; RESOURCE MANAGEMENT; RESOURCE-SCHEDULING;

COMPUTER RESOURCE MANAGEMENT;

EID: 0346468972     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICTEL.2003.1191163     Document Type: Conference Paper

References (21)

1. D. Kiwior and S. Zabele, "Active Resource allocation in Active Networks", IEEE JSAC. 19(3), pp 452 - 459, March 2001.
2. Andrew Campbell, Herman G De Meer, Michael E. Kounavis, "A Survey of Programmable Networks", Center for Telecommunication Research, Columbia university, ACM SIGGCOMM Comp. Commun. Rev., April 1999
3. V. Ramachandran, R. Pandey and S.-H. Chan, "Fair Resource Allocation in Active Networks," Proceedings of the IEEE International Conference on Computer Communications and Networks (ICCCN), pp. 468-475, Las Vegas, Nevada, Oct 16-18, 2000.
4. V. Galtier, K. Mills, Y. Carlinet, "Predicting and Controlling Resource Usage in a Heterogeneous Active Network (2001)," National Institute of Standards 2001
5. Ion Stoica, Scott Shenker, and Hui Zhang. Core-stateless Fair queuen:A Scalable Architecture to Approximate Fair Bandwidth Allocations in High Speed Networks.", SIGCOMM '98
6. M. Shreedhar and George Varghese. "Efficient Fair queueing using Deficit round robin.", SIGCOMM '95, august 1995.
7. A. K. Parekh and R. G. Gallagher. "A generalized processor sharing approach in integrated services networks", INFOCOMM '93, 1993
8. A. Demers, S. Keshav, and S, Shenker. "Analysis and simulation of a fair queueing algorithm", SIGCOMM '89, 1989
9. Vijay Ramachandran, Raju Pandey,"Resource allocation in active networks", Technical report TR-99-10, Parallel and Distributed Computing Laboratory, Computer science Department, University of California, Davis, CA 95616, August 28, 2000
10. Zhenghua Fu, Nalini Venkatasubramanian "Directory Based Composite Routing and Scheduling Policies for Dynamic Multimedia Environments", Proceedings of the IEEE International Parallel and Distributed Processing Symposium 2001 (IPDPS 2001).
11. D. Tenenhouse, J. M. Smith, W. D. Sincoskie, D. J. Wetherall, and G. J. Minden, "A Survey of active network research," IEEE communications Magazine, pp.80-86, Jan 1997.
12. D. Wetherall, U. Legedza, and J. Guttang, "Introducing new internet services:why and how," IEEE Network Magazine, July/August 1998.
13. D. Wetherall, J. Guttang, and D. Tenenhousr, "Ants:A toolkit for building and dynamically deploying network protocols," IEEE OPENARCH 98, San Fransisco, CA, April 1998.
14. K. Calvert, S.Bhattacharjee, E. Zegura, and J. Sterbenz, "Direction in active networks," IEEE communication Magazine, 1998.
15. A. Fernando and B Kummerfeld, "Pants: Python active node transfer system," Tech Rep., University of Sydney, Australia, 1998
16. D. S. Alexander, W. A. Arbaugh, A.D. Keromytis, and J. M. Smith, "A Secure active network environment architecture: Realization in SwitchWare," IEEE network magazine, special issue on Active and programmable networks, pp.29-36, 1998
17. D. J Wetherall, "Service Introduction in An Active networks", PhD thesis, MIT, Feb.1999
18. Kazem Najafi, "Modelling, Routing and architecture in Active Networks," PhD thesis Department of Electrical and computer Engineering, University of Toronto, 2001.
19. Prashanth Pappu and Tilman Wolf, "Scheduling Processing Resources in Programmable Routers", Department of computer science, Washington University in St. Louis, MO, USA, WUCS-01-32, July 25, 2001.
20. Xiaohu Qie, Andy Bavier, Larry Peterson, and Scott and Karlin, " Scheduling computations on a software-based router," in proc. IEEE Joint International Conference on Measurement & Modeling of Computer Systems (SIGMETRICS), Cambridge, MA, June 2001, IEEE.
21. J. C. R. Bennett and H. Zhang. WF Q: "Worst-case Fair Weighted Fair Queueing." In Proceedings of the IEEE INFOCOM, San Francisco, March 1996.