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.
Although Tor is the most widely used overlay for providing anonymity services, its users often experience very high delays. Because much of Tor usage is for Web applications, which are sensitive to latency, it is critical to reduce delays in Tor. To take an important step in this direction, we seek an in-depth understanding of delays in Tor. By taking snapshots of the entire Tor network within a short...
Congestion control is the key techniques of Next-Generation-Networks. The classical TCP congestion control such as RED is difficult to configure parameters and the average queue length is related to the load level. A network-measurement based on congestion control algorithm is proposed, the essential idea is introduce macroscopic guidance according to network measurement, the measurement facilities...
An admission control Algorithm must organize among flows and should afford assurance of how the medium is shared between nodes. In a wired network, nodes can keep an eye on the medium to see how much bandwidth is being used by the network. On the other hand, in an Ad-Hoc network, during communication nodes possibly will use the bandwidth of neighbouring nodes. Consequently, the bandwidth consumption...
The design of telecommunication network concerns the selection of arcs in a graph with involved cost as low as possible, but satisfies constraints such as point-to-point demands routed across the network, arc capacity, hop constraints and so on. Such a design must allocate enough flows and diverse routing paths through the network to ensure that feasible information flows continue to exist, even when...
The technology of MultiProtocol Label Switching (MPLS) represents one of the most advanced ways how to optimize the packet-forwarding process in routers. In addition, MPLS also offers new possibilities of resource sharing, important from the point of view of service differentiation and quality of service (QoS) support. The aim of the paper is to present the results of our investigation into the efficiency...
Group multicasting is a kind of communication mechanism whereby each member of a group sends messages to all the other members of the same group. It is more important for group multicast routing algorithms to manage the resources efficiently and satisfy the QoS (Quality-of-Service) requirements of each individual application. In this paper, we proposed two routing algorithms for group multicast with...
This research work focuses on Integer Linear Programming (ILP) formulations for the Routing and Wavelength Assignment (RWA) problem in Wavelength Division Multiplexed (WDM) networks where end-users communicate with each other by establishing all-optical, non-interfering wavelength channels which are referred as lightpaths. The RWA problem is reducible to Graph Coloring problem in polynomial time and...
In this paper, we investigate the design and performance of multi-path routing in optical wavelength division multiplexed (WDM) networks, that support traffic grooming. A circuit-switched network is considered, where connection requests arriving to the network have to be allotted an end-to-end path carrying the requested bandwidth. Traffic grooming implies that the capacity of a wavelength on a fiber...
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.
Queue scheduling algorithm achieves the assignment of the network resource through scheduling strategy, the reserved bandwidth and delaytime can be guaranteed, then the router select the next packet waiting for forwarding from one or more queues based on some rules, All input network services can share the output bandwidth according to reserved way, to have corresponding resource, and to meet service...
The emergence of multimedia applications demands multicasting in MANETs. For such applications QoS provisioning is a complex and challenging issue. This paper proposes a QoS aware multicast routing scheme uses a set of static and mobile agents and ensures QoS guarantees in terms of bandwidth reservation, delay constraint, delay-jitter constraint and packet loss to multicast session. Here the mobile...
In this paper, the optimized routing or relay selection is discussed for the Cooperative Communication wireless networks. The whole network system performance or Quality of Service (QoS) can not be achieved without the optimal selection of the relay nodes. For this paper, the network performance is analyzed for m number of relays for n number of source nodes. The simulation results are measured by...
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.
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 paper presents the Comparison analysis of Manhattan Street Network (MSN). Improvement of performance at the destination node by applying different types of buffer 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 selection of buffer type at the link node.
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...
High speed Internet routers and switches require fast packet buffer to hold packets during times of congestion. These buffers usually use a memory hierarchy that consist of expensive but fast SRAM and cheap but slow DRAM to meet both, speed and capacity requirements. A challenge building these packet buffers is to provide deterministic bandwidth guarantee under any traffic condition. We propose a...
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...
Energy-efficient transportation of periodical sensor readings towards a single sink in wireless sensor networks is a challenging task. In general, two data-gathering strategies exist: on-demand and bulk data forwarding. For both strategies, cross-layer techniques are a promising approach, where TDMA is tailored to the underlying routing tree. Therefore, different TDMA schemes are compared regarding...
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.