Pith. sign in

REVIEW 24 references

MIN: Co-Governing Multi-Identifier Network Architecture and its Prototype on Operator's Network

T0 review · reviewed 2026-08-14 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read A multi-identifier internet architecture with blockchain-based governance and a hash-prefix-tree forwarding table is proposed and prototyped, but scaling claims exceed the measured 20-node, 3.5-billion-entry tests.

arxiv 1908.00418 v1 pith:3OBBD5T6 submitted 2019-08-01 cs.NI

Hui Li , Jiangxing Wu , Xin Yang , Han Wang , Julong Lan , Ke Xu , Yunyong Zhang , Jinwu Wei
show 23 more authors
Shisheng Chen Wei Liang Fusheng Zhu Yiqin Lu Wai Ho Mow Yeung Wai-Ho Zefeng Zheng Peng Yi Xinsheng Ji Qinrang Liu Wei Li Kaiyan Tian Jiang Zhu Jiaxing Song Yijun Liu Junfeng Ma Jiawei Hu Rui Xu Jiansen Huang Guohua Wei Jiuhua Qi Ting Huang Kaixuan Xing
This is my paper · ORCID
classification cs.NI
keywords networkaddressco-governingalgorithmarchitectureconsensusfurtheridentifiers
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper proposes MIN, a new internet architecture that lets several kinds of identifiers live together at the network layer: who you are (identity), what you want (content), where things are (geographic information), and the existing IP address. Today, IP addresses do both locating and identifying, and a single authority manages addresses and names. MIN uses a consortium blockchain, a shared ledger run by many organizations, to register and manage these identifiers jointly, reducing the risk of one organization having too much control.

The authors built a prototype and put it on real operator networks in mainland China, Hong Kong, and Macau. They report three technical pieces: a voting-based blockchain consensus called APoV, a forwarding table called HPT-FIB that mixes a hash table with a prefix tree to translate between identifier types, and a way to send ordinary IP packets through a content-centric network as a tunnel. They measured that their 20-node blockchain can handle more than 300,000 transactions per second, and that the forwarding table can store billions of names, though the largest experiment used 3.5 billion generated names. Video-on-demand ran through the network at 0.65 to 2.65 MB per second.

Extended reading notes

Core claim

The paper states in the Abstract that 'we deployed the prototype of MIN to the largest operators' network in Mainland China, Hongkong and Macao, and demonstrated that the network can register identifier under co-governing consensus algorithm, support VoD service very well.' On the data plane, it claims HPT-FIB 'can inter-translate different identifiers with tens of billions of entries' and that APoV 'can achieve a stable throughput of more than 300 thousand transactions per second.' If true, MIN is a workable post-IP architecture with decentralized management and large-scale multi-identifier forwarding.

Load-bearing premise

The load-bearing assumption is that the polynomial fits in Equations (6) and (7), measured on a prototype with 3-8 blockchain nodes and two servers, extrapolate to 'hundreds or thousands of nodes' and to 'tens of billions of entries.' The HPT-FIB experiments run only up to 3.5 billion synthetic names, and the lookup tests use 5 million entries. If the scaling laws break down, the throughput and capacity claims collapse even if the prototype itself works.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Assumptions & free parameters 4 free parameters · 4 assumptions · 4 invented entities

The paper's quantitative claims rely on measured fits and synthetic data. The consensus throughput model depends on fitted polynomial coefficients, and the FIB scalability results depend on an undisclosed name-generation simulation. The architecture components are novel constructs without independent external validation.

free parameters (4)
  • Equation (6) coefficients = t1_comp=0.0041n+0.0174; t2_comp=0.0130n+0.0229; t3_comp=0.0012n^2-0.0082n+0.0415; t4_comp=0.0052n+0.0062
    Fitted to Table 1 measurements from a 2-server prototype; used to derive theoretical throughput limits.
  • Equation (7) consensus time coefficients = 0.0312 n^3 - 0.1920 n^2 + 2.0714 n + 11.2500 over 125
    Cubic fit to measured consensus times; used as basis for computation time extraction and throughput model.
  • URL-like name simulation parameters = not given
    The FIB scalability data is generated from 'statistical features from the current network flow' but the simulation parameters are not stated, so the runtime figures are not reproducible.
  • content-name length parameter rho(N;lambda-bar) = M=4,5 in HIT tests
    Test parameter, not a fit, but affects lookup results.
