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 following topics are dealt with: performance modelling; routing mechanism; distributed systems; parallel systems; service oriented architecture; communication technology; protocols; autonomic network systems; Internet computing; ad hoc networks; wireless sensor networks; privacy management; mobile networks; multimedia systems; pervasive computing; ubiquitous computing; security intrusion detection;...
Mobile ad hoc networks are a wireless network in which each node is vested with the responsibility to act as a router. The individual nodes are constrained by the resources such as battery power. To achieve maximum throughput with the available resources the nodes might behave selfishly. This could lead to severe performance degradation in network throughput, packet delivery ratio, packet loss increment,...
In the large-scale deployment of wireless sensor networks, when cluster-heads of the routing algorithm based on clustering transmit their data to sink via multi-top communication, the cluster-heads closer to sink are burdened with heavy relay traffic and tend to die early, causing energy holes that affect the normal operation of the network. It shortens the lifetime of network. To solve the problem...
This paper imports the concept of domain to design a resource locating model with local domain first based on Kademlia protocol, which is abbreviated to LDF-KAD, to refer the small world phenomenon and the characteristic of localized dataflow first on the Internet. The LDF-KAD model includes two layers structure that are super node layer and general layer. And super node layer consists of all super...
According to the cross relationship between administrative division map and the graph of backbone routing system, we classify the routing nodes by map-coloring technology which is based on "triangular element". Then, we design the "tricolor loop" network architecture and its routing policy. In order to give a better description about this scheme, we take the backbone routing system...
The hierarchical routing and wavelength assignment problem in Automatic Switched Optical Network (ASON) is researched. Based on our analysis, three adaptive algorithms called MLLR (Multi-Layer Least Loaded Routing Algorithm), WMLCR (Wavelength-graph-based Multi-Layer Least Congestion Routing Algorithm) and BMR (Backtracking-based Multi-Layer Routing Algorithm) are proposed. A platform named AHORSP...
In this paper, BGP-Update based monitoring method is proposed to effectively alleviate bandwidth tension and link congestion, and eventually resolve the problem of update message flooding when routing anomalies. Such monitoring method tracks routings and dynamically displays the alternations of selected routings and its updating quantities by analyzing collected BGP-Update messages. With the help...
Emergency data which mean something happened in sudden need to be dealt with timely, otherwise will bring very serious consequences. To ensure the low-delay routing of emergency data, a novel graded routing strategy, dynamic adaptive cooperative routing (DACR) is proposed in this paper. This scheme extends the LEACH protocol to enable the multi-hop transmissions among clusters by incorporating a cooperative...
In the future, wireless sensor networks (WSNs) are expected to play an important part in our everyday life. Sensor nodes are becoming more and more miniaturized, equipped with radio transceivers, and deployed in large quantities. However, due to their limitations in computational and communication capabilities, clustering techniques are usually applied for energy conservation, where designated nodes...
As a reaction to the threat of network security, the appliance of virtual private network (VPN) has become more and more prevalent. In order to support IPSec VPN on ForTER, the paper proposes an implementation model by IPSec security policy LFB, which is the critical step to achieve IPSec VPN on ForTER. Experiment results show the feasibility and effectiveness of the model.
As part of the resource allocation mechanisms, each router must implement some queuing discipline that governs how packets are buffered while waiting to be transmitted. Various queuing disciplines can be used to control which packets get transmitted (bandwidth allocation) and which packets get dropped (buffer space). The queuing discipline also affects the latency experienced by a packet, by determining...
The reconfiguration router unit (RRU) is one of the most effective solutions to improve router function extend. It can satisfy the urgent need of multi-network and multi-business. Component composition and compositional reasoning are the core technologies and frontier research areas in RRU. In the process of component composition, resource-control of router is the most important factor. How to detect...
The Chord is a famous peer-to-peer application. There are many variants which change the structure and the routing algorithm of the Chord, and all these variants achieve the higher routing efficiency than those of the original ones. To improve the routing efficiency of base-k Chord, this paper proposes a new finger table for base-k Chord by using symmetrical bidirectional structure, which just like...
Epidemic or gossip-based algorithms have been proposed for data dissemination in vehicular networks. Due to the unfeasibility of deploying large size vehicular networks, the performance evaluation of these algorithms is usually based on simulations. However, most literature works present experimental results based on hyper-simplified and non-realistic mobility scenarios or do not adequately describe...
To resolve the scalability problem in the existing Internet, there are many researches proposing the idea of separating the Internet into two independent evolving spaces, the access network and the core network, respectively. Such separation provides us opportunities to reconsider the methods of implementation of inter-domain traffic engineering under the new network environment. Based on the existing...
BGP allows providers to express complex routing policies preserving high degrees of autonomy. However, unrestricted routing policies can adversely impact routing stability. A key concept to understand the interplay between autonomy and expressiveness on one side, and stability on the other side, is safety under filtering, i.e., guaranteed stability under autonomous usage of route filters. BGP route...
Two techniques have been proposed in the literature to improve the scalability of QoS scheduling in the core of the Internet: flow aggregation and dynamic packet scheduling (DPS). These techniques reduce or eliminate the amount of state maintained by each router in a core network. Flow aggregation combines multiple individual flows into a single aggregate flow (and thus reducing the per-flow state...
Recent efforts are made to construct a globally accessible group communication service by a simultaneous use of network and application layer multicast. Such hybrid approaches provide native multicast to group members wherever available, but relocate data distribution and duplication from the network to applications or gateways if needed. Such services require an abstract programming interface to...
Adapting router buffer sizing rules and TCP's congestion control to Gbit/s link speeds has been the subject of many studies and proposals. In a previous work (Hassayoun and Ros, 2008), we found that high-speed versions of TCP may be prone to strong packet-loss synchronization between flows. Given that synchronized losses may lead to oscillatory behavior in router queues, a relatively large amount...
IPTV, software replication and other large-scale distribution tasks urge the need for efficient multicast mechanisms in overlay networks. Current multicast solutions on the application layer are either efficient, structured, but inflexible, or flexible, unstructured, but of lesser efficiency. This paper introduces scalable adaptive multicast on bi-directional shared trees, a new structured but flexible...
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.