Demo Data from EDBT 2026 / reviewers in the wild / expert
Ichiro Iida
dblp:14/6007
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 1989
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 1 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer networks
1 paper |
Wireless networking · 91% Internet architecture and protocols · 9% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Wireless networking › medium access control › carrier sense multiple access
CSMA/CD |
0.0 | 1 | 1983 | Modified CSMA/CD Local Area Network with Message-Based Priority Function · INFOCOM 1983 |
Wireless networking
medium access control |
0.0 | 1 | 1983 | Modified CSMA/CD Local Area Network with Message-Based Priority Function · INFOCOM 1983 |
Wireless networking › wireless multimedia › qos support
priority access |
0.0 | 1 | 1983 | Modified CSMA/CD Local Area Network with Message-Based Priority Function · INFOCOM 1983 |
Internet architecture and protocols
local area network |
0.0 | 1 | 1983 | Modified CSMA/CD Local Area Network with Message-Based Priority Function · INFOCOM 1983 |
Methods — techniques the papers use, named apart from their topics
protocol design · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1989 | Autonomous routing scheme for large scale network based on neural processingabstractThe authors discuss an autonomous routing scheme (called Holonic Routing) for large-scale networks that uses the principle of neural networks. In this scheme each node computes the optimal route whenever it tries to transmit a packet; thus the network can always maintain a balanced load, providing maximum transmission capacity in response to changes in traffic and topology. Because the routing procedure is packet by packet, even if a failure occurs in transit the packet will automatically be routed to avoid failed parts. Thus, a reliable nonstop network can be easily constructed using this scheme. The scheme is especially suitable for multimedia networks where large capacity and high reliability are needed.> Ichiro Iida, Akira Chugo, Reigo Yatsuboshi |
SMC | 1 |
| 1983 | Modified CSMA/CD Local Area Network with Message-Based Priority Function
Ichiro Iida, Yasuhiko Yasuda, Yushi Komachi |
INFOCOM | 1 |