assumptions (4)
  • domain assumption Consortium blockchain with voting consensus can manage identifiers at high throughput while remaining decentralized.
    Core design premise of the management plane; no security or liveness proof is given.
  • ad hoc to paper The fitted polynomial equations generalize to arbitrary n and computing power a.
    Equations (6)-(12) extrapolate from measurements at n=3..8 to 'hundreds or thousands of nodes' without theoretical justification.
  • domain assumption CCN can be deployed directly on Ethernet MAC and used to carry IP packets via a tunnel without IP.
    Needed for the IP-CCN-IP progressive-deployment scheme; feasibility shown only in the small prototype.
  • ad hoc to paper Self-generated URL-like names reproduce the statistical properties of real CCN content names.
    The FIB benchmark uses this assumption; no real CCN dataset is available.
invented entities (4)
  • MIN (Multi-Identifier Network) architecture
    purpose: Network layer with parallel coexistence of identity, content, geographic, and IP identifiers.
    Only evidence is the in-paper prototype; no outside deployment or independent evaluation.
  • APoV (Advanced Proof of Vote) consensus
    purpose: Co-governing identifier registration and management via voted consortium blockchain.
    Described at protocol level and measured on up to 20 nodes; no formal proof of non-forking or external review.
  • HPT-FIB with virtual and semi-virtual entries
    purpose: FIB that combines hash table and prefix tree to avoid false negatives in binary search and inter-translate identifiers.
    Tested on synthetic names up to 3.5 billion entries; no public code or real-world dataset.
  • IP-CCN-IP tunnel scheme
    purpose: Transport IP packets over CCN for incremental deployment.
    Measured on the prototype network; rates (0.65-2.65 MB/s) are modest.

how reviews work

0 comments
Cite this review

Pith. "Pith review of MIN: Co-Governing Multi-Identifier Network Architecture and its Prototype on Operator's Network." pith.science (2026). https://pith.science/paper/3OBBD5T6

