The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The difficult issue of Web data mining is proposed to achieve Web data mining method, which is based on XML-based Web database in the face of semi-structured data structure excavation process, the data feature extraction process, we found the hidden rules and knowledge, the method is simple, effective and low cost. The paper first gives the definition of data mining; describes the process and commonly...
In order to better address the problems like the inefficiency and large expense of various Ad Hoc routing protocols, this paper using OPNET simulation tool for the performance of DSR routing protocol simulation, build a small-scale (30 nodes), medium size (50 nodes) and large-scale (100 nodes) the complexity of the mobile ad hoc network model, the DSR routing algorithm, the average route discovery...
In order to solve the problem that the technology can not satisfy VPN consumer's need about information insurance for the safety resolving tradition's, in the main body of this essay, we have being aimed at it's safe hidden trouble on the basis going deep into the operating principle studying VPN's, have brought forward one kind of scheme, this scheme passes an introduction invade check system, excavate...
For MAC (Media Access Control) protocol not providing QoS(Quality of Service) guarantees. With the increase of multimedia sevices in wireless networks(for example:voice, video, etc), when the networks get crowded, real-time applications will decrease its performance. We proposed a wireless network algorithm for 802.11e, witch supports fixed nodes and mobile nodes, and also swiches and new connections...
For real-time multimedia communication has strict QoS (Quality of Service) requirements for network, especially it is very sensitive to packet loss rate and delay jitter. When the communication network becomes seriously congested, a Bi-directional Resource Reservation model solution is proposed. This scheme supports the QoS priority and Bi-directional Reservation. The results show that the internal...
In order to avoid routing overhead and reduce management fee for transmisson of routing information, we purposed two heuristic algorithms which are self-pruning algorithm and dominant pruning algorithm. This algorithm is more efficient than the aimless flooding in wireless networks, and redused unnecessary transmission of information and nodes switching by the movement between neighbourhoods. Result...
In view of bandwidth requirements in ATM (asynchronous transfer mode) network, a kind of dynamic bandwidth allocation scheme has been proposed. It solves the problem of low bandwidth utilization ratio caused in VBR (variable bit rate) MPEG (Moving Picture Experts Group) video transmission, the simulation experiment curve indicates that with the increase of already bandwidth value, the average cell...
For MPLS VPN (Multi-Protocol Label Switching Virtual Private Network) not suitable for the complex business logic and application with high security requirements because of its lack of providing encryption and certification, a scheme of enhancing MPLS VPN QoS is proposed. It uses the method based on "Log-infinitely Divisible Cascades", realizes fine-grained security service strategy by integrating...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.