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.
Router processing power in VSAT networks is a serious problem due to the huge amount of packets transferring between satellite links and terrestrial links. In this paper, we model power of core routers which are using OSPF and EIGRP protocols. The model can accurately predict the power consumption of the routers with a significant speedup. Also we determine the total number of routers required to...
System capacity is an important factor that affects the performance of WiMAX system where the amount of data that can be delivered to the end user is determined based on the system capacity and users QoS requirements. This scenario is even more complex when multi-hop relays are introduced into the network whereas the user access capacity decreases with the increase of hop number. In order to maintain...
System area networks (SANs), which usually employ virtual cut-through switching, have been used to connect hosts in modern PC clusters and massively parallel computers. In this paper, we propose a non-minimal fully adaptive deadlock-free routing mechanism for virtual-cut-through networks called “Semi-deflection”. Semi-deflection routing guarantees deadlock-free packet transfer without use of virtual...
The paper presents the Performance Analysis of Manhattan Street Network (MSN). Improvement of performance at the destination node by applying different buffering capacities at the routers is demonstrated. The results using NS2 simulator are produced. It can be concluded that the congestion and the packet drops can be reduced at the link node by appropriate size of buffer at the link node.
With the rapid advancements in wavelength-division multiplexing (WDM) technology, the capacity of optical fibers is increasing considerably. Traffic streams from users generally have a data-rate that is far less than the bandwidth of optical fibers or that of a lightpath in optical fibers. Traffic grooming can be used to group the traffic streams from various users and match to the data-rate of a...
Controller Area Network (CAN) provides an inexpensive and robust network technology in many application domains. However, the use of CAN is constrained by limitations with respect to fault isolation, bandwidth, wire length, namespaces and diagnosis. This paper presents a solution to overcome these limitations by replacing the CAN bus with a star topology. We introduce a CAN router that detects and...
A heuristic algorithm based on token-ring is proposed for Group Multicast Routing and Wavelength Assignment (GM-RWA) in OVPN and the simulation result shows its performance in the number of wavelength channels used.
An established Intelligent Power Management (IPM) strategy for a Wireless Sensor Network (WSN) is based on the principal that redundant nodes can be hibernated to conserve their energy. Due to the hibernation, sensed data from the node will be unavailable, which essentially means that the WSN will be blind in the vicinity of the hibernating node. Numerous strategies have been proposed to maintain...
Most of the Quality of Service (QoS) routing mechanisms involve periodic exchange of global state information which causes communication overheads. Therefore, localised routing is the method to avoid this problem. The network in this technique is inferred by the source nodes using statistics which are collected locally. The main aim of this paper is to present new localised algorithm to avoid some...
The flattened butterfly is known to be a cost efficient topology for high-radix networks. Because of its inherent path diversity, it is able to provide comparable cost/performance with the Clos network in adversarial traffic conditions. However, the flattened butterfly is a blocking network and this blocking behavior can degrade the performance of the network when all the I/O devices are transmitting...
Multi-domain traffic engineering is a major focus area for carriers and crankback signaling offers a very promising alternative. However, even though various crankback studies have been done, there remains significant latitude for improved multi-domain designs. To address these challenges, this work develops a novel solution for intra/inter-domain signaling crankback in IP/MPLS networks. Namely, dynamic...
Mapping and dynamic routing in a wireless network are essential and basic operations that are the prerequisites for all higher order interactions between nodes on that network. The Intent of network mapping by multi mobile software agents is to obtain the topology of network in a distributed manner. In this paper we examine how software agents can wander in an unknown Ad hoc network with cooperation...
In this paper, we will study a special Connected Dominating Set (CDS) problem - between any two nodes in a network, there exists at least one shortest path, all of whose intermediate nodes should be included in a special CDS, named Minimum rOuting Cost CDS (MOC-CDS). Therefore, routing by MOC-CDS can guarantee that each routing path between any pair of nodes is also the shortest path in the network...
Although significant efforts have been devoted in the literature to measurements of the Internet topology, little attention has been given to the qualification of routing deviations and multipath dynamics at the Autonomous System (AS) routing level. We observed Internet AS-level routes toward thousands of destinations for several weeks between 2009 and 2010 to have a better understanding of these...
In large multi-domain networks, topology aggregation - besides assuring scalability - has a side-effect as it introduces undesired inaccuracies in the routing information. Such inaccuracy affects the efficiency of routing. In this paper, with the application of a threshold-based aggregation model, the relation between scalability and routing efficiency has been examined by evaluating two different...
This paper presents and compares different TE information dissemination strategies between Path Computation Elements (PCEs) in multi-domain optical networks. In such network context, recent studies have found that path computation only with local domain visibility yields poor network performance. Accordingly, certain visibility between domains seems necessary. Aiming to fit the confidentiality requirements...
This paper evaluates the impact of dual-link failures on single-link failure resilient networks, while physical layer constraints are taken into consideration during demand routing, as dual link failures and equivalent situations appear to be quite probable in core optical networks. In particular, a shared backup path protection scheme is used as a basis and an impairment-aware routing scheme is compared...
We propose to use an iterative heuristic for the shortest path routing in static RWA problem of optical networks. The heuristic's performance is compared, in terms of number of wavelengths, with the shortest Dijkstra's path algorithm. The results suggest that it is feasible to choose routes, among the shortest paths, minimizing the number of wavelengths. For all studied scenarios, the heuristic achieved...
We design a routing scheme based on an extension of the algebraic connectivity concept for cognitive radio ad hoc networks. We observe that a cognitive radio network topology and its connectivity are highly influenced by the behavior of the primary users. In some cases, even if the physical proximity of secondary nodes would give rise to a connected topology, the primary user behavior could impact...
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.