@misc{pith2026190800418,
  author       = {Pith},
  title        = {Pith review of: MIN: Co-Governing Multi-Identifier Network Architecture and its Prototype on Operator's Network},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/3OBBD5T6}},
  note         = {Machine review of arXiv:1908.00418}
}
read the original abstract

IP protocol is the core of TCP/IP network layer. However, since IP address and its Domain Name are allocated and managed by a single agency, there are risks of centralization. The semantic overload of IP address also reduces its scalability and mobility, which further hinders the security. This paper proposes a co-governing Multi-Identifier Network (MIN) architecture that constructs a network layer with parallel coexistence of multiple identifiers, including identity, content, geographic information, and IP address. On the management plane, we develop an efficient management system using consortium blockchain with voting consensus, so the network can simultaneously manage and support by hundreds or thousands of nodes with high throughput. On the data plane, we propose an algorithm merging hash table and prefix tree (HTP) for FIB, which avoids the false-negative error and can inter-translate different identifiers with tens of billions of entries. Further, we propose a scheme to transport IP packets using CCN as a tunnel for supporting progressive deployment. We deployed the prototype of MIN to the largest operators' network in Mainland China, Hongkong and Macao, and demonstrated that the network can register identifier under co-governing consensus algorithm, support VoD service very well.

Figures

Figures reproduced from arXiv: 1908.00418 by the authors.

Figure 1
Figure 1. Protocol Architecture of MIN Œe network hierarchy of MIN is shown in [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. Network hierarchy of MIN Œe function of a complete node in the network is to par￾ticipate in the intra-domain management of users and the registration process of identi€ers on the blockchain, as well as provide inter-translation and resolution services (in this case called Multi-Identi€er Router, MIR). Also, there are supervisory nodes, individual users, and enterprise users. Supervisory nodes are set up as the data… view at source ↗
Figure 3
Figure 3. Consensus Process of APoV Each round of the APoV consensus consists of the follow￾ing steps. S1: Each bookkeeping node generates a block and pub￾lishes it to the network. Each blockchain node collects all the blocks in this step [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗
Figures from the paper (7 more)
Figure 4
Figure 4. Figure 4: ‡e HPT-FIB Combining Hash Table and Pre- [PITH_FULL_IMAGE:figures/full_fig_p005_4.png]
Figure 5
Figure 5. Figure 5: ‡e Schematic Diagram of IP-CCN-IP Trans [PITH_FULL_IMAGE:figures/full_fig_p007_5.png]
Figure 6
Figure 6. Figure 6: Connection Establishment of IP-CCN-IP Transmission Connection Termination: Œe four-way handshake of connection termination between the two TCP ends is modi€ed to the four-way Interest packet switches. Œe logic of Interest packets switching in this process is similar to…
Figure 7
Figure 7. Figure 7: ‡e Inƒuence of Node Number n, Computing Power a and Bandwidth band on the Upper Limit of ‡roughput in the APoV Blockchain about eciency and security. In contrast, binary search re￾duces the computational overhead of the LPM algorithm to the logarithmic level, which si…
Figure 8
Figure 8. Figure 8: Topology of the Prototype PKUSZ— 4 Servers China Telecom Shenzhen Backbone Network Environment China Telecom Futian 4 Servers node 9 pkusz 1 node1 node3 IP CCN node2 IP node10 node11 node14 CCN [PITH_FULL_IMAGE:figures/full_fig_p012_8.png]
Figure 9
Figure 9. Figure 9: ‡e Detailed Topology and the Experimental [PITH_FULL_IMAGE:figures/full_fig_p012_9.png]
Figure 11
Figure 11. Figure 11: ‡e Experimental Result (Pull tonode9 from pkusz1 and pkusz3 Simultaneously) [20] Hequan Wu. 2019. Reƒections on the Reform of Network Architecture. ZTE TECHNOLOGY JOURNAL 25, 1 (2019). [21] Lixia Zhang, Deborah Estrin, Je‚rey Burke, Van Jacobson, James D Œornton, Dian…

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

24 extracted references · 24 canonical work pages

  1. [1]

    Muneeb Ali, Jude Nelson, Ryan Shea, and Michael J Freedman

    work page

  2. [2]

    Brendan Benshoof, Andrew Rosen, Anu G Bourgeois, and Robert W Harrison. 2016. Distributed decentralized domain name service. In IEEE International Parallel and Distributed Processing Symposium Work- shops (IPDPSW). 1279–1287

    work page 2016

  3. [3]

    Christian Cachin. 2016. Architecture of the hyperledger blockchain fabric. In Workshop on distributed cryptocurrencies and consensus ledgers, Vol. 310. 4

    work page 2016

  4. [4]

    Miguel Castro, Barbara Liskov, et al. 1999. Practical Byzantine fault tolerance. In OSDI, Vol. 99. 173–186

    work page 1999

  5. [5]

    Weihua Cheng. 2015. A/t_tack Mode and Defense Strategy of DNS Cache Pollution. TELECOMMUNICATIONS INFORMATION 9 (2015), 16–21

    work page 2015

  6. [6]

    Anastasius Gavras, Arto Karila, Serge Fdida, Martin May, and Martin Po/t_ts. 2007. Future internet research and experimentation: the FIRE initiative. ACM SIGCOMM Computer Communication Review (2007), 89–92

    work page 2007

  7. [7]

    Van Jacobson, Diana K Sme/t_ters, James D /T_hornton, Michael F Plass, Nicholas H Briggs, and Rebecca L Braynard. 2009. Networking named content. In Proceedings of the 5th international conference on Emerging networking experiments and technologies . ACM, 1–12

    work page 2009

  8. [8]

    Aggelos Kiayias, Alexander Russell, Bernardo David, and Roman Oliynykov. 2017. Ouroboros: A provably secure proof-of-stake blockchain protocol. In Annual International Cryptology Conference. Springer, 357–388

    work page 2017

Show all 24 references
  1. [9]

    Sunny King and Sco/t_t Nadal. 2012. Ppcoin: Peer-to-peer crypto- currency with proof-of-stake. self-published paper, August 19 (2012)

    2012

  2. [10]

    Hui Li, Kejiao Li, Yongle Chen, Jiawei Cai, Peng Yi, Zhihao Huang, Beini Zhou, Xin Li, and Jiyang Zhang. 2018. Determining consensus in a decentralized domain name system. US Patent App. 15/997,710. Conference’17, July 2017, Washington, DC, USA The Hong Kong Univ. of Science a...

    2018

  3. [11]

    Hui Li, Xiangui Wang, Zhili Lin, Jiangxing Wu, Xueming Si, Kedan Li, Xin Yang, and Han Wang. 2019. Systems and methods for managing top-level domain names using consortium blockchain. US10178069B2

    2019

  4. [12]

    Kejiao Li, Hui Li, Hanxu Hou, Kedan Li, and Yongle Chen. 2017. Proof of vote: A high-performance consensus protocol based on vote mech- anism & consortium blockchain. In IEEE 19th International Conference on High Performance Computing and Communications (HPCC) . 466– 473

    2017

  5. [13]

    Andreas Loibl and J Naab. 2014. Namecoin. namecoin. info (2014). h/t_tps://Namecoin.info

    2014

  6. [14]

    Satoshi Nakamoto et al. 2008. Bitcoin: A peer-to-peer electronic cash system. (2008). PKUSZ— 4 Servers China Telecom Nanshan 4 Servers node 9 node11 node10 node14 pkusz 3 IP IP China Telecom Shenzhen Backbone Network Environment node6 node8 node7CCN CCN Figure 10: /T_he Detail...

    2008

  7. [15]

    Lily Hay Newman. 2016. What we know about Friday’s massive east coast internet outage. Wired Magazine 21 (2016)

    2016

  8. [16]

    S Rosenbla/t_t. 2013. Fake turkish site certs create threat of bogus google sites. h/t_tp://cnet.co/2oArU6O

    2013

  9. [17]

    David Schwartz, Noah Youngs, Arthur Bri/t_to, et al. 2014. /T_he ripple protocol consensus algorithm. Ripple Labs Inc White Paper 5 (2014), 8

    2014

  10. [18]

    Ivan Seskar, Kiran Nagaraja, Sam Nelson, and Dipankar Raychaudhuri

  11. [19]

    2015./T_he /Q_uest for Scalable Blockchain Fabric: Proof- of-Work vs

    Marko Vukoli/f_j. 2015./T_he /Q_uest for Scalable Blockchain Fabric: Proof- of-Work vs. BFT Replication. MIN: Co-Governing Multi-Identifier Network Architecture and Its Prototype on Operator’s Network Conference’17, July 2017, Washington, DC, USA Figure 11: /T_he Experimental ...

    2015

  12. [20]

    Hequan Wu. 2019. Re/f_lections on the Reform of Network Architecture. ZTE TECHNOLOGY JOURNAL 25, 1 (2019)

    2019

  13. [21]

    Lixia Zhang, Deborah Estrin, Jeffrey Burke, Van Jacobson, James D /T_hornton, Diana K Sme/t_ters, Beichuan Zhang, Gene Tsudik, Dan Massey, Christos Papadopoulos, et al. 2014. Named data networking (NDN). Acm Sigcomm Computer Communication Review 44 (2014), 66–73

    2014

  14. [22]

    Nejc Zupan, Kaiwen Zhang, and Hans-Arno Jacobsen. 2017. Hyperpub- sub: a decentralized, permissioned, publish/subscribe service using blockchains. In Proceedings of the 18th ACM/IFIP/USENIX Middleware Conference: Posters and Demos . ACM, 15–16

    2017

  15. [2011]

    InProceedings of the 7th Asian Internet Engineering Conference

    Mobility/f_irst future internet architecture project. InProceedings of the 7th Asian Internet Engineering Conference . ACM, 1–3

  16. [2016]

    In USENIX Annual Technical Conference

    Blockstack: A global naming and storage system secured by blockchains. In USENIX Annual Technical Conference. 181–194

Pith tools

Reviewed August 14, 2026 · model on record in the stance chip above.