The use of quadratic residue research

Radke, Charles E.

doi:10.1145/362007.362036

Cited by 29 publications

(7 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The obtained hash key (MOD) decides the record's position in the DAD table. According to Radke's suggestions [17], when this prime number m = 4 j + 1, the generated key value will be able to evenly disperse.…”

Section: -Divide Methodsmentioning

confidence: 99%

Fast Duplicate Address Detection for Seamless Inter-Domain Handoff in All-IPv6 Mobile Networks

Wang

Chuang

2006

Wireless Pers Commun

View full text Add to dashboard Cite

In All-IP networks, each computer or communication equipment needs an IP address. To supply enough IP addresses, the new Internet protocol IPv6 will be used in next generation mobile communication. Although IPv6 improves the existing Internet protocol (IPv4), Duplicate Address Detection (DAD) mechanism may consume resources and suffer from long delay. DAD is used to make sure whether the IP address is unique or not. When a mobile node performs an inter-domain handoff, it will first generate a new IP and perform a DAD procedure. The DAD procedure not only wastes time but also increases the signaling load on Internet. In this paper, we propose a new DAD mechanism to speed up the DAD procedure. We create a DAD table in access or mobility routers in All-IP networks and record all IP addresses of the area. When a new IP address needs to perform DAD, it can just search in the DAD table to confirm the uniqueness of the address. Furthermore, we propose a new method, Fast Duplicate Address Detection (Fast DAD), to reduce data search time. Simulation results show that our method outperforms the existing DAD methods.

show abstract

Section: -Divide Methodsmentioning

confidence: 99%

Fast Duplicate Address Detection for Seamless Inter-Domain Handoff in All-IPv6 Mobile Networks

Wang

Chuang

2006

Wireless Pers Commun

View full text Add to dashboard Cite

show abstract

“…From elementary number theory we know that the primeness of n guarantees that for every legal Q we will trace through every table location exactly once in the first n steps. This fact gives the linearquotient method an advantage over the quadratic search type methods, which need modification to cover more than half of the table [4].…”

Section: Evaluation Of the Methodsmentioning

confidence: 99%

The linear quotient hash code

Bell

Kaman

1970

Commun. ACM

View full text Add to dashboard Cite

ER2, the majority are concerned with eonsistency in the NEATERPAR:\IS, if NEATER2 has changed the requosted formatting because of inconsistencies, thn changed format settings are indicated in the numeric output after the error eode. If a parameter is not recognized, the unrecognized portion of the parameter string is reproduced to assist the user in making his correction. About 10 distinct error messages are produced w Inch serve to pinpoint logic errors in the source deck. Performance NotesWe have already remarked that NEATER2 processes a PL/I source deck at 3 to 6 times the speed that the compiler does. This performance was attained by careful choice of PL/I source statements so as to maximize the in-line execution of the compiled program and then to minimize the size and execution time of the compiled program. The source program is long (ca. 1500 statements), but the compiled coding from each statement is typically short as a result of constant revision to optimally tune the program to version 5 of the PL/I compiler. The program gives best results with REORDER specified, and with compilation with OPT = 02. The program CSECT is about 22K bytes; the load module about 39K bytes, and the storage area about 18K bytes; so the whole of NEAT-ER2 should run easily in a 60K byte partition.lost modes of operation of NEATER2 make relatively minor changes in the speed at which it (or, subsequently, the compiler) processes a source deck; so they may be used freely at very little expense. The compiler does process a compressed source deck slightly more rapidly than it processes a logically formatted deck. When USAGE is on, an extensive apparatus to gather usage information is constructed, and marked performance degradation is observed. NEATER2 is slowed about 25 percent, the compiler about 20 percent, and execution about 40 percent when this option is employed.A new method of hash coding is presented and is shown to possess desirable attributes. Specifically, the algorithm is simple, efficient, and exhaustive, while needing little time per probe ond using few probes per lookup. Performance dato and implementation hints are also given.

show abstract

“…A deeper analysis of quadratic searching is performed by Radke [28] in 1970. He shows that there is no advantage in using a general quadratic Ai 2 + Bi + C instead of simply i ~ + C. Subsequent articles by Day 0 5 5 8 549 5 1 17 17 9 689 17 2 45 13 10 845 13 3 89 25 11 1017 25 4 149 21 12 1205 21 5 225 1 13 1409 1 6 317 29 14 1629 29 7 425 9 15 1865 9 Arbitrary constants A = 8, B = 4 Home address C = 5 Memory size M = 32 [10] and Bell [4] expand on this idea, and develop computationally simpler algorithms which cover the entire table.…”

Section: Quadratic Searchingmentioning

confidence: 99%

Identifier Search Mechanisms: A Survey and Generalized Model

Severance

1974

ACM Comput. Surv.

View full text Add to dashboard Cite

Generalized ModelAn important functional component of ever.y file organization is the set of search mechanisms which are used to locate individually identified records during the process of either update or retrieval. There have been a large number of computer-related search techniques developed in the past 20 years. The objective of this article is to synthesize many of these techniques into one parametrically describable search mechanism. This is accomplished by separating search techniques into two categries: addressing techniques, and tree searching techniques. Significant literature is surveyed for each category. The new concept of a TRIE-TREE search mechanism is then introduced, and used to combine these categories via a generalized model. The model has proven to be a pedagogic convenience in explaining the relation between alternative search techniques. It has also been used irk a practical application as a schema for alternative search strategies which are automatically evaluated during the process of a file organization design.

show abstract

The use of quadratic residue research

Cited by 29 publications

References 2 publications

Fast Duplicate Address Detection for Seamless Inter-Domain Handoff in All-IPv6 Mobile Networks

Fast Duplicate Address Detection for Seamless Inter-Domain Handoff in All-IPv6 Mobile Networks

The linear quotient hash code

Identifier Search Mechanisms: A Survey and Generalized Model

Contact Info

Product

Resources

About