本文中朝空間標示的概念來思考，透過戳記式演算法來解決非結構化網路中廣播訊 息過多的問題。例如可以將戳記法應用於普遍使用的點對點檔案傳輸的查詢封包上，使 網路詢問封包大幅減少，進而改善網路其他封包的延遲狀況。緊急救難情形下戳記法也 是有效的改善方式，如在火災時救難隊員利用無線網路互相連絡，但隊員們需要傳送大 量的訊息，常常造成網路的阻塞導致某些緊急訊息無法即時送出。利用戳記法能有效降 低訊息量，使得緊急訊息能夠即時廣播給隊員們，避免掉不必要的傷亡或損失。也可以 將戳記法實作在電子郵件的轉寄信件處理上，透過檢查接收者是否已經收過同樣信件的 方式來減少使用者處理信件的困擾。
實驗透過與泛流式網路比較的各項分析數據中証實，採用戳記的方法在跟實際網路 結構相近的小世界網路可以有效降低 20%以上冗贅的資料傳送，進階的戳記方法可改善 其效果達 47%，加入了 Neighbor pruning 的混合戳記則可使改進程度達到約 59%。二維 網狀模型的基本戳記法可減少 25%的冗贅訊息，進階戳記法則多一些，可減少 26%訊 息量，混合戳記法表現優越，可大幅改善 63%之訊息數量。雖然在 Waxman 網路中降 低的幅度較少，基本的戳記法約可減少 17%以上冗贅的資料傳送，進階戳記法可改善效 果達 18%，混合戳記則仍可改進約 27%。BA 模型同樣可減少 17%以上冗贅的資料傳送，
進階戳記約 22%的改善，混合戳記法較為優越，可達 51%之改進幅度。加入戳記這樣 的技術使得節點間傳送訊息量可以有效地得到控制，網路的負荷也就隨之減低，訊息傳 輸擁塞的情形也迎刃而解。改進訊息數量的同時，覆蓋率以及傳輸時間上也不至於下 降；戳記數量過多的部份也可以透過布隆過濾器等壓縮方式來控制在一個較低的成本 內。在這裡建議使用紀錄三層以內的戳記加上布隆過濾器混合使用，若擔心覆蓋率問題 則可選擇紀錄三層以內的戳記加上雜湊表混合使用。戳記法除了可用在廣播上，未來可 能會致力研究在非結構化網路下進行多點傳播功能，使戳記法可應用之層面更加廣泛。
參考文獻
[1] A.L. Bar´abasi and R. Albert, “Emergence of Scaling in Random Networks,” Science, pages 509–512,October 1999.
[2] A. Medina, A. Lakhina, I. Matta, and J. Byers, “BRITE: Universal Topology Generation from a User’s Perspective,” Technical Report BUCS-TR-2001-003, Boston University, 2001.
[3] Anis Laouiti, Amir Qayyum, and Laurent Viennot, “Multipoint Relaying:
An Efficient Technique for Flooding in Mobile Wireless Networks,”
Proceedings of the International Conference on System Sciences, 2001.
[4] Amir Qayyum, Laurent Viennot and Anis Laouiti, “Multipoint Relaying for Flooding Broadcast Messages in Mobile Wireless Networks,” Proceedings of the International Conference on System Sciences, 2002.
[5] B. Bloom, “Space/time Tradeoffs in Hash Coding with Allowable Errors,”
ACM, pp.422–426, 1970.
[6] B. Waxman, “Routing of Multipoint Connections,” IEEE J. Select. Areas Commun., December 1988.
[7] Bloom filer implement, http://www.partow.net/programming/hashfunctions/
[8] Boost, http://www.boost.org/
[9] Brad Williams and Tracy Camp, “Comparison of Broadcasting Techniques for Mobile Ad Hoc Networks,” The International Symposium on Mobile Ad Hoc Networking and Computing, pp. 194-205, 2002.
[10] C. Gkantsidis, M. Mihail and A. Saberi, “Hybrid Search Schemes for Unstructured Peer-to-Peer Networks,” Proc. IEEE INFOCOM, 2005.
[11] E. Adar and B. Huberman, “Free riding on Gnutella,” First Monday, Vol.
5-10, October 2, 2000
[12] Hai Liu, Xiaohua Jia, Peng-Jun Wan, Xinxin Liu and Frances F. Yao, “A Distributed and Efficient Flooding Scheme Using 1-Hop Information in Mobile Ad Hoc Networks,” Transactions on Parallel and Distributed Systems, vol. 18, no. 5, pp. 658-671, 2007
[13] Hyojun Lim and Chongwon Kim, “Multicast Tree Construction and Flooding in Wireless Ad Hoc Networks,” Proceedings of the International Workshop on Modeling, Analysis and Simulation of Wireless and Mobile
Systems, pp. 61-68, 2000.
[14] Hyuncheol Kim, Younghwa Kim, Kwangjoon Kim and Doo-Won Seo,
“Performance Analysis of Restricted Path Flooding Scheme in Distributed P2P Overlay Networks,” International Journal of Computer Science and Network Security, VOL.7 No.12, December 2007.
[15] Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, and Hari Balakrishnan, “Chord: A scalable peer-to-peer lookup service for internet applications,” In Proc. ACM SIGCOMM 2001, August 2001.
[16] Min-Te Sun, Wuchi Feng and Ten-Hwang Lai, “Location Aided Broadcast in Wireless Ad Hoc Networks,” Proceedings of the Global Commnunications Conference, 2001.
[17] Napster, http://music.napster.com/napsterhomemain.htm [18] NS-2 The Network Simulator, http://www.isi.edu/nsnam/ns/
[19] OpenNap, http://opennap.sourceforge.net/
[20] Qin LV, Pei Cao, Edith Cohen, Kai Li and Scott Shenker, “Search and Replication in Unstructured Peer-to-Peer Networks,” In Proceedings of 16th ACM International Conference on Supercomputing(ICS’02), 2002
[21] R. Rivest, “The MD5 Message-Digest Algorithm,” RFC1321, MIT Laboratory for Computer Science and RSA Data Security Inc, April 1992 [22] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, “A scalable
content-addressable network,” In Proc. ACM SIGCOMM (San Diego, CA, August 2001), pp. 161{172.
[23] Sze-Yao Ni, Yu-Chee Tseng, Yuh-Shyan Chen and Jang-Ping Sheu, “The Broadcast Storm Problem in a Mobile Ad Hoc Network,” Proceedings of the International Conference on Mobile Computing and Networking, pp.
151-162, 1999.
[24] Stefan Saroiu, P. Krishna Gummadi and Steven D. Gribble, “A Measurement Study of Peer-to-Peer File Sharing Systems,” On Multimedia Computing and Networking (MMCN), 2002.
[25] Wei Peng and Xi-Cheng Lu, “On the Reduction of Broadcast Redundancy in Mobile Ad Hoc Networks,” The International Symposium of Mobile Ad Hoc Networking and Computing, pp. 129-130, 2000.
[26] W Song, W Hu, Z Hu and X Zeng, “Reliable Resource Search in Scale Free
[27] Yang B and Garica Molina H, “Improving Search in Peer-to-Peerd Networks,” Phys. Proceeding of the 22nd IEEE International Conference on Distributed Computing, 2002.
[28] Yoav Sasson, David Cavin and Andre Schiper, “Probabilistic Broadcast for Flooding in Wireless Mobile Ad hoc Networks,” Technical Report IC/2002/54, Swiss Federal Institute of Technology, 2002.
[29] 李崇右, 溫高宏 and 吳俊興, 戳記式電子郵件轉寄過濾機制, 台灣網 際網路研討會(TANET), 2010
[30] 李崇右 and 吳俊興, 戳記式點對點廣播機制, 第四屆優質家庭生活科 技之關鍵技術研討會, 2010