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 properties found in complex networks (e.g., small-world, scale-free) have been used to characterize the behaviour of several processes such as epidemics or oscillators. We analyze the impact of such properties on the quality of a routing process. Using a Mixed Integer/Linear Program, the routing minimizes the number of ports installed in a previously designed network. Ports are network components...
In wireless sensor networks (WSNs), gathering sensed information, transforming the information data to the base station in an energy efficient manner, and lengthening the network lifetime are important issues. Clustering is an energy efficient way that divides sensor nodes into many clusters, each of which has a cluster-head. The routing from cluster-head sensor nodes to the base station, however,...
Routing in mobile ad hoc networks (MANETs) is central to their proper functioning. Network dynamics make the routing a real challenging task. Although a host of studies has been reported in the literature evaluating the performance of proposed routing algorithms, a deeper insight reveals some residual malfunctioning: wall effects, looping and inconsistency. In this paper, we first unleash the cover...
As the rapid growth of Internet and the communication link speed, it becomes increasingly challenging for network processors to timely route the incoming traffic to the destination ports. The traditional approach must look up the routing table based on the destination IP address to determine the output port. The ternary CAM approach provides fast associative look up, but is very costly for large routing...
Chord is a typical model of structured P2P network. However, there are some problems for the mechanism of searching resources in Chord, such as too much redundant information in the routing tables of nodes, the deviation of needed times of forwarding lookup messages among searching resources whose key values are located in different areas of identifier space, some available routing information being...
An alarming trend for the global routing table's growth factor in the interdomain IP backbone shows that Internet inter-domain routing scalability becomes an issue again. It is widely agreed upon that the rapid global routing table size growth is mainly due to the growth in the number of ASs and the wide deployments of multihoming and traffic engineering. These popular commercial practices deaggregate...
Unlike other efforts on supporting triples of higher orders of magnitude in a centralized triplestore, we believe, as the semantic Web evolves, the unstructured P2P paradigm may better fit with the application scenario of triplestores used by individuals in the future. We designed an unstructured P2P RDF triplestore, focusing on its efficient query routing mechanism, and demonstrated that it can deliver...
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,...
Wireless sensor networks experience a number of problems not found in wired networks, such as limited power resources, location identification and message routing in a wireless medium. Analysis of small world networks have shown that it is possible to transmit information from one node to another node some random distance away within a small number of hops (i.e. small world networks have a small diameter)...
We consider problems where multiple agents cooperate to control their individual state so as to optimize a common objective while communicating with each other to exchange state information. Since communication costs can be significant, we seek conditions under which communication of state information among nodes can be minimized while still ensuring that the optimization process converges. In prior...
Fast recovery from failures and efficient allocation of link capacities in a network for guaranteeing seamless communication services are two primary goals of network survivability design. Shared backup path protection (SBPP) technique has been shown to be a promising solution to tackle these problems, due to sharing capacity among protection paths. The level of capacity sharing that can be achieved...
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...
Guaranteeing quality of service (QoS) for event delivery has been recognized as an important but challenging issue in event based middleware (EBM), that is responsible for routing events from publishers to subscribers over an event broker network. Amongst the numerous QoS parameters, in our work, we focus on reliability as a service guarantee to subscribers in an EBM. We add to the existing body of...
Geometric greedy routing uses (virtual) geographic point locations as addresses for the purposes of routing, while routing decisions are made by each node individually based only on local information. It requires that the network topology is greedily embedded in a metric space through assigning virtual coordinates to the nodes in the network. Recent research pointed out that such scheme is significantly...
Tolerant network (DTN) is a kind of network with high latency and frequent disconnection. To guarantee the success of delivering a message to the destination and to make time cost as low as possible, routers in this kind of network (DTN) need to multicopy the message and store it longer than routers in other kinds of network. This paper focuses on the relation and reciprocity between routing and buffer...
Network quality of VANET (Vehicular Ad-hoc Network) is usually bad due to speed variation, high mobility, driver behavior, traffic density, swarm effect, environment complexity, et al. Speed variation dynamically changes the car-to-car distances frequently and results in broken connections. Besides, VANET's network topology usually deployed along with the roadside, the nearby car is very probably...
QoS routing and multipath routing have been receiving much attention respectively in network communication. However, the research combining those two kinds of routing is rare. This paper integrated the ideas of QoS and multipath, and presented the problem of shortest pair of disjoint paths with bandwidth guaranteed. we proved it to be NP-complete, and then proposed a heuristic algorithm. The analysis...
Multipath Routing plays an important role in communication networks. Multiple disjoint paths can increase the effective bandwidth between pairs of vertices, avoid congestion in a network and reduce the probability of dropped packets. In this paper, we built mathematical models for arc-disjoint paths problem and vertex-disjoint paths problem respectively, and then proposed polynomial algorithms for...
In virtue of its widespread application scenarios, especially in battlefield communication, disaster rescue, satellite and deep-space transmission, Delay-disruption Tolerant Network (hereinafter referred to as DTN) has become one of the most attractive focuses in research for future Internet. Due to the intermittent connectivity, mobility of nodes, signal interference, jamming in DTN, there exist...
In the following paper, we study the tradeoff between network utility and network lifetime for energy-constrained wireless sensor networks (WSNs). By introducing a parameter r, we combine these two objectives into a single weighted objective, and consider rate control and routing in this tradeoff framework simultaneously. First, using the dual decomposition method, we decompose the tradeoff model...
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.