Journal of
Systemics, Cybernetics and Informatics
HOME   |   CURRENT ISSUE   |   PAST ISSUES   |   RELATED PUBLICATIONS   |   SEARCH     CONTACT US
 



ISSN: 1690-4524 (Online)


Peer Reviewed Journal via three different mandatory reviewing processes, since 2006, and, from September 2020, a fourth mandatory peer-editing has been added.

Indexed by
DOAJ (Directory of Open Access Journals)Benefits of supplying DOAJ with metadata:
  • DOAJ's statistics show more than 900 000 page views and 300 000 unique visitors a month to DOAJ from all over the world.
  • Many aggregators, databases, libraries, publishers and search portals collect our free metadata and include it in their products. Examples are Scopus, Serial Solutions and EBSCO.
  • DOAJ is OAI compliant and once an article is in DOAJ, it is automatically harvestable.
  • DOAJ is OpenURL compliant and once an article is in DOAJ, it is automatically linkable.
  • Over 95% of the DOAJ Publisher community said that DOAJ is important for increasing their journal's visibility.
  • DOAJ is often cited as a source of quality, open access journals in research and scholarly publishing circles.
JSCI Supplies DOAJ with Meta Data
, Academic Journals Database, and Google Scholar


Listed in
Cabell Directory of Publishing Opportunities and in Ulrich’s Periodical Directory


Published by
The International Institute of Informatics and Cybernetics


Re-Published in
Academia.edu
(A Community of about 40.000.000 Academics)


Honorary Editorial Advisory Board's Chair
William Lesso (1931-2015)

Editor-in-Chief
Nagib C. Callaos


Sponsored by
The International Institute of
Informatics and Systemics

www.iiis.org
 

Editorial Advisory Board

Quality Assurance

Editors

Journal's Reviewers
Call for Special Articles
 

Description and Aims

Submission of Articles

Areas and Subareas

Information to Contributors

Editorial Peer Review Methodology

Integrating Reviewing Processes


Transdisciplinary Communication as a Meta-Framework of Digital Education
Rusudan Makhachashvili, Ivan Semenist
(pages: 1-6)

Multidisciplinary Learning Using Online Networking in Biomedical Engineering
Shigehiro Hashimoto
(pages: 7-12)

Augmented Intelligence for Advancing Healthcare
Mohammad Ilyas
(pages: 13-19)

A Transdisciplinary Approach to Refereeal
Russell Jay Hendel
(pages: 20-25)

The Impact of Convictions on Interlocking Systems
Teresa Henkle Langness
(pages: 26-33)

Collaborative Convergence: Finding the Language for Trans-Disciplinary Communication to Occur
Cristo Leon, James Lipuma
(pages: 34-37)

Bridging the Gap Between the World of Education and the World of Business via Standards to Develop Competences of the Future at Universities
Paweł Poszytek
(pages: 38-42)

Multidisciplinary Learning for Multifaceted Thinking in Globalized Society
Shigehiro Hashimoto
(pages: 43-48)

From Spirituality to Technontology in Education
Florent Pasquier
(pages: 49-52)

Differentiated Learning and Digital Game Based Learning: The KIDEDU Project
Eleni Tsami
(pages: 53-57)

Emerging Role of Artificial Intelligence
Mohammad Ilyas
(pages: 58-65)

Practicing Transdisciplinarity and Trans-Domain Approaches in Education: Theory of and Communication in Values and Knowledge Education (VaKE)
Jean-Luc Patry
(pages: 66-71)

Reflexive Practice for Inter and Trans Disciplinary Research in the Third Millennium
Maria Grazia Albanesi
(pages: 72-76)


 

Abstracts

 


ABSTRACT


An Ad Hoc Adaptive Hashing Technique forNon-Uniformly Distributed IP Address Lookup in Computer Networks

Christopher Martinez, Wei-Ming Lin


Hashing algorithms long have been widely adopted to design a fast address look-up process which involves a search through a large database to find a record associated with a given key. Hashing algorithms involve transforming a key inside each target data to a hash value hoping that the hashing would render the database a uniform distribution with respect to this new hash value. The close the final distribution is to uniform, the less search time would be required when a query is made. When the database is already key-wise uniformly distributed, any regular hashing algorithm, such as bit-extraction, bit-group XOR, etc., would easily lead to a statistically perfect uniform distribution after the hashing. On the other hand, if records in the database are instead not uniformly distributed as in almost all known practical applications, then even different regular hash functions would lead to very different performance. When the target database has a key with a highly skewed distributed value, performance delivered by regular hashing algorithms usually becomes far from desirable. This paper aims at designing a hashing algorithm to achieve the highest probability in leading to a uniformly distributed hash result from a non-uniformly distributed database. An analytical pre-process on the original database is first performed to extract critical information that would significantly benefit the design of a better hashing algorithm. This process includes sorting on the bits of the key to prioritize the use of them in the XOR hashing sequence, or in simple bit extraction, or even a combination of both. Such an ad hoc hash design is critical to adapting to all real-time situations when there exists a changing (and/or expanding) database with an irregular non-uniform distribution. Significant improvement from simulation results is obtained in randomly generated data as well as real data.

Full Text