- 60 - 
LIST OF REFERENCES 
 
 
[1] ITU, Second ITU Forum of the Regional Working Group on Private Sector 
Issues, International Telecommunication Union, New Delhi, India, 26 - 27 
April 2004 
 
[2] Michael Carter, Julian Wright, Bargaining over Interconnection: The Clear-
Telecom Dispute, The Economic Society of Australia, 1999. 
 
[3] T. Theis, "The future of Interconnection Technology," IBM Journal of 
Research and Development, Vol. 44, No. 3, May 2000, pp. 379-390. 
 
[4] G. Huston, "Interconnection, peering, and settlements," in Proc. INET, June 
1999. 
 
[5] Kenneth J. Turner, Structuring Telecommunications Features,  Department of 
Computing Science and Mathematics, University of Sterling, 2001. 
 
[6] Matthew Walker, Introduction to Genetic Programming, Massey University, 
2001. 
 
[7] N.Rajkumar, Timo Vekara, Jarmo T. Alander, A Review of Applications of 
Genetic Algorithms to Power Systems. University of Vaasa, Finland, 2003. 
 
[8] Bijan KHosraviani, Raymond E. Levitt, and John R. Koza, Organization 
Design Optimization Using Genetic Programming , Stanford University, 2005 
 
[9] Abdel-Rahman Hedar, Bun Theang Ong, and Masao Fukushima, Genetic 
Algorithms with Automatic Accelerated Termination, Kyoto University, Japan, 
2007.  
 
- 61 - 
[10] Wikipedia, “Genetic Algorithm”, [Online] Available: 
http://en.wikipedia.org/wiki/Genetic_algorithm. [Accessed: February, 2007]. 
 
[11] Genetic Programming Inc., “Genetic-Programming”, [Online] Available: 
http://www.genetic-programming.org. [Accessed: February , 2007] 
 
[12] Rohit Kumar, A Genetic Algorithm for Unit Selection based Speech Synthesis, 
Language Technologies Research Center, International Institute of Information 
Technology, Hyderabad INDIA, 2004 
 
[13] Wikipedia, “Least Cost Routing”, [Online]. Available: 
http://en.wikipedia.org/wiki/LCR. [Accessed: July, 2007] 
 
[14]  Jordi Castro, Antonio Frangioni, A Parallel Implementation of an Interior-
Point Algorithm for Multi commodity Network Flows, Vol. 1981, Springer-
Verlag  London, UK, Pages: 301 - 315    
 
[15] Peer Hasselmeyer, A Novel Architecture for Dynamic Least Cost Routing, 
Information technology Transfer Office, Darmstadt University of Technology, 
Germany, 2000 
 
[16] Maria Koutsopoulou et al, Charging, Billing & Accounting in a multi-
Operator and multi-Service Provider Environment, University of Pittsburgh, 
1998 
 
[17] International Telecommunication Union, “International Telecommunication 
Union”, International Telecommunication Union, [Online]. Available: 
http://www.itu.int/net/home/index.aspx. [Accessed: August, 2007] 
 
[18] Asia Pacific Telecom Research Ltd, “Asia Pacific Telecom Research Ltd. 
Asia's leading source of telecom intelligence”, Asia Pacific Telecom Research 
Ltd, [Online]. Available: http://www.aptr.info/index.htm. [Accessed: August, 
2007] 
 
- 62 - 
[19] CARRIERS-interconnect, “The complete telecom wholesale Business 
solution”, CARRIERS-interconnect – The complete telecom wholesale 
Business solution, [Online]. Available: http://www.carriers-
interconnect.com/eng_inicio.html. [Accessed: August, 2007] 
 
[20] Interconnect-Telecommunication Corporation, “Inter-Connect 
Telecommunications”, Inter-Connect Telecommunications -Texas, USA, 
[Online]. Available: http://www.interconnect-telcom.com/index.html. 
[Accessed: August, 2007] 
 
[21] Intec Telecom Systems, “Intec Telecom Systems PLC, London, UK”, Intec 
Telecom Systems, [Online]. Available: http://www.intec-telecom-systems.com 
[Accessed: August, 2007] 
 
[22] World Bank, Telecommunications Regulation Handbook: Interconnection, 
Washington, USA: World Bank, 2000. [E-book] Available: World Bank. 
 
[23] World Bank, A Model for Calculating Interconnection Costs in 
Telecommunications, Washington, USA: World Bank, 2004. [E-book] 
Available: World Bank. 
 
[24] D. Frigioni, T. Miller, U. Nanni, and C. Zaroliagis, An experimental study of 
dynamic algorithms for transitive closure, Max Planck Institute for 
Informatics, Stadtwald, Germany, 1997. 
 
[25] D. Frigioni, M. Ioffreda, U. Nanni, and G. Pasqualone, Experimental analysis 
of dynamic algorithms for the single source shortest path problem, Max 
Planck Institute for Informatics, Stadtwald, Germany, 1997.