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 idea of using entropy measurement to detect anomalies is not a novelty in the research community. But all these entropy-based approaches are single-scale based ??complexity?? methods, and don??t consider temporal and spatial correlation in network traffic. In this paper, multi-scale entropy (MSE) and Renyi cross entropy are introduced to solve these problems. First, a kind of Port-to-Port traffic...
This article proposes a new technique for routing and wavelength assignment in WDM circuit switch mesh networks, supporting both wavelength conversion and without wavelength conversion systems. With this technique, the network can be preceded by accomplishing two processes: one is searching for the shortest main route and the second-shortest alternative route and another is randomly choosing wavelength...
As we know, the member-only algorithm in provides the best links stress and wavelength usage for the construction of multicast light-trees in WDM networks with sparse splitting. However, the diameter of tree is too big and the average delay is also too large, which are intolerant for QoS required multimedia applications. In this paper, a distance priority based algorithm is proposed to build light-trees...
Today??s networks are often hierarchically modeled for both scalability and security considerations. Topology aggregation is introduced for the purpose of simplifying routing by summering and compressing information of lower levels and advertising them to higher logical levels. However, the balance between performance and accuracy of state information must be taken into account since topology aggregation...
The paper proposes an identity-based aggregate path verification protocol (IBAPV) to provide authenticity for route announcements in the border gateway protocol (BGP) with a more efficient and easily deployed identity-based aggregate signature scheme instead of certificate-based scheme, which leads to performance and deployment matters of current proposals. Because in the identity-based cryptographic...
In this paper, we present a centralized quasi-static channel assignment for multi-radio WMNs (wireless mesh networks) to provide high-throughput paths. We probe data packets at each wireless access point and estimate the traffic load for each network link using a new load estimation algorithm. So the channel assignment can intelligently assigns channels with the objective of maximizing the aggregate...
An accurate map of the Internet is very important for studying the network??s internal structure and network management. The main approach to map the Internet is to collect information from a set of sources by using traceroute-like probes. In a typical mapping project, active measurement sources are relatively scarce while traceroute destinations are plentiful, which makes the sampled graph quite...
Detection of distributed denial of service (DDoS) attacks over the Internet is crucial for many Internet applications, such as electronic commerce, network games, P2P, etc. Based on anomaly detection information, network route selection, quality of service (QoS) provision, and traffic engineering can be performed to bypass the abnormal areas or to immigrate the attack traffic. To detect the DDoS attacks...
In this paper, we investigate the power allocation problem involving how to multiplex cooperative routes in multi-source ad hoc wireless networks. The aim is to provide a route-multiplexing scheme with minimal total power consumption given spectrum efficiency constraints. Three protocols: full combination with interference (FCI), full combination with time sharing (FCTS) and selection between interference...
This paper proposes an open cooperative architecture for the integration of mobile networks. It is based on the soft-switch idea which is the control functional entity of next generation network (NGN) and fit for large scale networking. In the architecture static routing combined with dynamic routing is adopted for globally connecting among network soft-switch centers (NSCs) with distributed control...
In this paper, an energy-efficient multiple paths routing algorithm for wireless sensor network (WSN) is proposed. It consists of three elements: (i) gradients to disseminate data over multiple paths from a source to a sink, (ii) rules to set up disjoint multiple paths, and (iii) policies to select the working path. By limiting the maximum number of the gradients, the exploratory data messages forwarded...
Quality of service (QoS) routing has been proposed for supporting the requirements of network applications and satisfying connection constraints. A large amount of information needs to be exchanged periodically among routers. Therefore, in order to satisfy such requirements localized QoS routing algorithms have been proposed. This is where source nodes make routing decisions based on statistics collected...
Wireless sensor network (WSN) is a wireless network that gathers information from remote area with autonomously configured routing path. We propose a fusion based routing for converge cast in which all sensors periodically forward collected data to a base station. Previous researches dealt with only full-fusion or no-fusion case. Our fusion rate based spanning tree (FST) can provide effective routing...
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.