6.1 Future works
In this scheme, for theoretical improvement, we shall settle a intelligent diagnostic tool into our system. The future work can add the condition filter and the node tracer. About the idea of the condition filter, because of the difference between one environment and another, we can make this system more efficiently by add correct variable to let the cable modem avoids unnecessary duplication. About the idea of the node tracer, we like to build a recorder for the node behavior. In this case, the system can trace the online time of the each cable modem. In the other hand, we shall build a reporter for MSO. So that the MSO can classify the cable modems by the behavior. The MSO can mark the cable modem that always do power cycle or not usually online, these kind of nodes were marked as low priority. We can install this information for each cable modem while the cable modem trying to get online. By learning this information, the cable modems had to detour the low priority nodes. And then the successful recover rate might be increased.
6.2 Conclusion
The thesis proposes the CAROL system to solve the problem that the cable modems suffered from loss their unique factory data occasionally, and it's hard to restore the factory data back. We have established the recover service for the HFC network and submit a new solution for inserting this system into the cable modem. In order to preserve the advantage of protecting the factory data of the cable modem, building this system via P2P architecture is a good solution for distributing the factory data of cable modems from vendor to clients. The features of the Network Coding that we
５４
used just meet our demands that reduce the repairing time for cable modem which lost it's unique factory data and making this kind of mass-produced product become more reliable. Although we do not have much devices for the experiment and we know the P2P network needs numerous nodes to keep the network operation steadily. However, we design the scenario demonstration in previous chapters to present the theoretical possibility. As the result we can see in past chapter, it is a good solution for this issue.
５５
7 References
[1] The Organic Computing page. Retrieved April 25, 2009, from http://www.organic-computing.org/index.html
[2] Wikipedia(n. d.). Organic Computing Retrieved April 25, 2009, from http://en.wikipedia.org/wiki/Organic_computing
[3] Hartmut Schmeck : Organic Computing – A New Vision for Distributed Embedded Systems , Institute AIFB, University of Karlsruhe, Germany , Computer Society, IEEE.
[4] Wikipedia(n. d.). Ubiquitous computing. Retrieved May 2, 2009, from http://en.wikipedia.org/wiki/Ubiquitous_computing
[5] V Rangel and R Edwards : Performance Analysis and Optimisation of the Digital Video Broadcasting/Digital Audio Visual Council Cable Modem Protocol for the Delivery of Isochronous Streams , IEEE Global Telecommunications Conference, 2001.
[6] DOCSIS® Specifications — DOCSIS 3.0 Interface. Retrieved May 1, 2009, from http://www.cablemodem.com/specifications/specifications30.html
[7] Upstream Calibration and Power Scheme Application Note for TNET950 v1.0 : Texas Instruments, September , 2008
[8] Hartmut Schmeck, "Organic Computing - A New Vision for Distributed Embedded Systems,"
isorc, pp.201-203, Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC'05), 2005
[9] C. Müller-Schloer. Organic Computing - on the feasibility of controlled emergence. In CODES + ISSS 2004 Proceedings, pages 2–5. ACM Press, September 8-10 2004.ISE
[10] Alexander Sinsel, Juliane Claus, Thomas Ludwig: The Semanto-Pragmatic Perspective of Information Processing - a Dynamical System Approach to System Design. (submitted to SASO 2009, San Francisco, California, September 14-18, 2009)
５６
[11] R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, “Network information flow,” IEEE Trans.
Inform. Theory, vol. IT-46, pp. 1204–1216, 2000.
[12] DS Lun, M. M’ edard, R. Koetter, and M. Effros, “Further results on coding for reliable communication over packet networks,” IEEE International Symposium on Information Theory (ISIT), pp. 1848–1852, 2005.
[13] T. Ho, M. M’ edard, R. Koetter, D.R. Karger, M. Effros, J. Shi, and B. Leong, “A random linear network coding approach to multicast,” IEEE Transactions on Information Theory, vol.
52, no. 10, pp. 4413–4430, October 2004.
[14] Ralf Koetter and Muriel M’ edard, “An algebraic approach to network coding,” IEEE/ACM Trans. Netw., vol. 11, no. 5, pp. 782–795, 2003.
[15] Christos Gkantsidis and Pablo Rodriguez Rodriguez, “Network Coding for Large Scale Content Distribution”, IEEE INFOCOM, 2005
[16] Philip A. Chou, Yunnan Wue, and Kamal Jain, “Practical Network Coding”, Proceedings of the Annual Allerton Conference, 2003
[17] Sachin Katti, Hariharan Rahul, Wenjun Hu, Dina Katabi, Muriel Me'dard and Jon Crowcroft,
“XORs in the air: practical wireless network coding”, IEEE/ACM Transactions on Networking (TON), 2008
[18] C.K. Ngai and R.W. Yeung, “Network coding gain of combination networks” , IEEE Information Theory Workshop, Oct. 2004.
[19] A.G. Dimakis, P.B. Godfrey, M.J.Wainwright and K. Ramchandran, “Network coding for distributed storage systems,” Proc. IEEE INFOCOM 2007, May. 2007.
[20] NJA Harvey, DR Karger, K Murota, “Deterministic network coding by matrix completion” - Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, 2005 – portal.acm.org.
[21] Y. Zhu, B.C. Li and J. Guo, “Multicast with network coding in application-layer overlay networks” IEEE Journal on Selected Areas in Communication, Sep. 2004
[22] Jesus Garcia and Michael J. Schulte, “A COMBINED 16-BIT BINARY AND DUAL GALOIS FIELD MULTIPLIER” Proceedings of the IEEE Workshop, 2002
５７
[23] Modeling Topology of Large Internetworks. Retrieved May 17, 2010, from http://www.cc.gatech.edu/projects/gtitm/
[24] K. Bhattad, N. Ratnakar, R. Koetter and K.R. Narayanan, “Minimal network coding for multicast,” Proc. IEEE International Symposium on Information Theory , 2005.
[25] Y. Wu, A. G. Dimakis, and K. Ramchandran, “Deterministic regenerating codes for distributed storage,” in Allerton Conference on Control, Computing, and Communication, (Urbana-Champaign, IL), September 2007.
[26] Finite field arithmetic, From Wikipedia. Retrieved May 27, 2009, from http://en.wikipedia.org/wiki/Finite_field_arithmetic
[27] AES' Galois field. Retrieved May 27, 2009, from http://www.samiam.org/
５８