Computer Science and Information Engineering, World Congress on (2009)
Los Angeles, California USA
Mar. 31, 2009 to Apr. 2, 2009
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CSIE.2009.534
With the widespread use of the Internet, reducing power consumption to extend network lifetime while maintaining the communication connectivity and covering the target region completely has become one of the most important challenges in designing future Internet networks. After the comparison of some existing methods, such as measuring networks state and evaluating flow-jamming attack on network flow, we present a new form of network traffic flows, in which end systems or hosts have three basic states: on, off and asleep. In this paper, we first give a brief review on the existing techniques, and particularly consider “research on architecture” as a process rather than an event. Then, we propose a framework for initial exploration of supporting selective connectivity, whereby a host or a router can choose whether to be “connected” or “disconnected”. The proposed approach is formulated as an optimization problem for both selective connectivity and resource exhaustion in Internet. We show that this technique is able to provide a foundation for design of future protocols to improve the actual Internet architecture.
Luonan Chen, Yu Lu, "Analysis and Optimality on Network Traffic Flows", Computer Science and Information Engineering, World Congress on, vol. 02, no. , pp. 39-43, 2009, doi:10.1109/CSIE.2009.534