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.
Benefit from the caching hits on the routers along the request routing path, in-network caching plays an important role in diminishing the distance between the consumers and their desired contents. A content caching model is proposed to intuitively analyze the small world characteristics of in-network caching in information centric networks. A directed long edge from a caching node to the provider...
This paper reports extensive simulations of the dynamic routing techniques for optical burst switching (OBS) networks. It gives a summary of the already proposed algorithms and describes more broadly some of them. It introduces also a new one called the Weighted Link Congestion and Frequency (WLCF) algorithm. Our comparative simulations are performed using an in-house developed environment in which...
A bio-inspired model to care for casualties in a disaster is presented and a simulation based on this model is performed and evaluated. The model uses a queuing system inspired by the behavior of immune systems and an ACO-like heuristic for routing casualties across overloaded medical centers. The simulation results are promising. Our model can be modified to be used for the evacuation of population...
Greedy geographic routing is widely adopted in practical wireless networks due to its simplicity. However, greedy geographic routing alone cannot guarantee the delivery of packets due to the existence of local minima. A number of solutions have been proposed to address this issue, such as face routing, landmark-based routing, network segmentation or virtual coordinate based methods, etc. However,...
The peer-to-peer (P2P) communication model has gained an enormous research interest in the last few years due to its promising properties (e.g., decentralization, self-organization, scalability, etc.) to build large scale distributed applications. However, the P2P systems are characterized by their dynamic behavior as peers can frequently join and leave the network. This property makes the data availability...
Following a constant rise in the complexity and scale of peer-to-peer networks, researchers have looked at biological phenomena in order to develop self-organized, adaptive, and robust management systems. Our focus is on distributed swarm intelligence mechanisms that mimic the behavior of social insects to solve problems such as overlay management, routing, task allocation, and resource discovery...
VANET (Vehicular Ad-hoc NETwork) is comprised of devices that are installed inside vehicles and on road sides. Since vehicles can move randomly and at various velocities, the network topology is highly dynamic. Consequently, links between network nodes could be broken at anytime and communications from vehicle to vehicle could be corrupted. For this reason, a routing protocol independent of the network...
Many proposals have been advanced for structured P2P networks, but it is difficult for existing structured P2P networks to achieve dynamic load balancing sufficient. In this paper, we propose a new structured P2P network called Waon, which achieves dynamic load balancing among nodes. Each node in a Waon network controls the number of objects assigned to the node for load balancing of objects. In addition,...
We study the load balancing aspect of routing algorithms in wireless ad hoc networks. We define a statistical measure called local coefficient of variance (lcv) to study the smoothness of the load distribution in the network. The importance of keeping lcv as low as possible in designing load balanced routing algorithms is demonstrated. We analyze how number of nodes, transmission range, network area...
This paper considers the impact of unidirectional link on Ad-hoc on-demand distance vector routing protocol from a mobility perspective. Most routing protocols assume that all wireless connectivity is symmetrical and bidirectional. Such assumptions are not generally true. Wireless nodes exhibit non-uniform transmission power, non-uniform reception quality and signal to noise ratio which may result...
The combination of deflection routing and burst retransmission is an attractive scheme for resolving the burst contention problem in Optical Burst Switching (OBS) networks. Most of previous works on hybrid schemes use simulation approach to prove the efficicency. In this paper, we develop an analytical model for obtaining the overall burst loss ratio of an OBS network that take into account deflection...
Wireless technology based on the IEEE 802.11 standard is used to support multiple types of communication services (data, voice, and image) with different QoS requirements. Node mobility creates a continuously changing communication topology in which paths break and new one form dynamically. The routing table of each router in an adhoc network must be kept up-to-date. MANET uses Distance Vector or...
One common model that has been used to analyze routing algorithms in ad hoc networks considers networks that are so dense that a node exists close enough to any point in the network. Continuous techniques were used to calculate the average and maximum loads of the routing algorithms. In this paper we explain some limitations of such techniques in predicting the load of routing algorithms in discrete...
As the high redundancy of network equipments and paths, connection reliability is no longer the most important parameter for networks. According to network function, this paper advances transmission time reliability as a common parameter to describe network congestion. It is defined to be the probability that networks will transmit material, energy or information timely when used under specified operating...
Broadcast is a basic service for many network operations. It had been proposed to maintain a broadcast tree over a P2P network explicitly to support message broadcast from the root to leaves and information aggregation from leaves to the root reversely. We notice that a peer near the root of a broadcast tree has shorter message latency and a smaller possibility of message loss due to join or departure...
This paper designs a PCE-based architecture of routing, and proposes two distributed signaling schemes in PCE-based wavelength switching optical network (WSON). Simulation results based on the topology of Chinese core network are given and analyzed.
Large swings in the demand for content are commonplace within the Internet. Although multistage interconnection networks (MINs) are fairly flexible in handling varieties of traffic loads, their performance considerably degrades by hotspot traffic, especially at increasing size networks. As alleviation to the tree saturation problem, the prioritizing of packets is proposed leading to a scheme that...
The paper introduces wireless sensor network's route protocol, then the difference between traditional wireless network and wireless sensor network is analyzed, and the MSAODV route protocol based on AODV route protocol are raised and implemented, the simulation soft tool NS-2 is used, and end-to-end delay and the normalized routing load are chosen to evaluate the performance of the MSAODV. The modified...
This paper proposes an enhanced load-balancing approach considering the on-going traffic sessions as well as new traffic sessions. In our scheme a congested node tries to escape from the congestion caused by the on-going traffic session by requesting phased detour to adjacent nodes. Like legacy load- balancing schemes, a potentially congested node avoids entering congestion state by dropping incoming...
This paper presents a NoC (network-on-chip) simulation and verification platform (NSVP) based on SystemC. A general NoC node structure is first realized under SystemC, and then connected to form the network. NSVP supports an arbitrary size of mesh and torus topology, and adopts two classic routing algorithms - XY and TXY as the routing algorithm. Users also can develop their own network topology and...
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.