Bibliographic record
Abstract
From the Publisher: The fundamental technology that supports the Internet and the World WideWeb is addressing. This apparently simple concept is in reality extremely complex and the continuing exponential expansion of address needs has created a serious challenge to the future growth of the Internet. While everyone involved agrees that the current addressing scheme is limited and destined to run out of address space, the advent of such ``new'' technologies as mobility and voice over IP, have exerted even more pressure to motivate change. The proposed solution, IPv6 Addressing is still in the roll-out phase. Now is the time to understand the fundamentals and features of IPv6 Addressing. Although there is no single official document that specifies IPv6 Addressing entirely, there are many Requests for Comments (RFC's) that describe IPv6 Addressing and how it works. This book collects these essential documents in a single printed volume, beginning with a complete overview and introduction to IPv6 Addressing by Peter H. Salus, the RFCs are then presented in chronological order and the entire volume is supported by an extensive index that makes specific information about IPv6 Addressing even easier to locate. All of the important RFCs defining the IPv6 Addressing scheme are collected in this volume. The RFCs offer a complete overview of the current status of addressing, how IPv6 will address the future needs of the Internet and fundamental RFCs detailing how IPv6 Addressing will work. If you buy one IPv6 Addressing reference, this is the one to choose. The individual RFCs were written by members of the Internet Engineering Task Force (IETF), edited and posted to the internet. This compilationof RFCs is the most complete and authoritative IPv6 Addressing reference available. Features: Classless Inter-Domain Routing Mobility Support Neighbor Discovery IPv6 over ATM Networks Author Biography: Peter H. Salus is the Chief Knowledge Officer of Matrix Information and Directory Services. He is the author of A Quarter Century of UNIX (1994) and Casting the Net (1995) and innumerable columns in networking and computer periodicals. He is Editor in Chief of the four volume Handbook of Programming Languages (1998). He has been keynote speaker at the Atlanta Linux Showcase, UniForum Canada, the UKUUG, the NLUUG, the BUUG/OTA, and several other European and North American conferences.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.002 | 0.002 |
| Meta-epidemiology (broad) | 0.002 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.000 |
| Research integrity | 0.002 | 0.003 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; both teacher heads agree on what is shown here.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".