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.
In wireless ad hoc networks, the constructed topology is preferred to be planar since a planar topology enables guaranteed delivery of packets without a routing table. Previous planar structures are statically constructed for the whole network. However, environmental or network dynamics such as channel status, interference, or residual energy will prevent such structures from providing the best service...
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...
In this paper, we present an optimization-based approach to control the outbound interdomain traffic for stub ASes. Our approach allows the network operator to define multiple traffic objectives. We present a genetic algorithm to specify a provider for destination prefix sets with the objective of minimizing configure changes , minimum cost and load balancing. In solving the assignment problem with...
It has been recognized that today's Internet routing and addressing system is facing serious scalability problems. The ever increasing network customers, multihoming, and traffic engineering, are driving the growth of Default Free Zone routing table size at an alarming rate. To solve this issue, several solutions have been proposed to separate the current single numbering space, i.e., the "IP...
Stochastic fairness queuing scheduling scheme resolved the connection level fairness problem and are widely used in traditional network, however, with rapid development of P2P services in Internet, this classical algorithms failed in maintaining fairness among hosts. In this paper we proposed an improved SFQ algorithm: Dual Class SFQ to ensure the fairness among hosts using different type of services...
Nowadays 3D chips are fabricated by stacking 2D layers and manufacturing vertical links between them. In this paper we present a routing scheme suited for 3D networks-on-chip (NoCs). It is based on the reuse of existing routing schemes for 2D NoCs. Our 3D scheme is scalable and can be used with any 2D topology. The effectiveness of the scheme for intra-layer communication is given by the respective...
In wireless sensor networks, most of the existing key management schemes, establish shared keys for all pairs of neighbor sensors without considering the communication between these nodes. This results in causing huge overhead. For large scale WSNs, these schemes still need each sensor to be loaded with a bulky amount of keys. In many-to-one traffic pattern of sensor networks, large numbers of sensor...
Wireless sensor networks (WSN) can increase the efficiency of many real-life applications through the collaboration of thousands of miniaturized sensors which can be deployed unattended in inhospitable environments. Due to the harsh surroundings and violent nature of the applications, the network sometimes suffers a large scale damage that involves many nodes and would thus create multiple disjoint...
The performance of multi-radio multi-channel wireless mesh networks (WMNs) based on the IEEE 802.11 technology depends significantly on how the channels are assigned to the radios and how traffic is routed between the access points and the gateways. In this paper we propose an algorithmic approach to this problem, for which no conclusive solution has been put forward in the literature so far. The...
An important traffic engineering problem for OSPF networks is the determination of optimal link weights. In this paper, we assume that the traffic matrix, which specifies traffic load between every source-destination pair in the network, is unknown and varies with time, but that always lies inside an explicitly defined region. Our goal is to compute an optimal link weights that minimizes maximum link...
Multicast conferencing is a rapidly-growing area of Internet use. Audio, video and other media such as shared whiteboard data can be distributed efficiently between groups of conference participants using multicast algorithms that minimize the amount of traffic sent over the network. This is far more effective than systems that maintain a separate link between each participant. On the other hand Peer-to-Peer...
Routing in mobile ad hoc networks (MANETs) is central to their proper functioning. Mobility in such networks makes the routing a real challenging task. Routes validity plays a central leveraging mission to enhance network performances. Forwarding through incorrect routes not only results in traffic wandering inside the network without ever being able to be delivered to their ultimate destinations...
Traffic matrix is important for many network design, engineering, and management functions. However they are often difficult to measure directly. Because networks are dynamic, analysis tools must be adaptive and computationally light weight. In order to estimate the traffic matrix for whole network, a novel calculating model is proposed based the genetic algorithm (GA). Firstly, a generalized inverse...
MPLS has become an increasingly common technology for guaranteed transport services for carrying customer traffic. We consider the survivable design problem from the perspective of an MPLS VPN network provider where the data rate required is dynamically configurable based on customers' traffic demands. Network optimization formulations for global design and end-to-end fast reroute design are presented...
We describe the architecture of PHAROS (Petabit Highly-Agile Robust Optical System), developed under the DARPA CORONET program. PHAROS provides traffic engineering, resource management and signaling solutions for highly-agile, large-capacity core optical networks. PHAROS technology facilitates rapid configuration of network resources to address dynamic traffic needs in future global military and commercial...
Despite ??airborne network (AN) topology design?? and careful planning of AN trajectories, unexpected disruptions (from hardware failures to changes in mission requirements and hostile attacks) may cause nodes not to connect to one another directly or indirectly either because they are out of one another's range or because nodes do not meet one another according to their preplanned trajectories. Since...
The random nature of unstructured P2P overlays imbues them with enhanced self-* properties. Most of the algorithms which make searching in unstructured P2P systems scalable, such as dynamic querying and 1-hop replication, rely on the random nature of the overlay to function efficiently. However, they do not take into account the structure of the underlying physical communications network, which is...
Existing algorithms for utilizing high-capacity nodes in heterogeneous P2P systems (e.g.) often require unrealistically large node degree and high maintenance overhead in P2P networks with highly diverse node capacities and high churn. In this paper, we propose an unstructured P2P system that addresses these issues. We first prove that the overall throughput of search queries in a heterogeneous network...
In delay tolerant networks (DTNs), message ferries exploit controlled mobility to forward messages following specific routes. One of the key challenges is how to design ferry routes to achieve desired connectivity properties and store-and-forward performance. There are some attempts at designing appropriate ferry routes, but the region topology, which denotes the adjacency relationships of ferry regions...
In this paper we propose a new approach to designing a large scale wireless sensor network (WSN) with a cluster-tree topology. Sensors in each cluster communicate directly with their associated cluster head (CH) through contention-based transmissions, and communications between CHs use contention free transmissions. The objective is to balance the energy consumptions of all the CHs, while providing...
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.