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.
Multicasting protocols can be used to improve the efficiency of the wireless links in Mobile Ad hoc Networks when sending multiple copies of messages from multiple sources to multiple receivers. In this paper, a Source initiated Mesh and soft-state based QoS Probabilistic multicast routing protocol (SQMP) for MANETs is proposed. SQMP is inspired from the ant colony's route finding algorithm through...
Scale-out architectures supporting flexible, incremental scalability are common for computing and storage. However, the network remains the last bastion of the traditional scale-up approach, making it the data center's weak link. Through the UCSD Triton network architecture, the authors explore issues in managing the network as a single plug-and-play virtualizable fabric scalable to hundreds of thousands...
Routing, the act of moving information across an Internet work from a source to a destination is one of the major issues in computer network literature. When it comes to mobile ad hoc network, the complexity increases due to various characteristics like dynamic topology, absence of centralized authority, time varying QoS requirements etc. The biggest challenge in this kind of networks is to find a...
The quickest path problem deals with the transmission of a message of size σ from a source to a destination with the minimum end-to-end delay over a network with bandwidth and delay constraints on the links. The path-table that maps all intervals for σ to the corresponding quickest paths can be computed in O(m 2 +mnlogn) time, where n and m are the number of nodes and links of the network,...
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.