Svoboda | Graniru | BBC Russia | Golosameriki | Facebook

To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

4,5
Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Added in 24 Hours
Languages
Recent
Show all languages
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.
.
Leo
Newton
Brights
Milds

From Wikipedia, the free encyclopedia

Farouk Kamoun
BornOctober 20, 1946 (1946-10-20) (age 77)
CitizenshipTunisian
Known forHierarchical routing optimal number
Scientific career
FieldsComputer Science
InstitutionsENSI
Doctoral advisorLeonard Kleinrock

Farouk Kamoun (born October 20, 1946) is a Tunisian computer scientist and professor of computer science at the National School of Computer Sciences (ENSI) of Manouba University, Tunisia. He contributed in the late 1970s to significant research in the field of computer networking in relation with the first ARPANET network. He is also one of the pioneers of the development of the Internet in Tunisia in the early 1990s.

YouTube Encyclopedic

  • 1/2
    Views:
    517
    3 377
  • +2 CA Chapter 10 Introduction to Computer Networks
  • 12th Computer Application | Chapter - 10 | Online Class | EM | Computer Network | Aakkam Asma ..

Transcription

Contribution to computer science

The contribution of Dr. Kamoun in the domain of hierarchical routing begun in 1979 with his professor at the University of California UCLA, Leonard Kleinrock. They argued that the optimal number of levels for an router subnet is , requiring a total of entries per router. They also shown that the increase in effective mean path length caused by hierarchical routing is sufficiently small that it is usually acceptable.

The research work driven on Tunisia in the 1980s on network flow control based on buffer management is considered as a base to the now selective reject algorithms used in the Internet.

Education and career

He received a French engineering degree in 1970, a Master's and a PhD degree from the University of California at Los Angeles Computer Science Department. His PhD work, undertaken under the supervision of Dr Leonard Kleinrock, a pioneer in the area of networking, was related to the design of large computer networks. They were among the first to introduce and evaluate cluster-based hierarchical routing. Results obtained then are still very relevant and have recently inspired considerable work in the area of ad hoc networking.[1][2]

He returned to Tunisia in 1976 and was given the task to create and chair the first Computer Science School of the country (ENSI). From 1982 to 1993, he chaired the CNI, Centre National de l'Informatique, a Government Office in charge of IT policies and strategic development.

He promoted the field of networking in Tunisia, through the organization of several national conferences and workshops dealing with networks. As chairman of CNI, he represented Tunisia at the general assembly and executive board meetings of the Intergovernmental Bureau for Informatics (IBI) in Rome, in the '80s, as well as those of the UNESCO IT Intergovernmental Committee, with a focus on issues related to developing countries.

From 1993 till 1999, he served as Dean of ENSI, Ecole Nationale des Sciences de l'Informatique, a School of Engineering dedicated to the training of computer engineers. Since 1999, he continue teaching and serve as director of the CRISTAL Research Laboratory of the ENSI. He is also an advisor in IT fields to the Tunisian minister of Higher Education, Scientific Research and Technology.[3]

External links

References

  1. ^ Davies, Donald Watts (1979). Computer networks and their protocols. Internet Archive. Wiley. pp. 110–111. ISBN 978-0-471-99750-4.
  2. ^ Feldmann, Anja; Cittadini, Luca; Mühlbauer, Wolfgang; Bush, Randy; Maennel, Olaf (2009). "HAIR: hierarchical architecture for internet routing" (PDF). Proceedings of the 2009 workshop on Re-architecting the internet. ReArch '09. New York, NY, USA: Association for Computing Machinery: 43–48. doi:10.1145/1658978.1658990. ISBN 978-1-60558-749-3. The hierarchical approach is further motivated by theoretical results (e.g., [16]) which show that, by optimally placing separators, i.e., elements that connect levels in the hierarchy, tremendous gain can be achieved in terms of both routing table size and update message churn. ... [16] KLEINROCK, L., AND KAMOUN, F. Hierarchical routing for large networks: Performance evaluation and optimization. Computer Networks (1977).
  3. ^ "Les étudiants de Gabès à New York pour défendre les couleurs de la Tunisie à la finale Imagine Cup". Businessnews (in French). Tunisia. 8 May 2011. Retrieved 25 July 2012.
This page was last edited on 24 November 2023, at 19:07
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.