Based on the Multi-Point Mapping Decomposition Flow Decomposition Simulation Network Mutations
Li Y · Jisuanji fangzhen · 2013
Current network in abnormal to attack,or large-scale login at the same time,huge change flow will occur for short periods of time,make the paralysis risk faced by a single node. The current network scheduling algorithm is based on a single node shunt,once a great changing flow,can cause shunt failure,cause the network down.A multitasking mutation multi-point mapping decomposition algorithm of the network flow decomposition approach to management. Combining the Map function and a Reduce function,to be able to transfer the data collection of the network characteristics to the distributed network file system,so as to Reduce the storage time of the network file requires. Will be related to the characteristics of network traffic increases suddenly against a database of task decomposition processing,able to obtain large amounts of subtasks,final mutation flow decomposition of network management.Experimental results show that the algorithm presented in this paper for network mutation decomposition of traffic management,can greatly improve the performance of network mutation management flow decomposition method,so as to provide more high-quality network services.