4,266 research outputs found
A Taxonomy of Self-configuring Service Discovery Systems
We analyze the fundamental concepts and issues in service
discovery. This analysis places service discovery in the context of distributed
systems by describing service discovery as a third generation
naming system. We also describe the essential architectures and the
functionalities in service discovery. We then proceed to show how service
discovery fits into a system, by characterizing operational aspects.
Subsequently, we describe how existing state of the art performs service
discovery, in relation to the operational aspects and functionalities, and
identify areas for improvement
TCP ā Random Early Detection (RED) mechanism for Congestion Control
This thesis discusses the Random Early Detection (RED) algorithm, proposed by Sally Floyd, used for congestion avoidance in computer networking, how existing algorithms compare to this approach and the configuration and implementation of the Weighted Random Early Detection (WRED) variation.
RED uses a probability approach in order to calculate the probability that a packet will be dropped before periods of high congestion, relative to the minimum and maximum queue threshold, average queue length, packet size and the number of packets since the last drop.
The motivation for this thesis has been the high QoS provided to current delay-sensitive applications such as Voice-over-IP (VoIP) by the incorporation of congestion avoidance algorithms derived from the original RED design [45]. The WRED variation of RED is not directly invoked on the VoIP class because congestion avoidance mechanisms are not configured for voice queues. WRED is instead used to prioritize other traffic classes in order to avoid congestion to provide and guarantee high quality of service for voice traffic [43][44].
The most notable simulations performed for the RED algorithm in comparison to the Tail Drop (TD) and Random Drop (RD) algorithms have been detailed in order to show that RED is much more advantageous in terms of congestion control in a network. The WRED, Flow RED (FRED) and Adaptive RED (ARED) variations of the RED algorithm have been detailed with emphasis on WRED. Details of the concepts of forwarding classes, output queues, traffic policies, traffic classes, class maps, schedulers, scheduler maps, and DSCP classification shows that the WRED feature is easily configurable on tier-1 vendor routers
Joint Dynamic Radio Resource Allocation and Mobility Load Balancing in 3GPP LTE Multi-Cell Network
Load imbalance, together with inefficient utilization of system resource, constitute major factors responsible for poor overall performance in Long Term Evolution (LTE) network. In this paper, a novel scheme of joint dynamic resource allocation and load balancing is proposed to achieve a balanced performance improvement in 3rd Generation Partnership Project (3GPP) LTE Self-Organizing Networks (SON). The new method which aims at maximizing network resource efficiency subject to inter-cell interference and intra-cell resource constraints is implemented in two steps. In the first step, an efficient resource allocation, including user scheduling and power assignment, is conducted in a distributed manner to serve as many users in the whole network as possible. In the second step, based on the resource allocation scheme, the optimization objective namely network resource efficiency can be calculated and load balancing is implemented by switching the user that can maximize the objective function. Lagrange Multipliers method and heuristic algorithm are used to resolve the formulated optimization problem. Simulation results show that our algorithm achieves better performance in terms of user throughput, fairness, load balancing index and unsatisfied user number compared with the traditional approach which takes resource allocation and load balancing into account, respectively
A Switch Architecture for Real-Time Multimedia Communications
In this paper we present a switch that can be used to transfer multimedia type of trafJic. The switch provides a guaranteed throughput and a bounded latency. We focus on the design of a prototype Switching Element using the new technology opportunities being offered today. The architecture meets the multimedia requirements but still has a low complexity and needs a minimum amount of hardware. A main item of this paper will be the background of the architectural design decisions made. These include the interconnection topology, buffer organization, routing and scheduling. The implementation of the switching fabric with FPGAs, allows us to experiment with switching mode, routing strategy and scheduling policy in a multimedia environment. The witching elements are interconnected in a Kautz topology. Kautz graphs have interesting properties such as: a small diametec the degree is independent of the network size, the network is fault-tolerant and has a simple routing algorithm
Analysing Mobile Random Early Detection for Congestion Control in Mobile Ad-hoc Network
This research paper suggests and analyse a technique for congestion control in mobile ad hoc networks. The technique is based on a new hybrid approach that uses clustering and queuing techniques. In clustering, in general cluster head transfers the data, following a queuing method based on a RED (Random Early Detection), the mobile environment makes it Mobile RED (or MRED), It majorly depends upon mobility of nodes and mobile environments leads to unpredictable queue size. To simulate this technique, the Network Simulator 2 (or NS2) is used for various scenarios. The simulated results are compared with NRED (Neighbourhood Random Early Detection) queuing technique of congestion control. It has been observed that the results are improved using MRED comparatively
GA-PSO-Optimized Neural-Based Control Scheme for Adaptive Congestion Control to Improve Performance in Multimedia Applications
Active queue control aims to improve the overall communication network
throughput while providing lower delay and small packet loss rate. The basic
idea is to actively trigger packet dropping (or marking provided by explicit
congestion notification (ECN)) before buffer overflow. In this paper, two
artificial neural networks (ANN)-based control schemes are proposed for
adaptive queue control in TCP communication networks. The structure of these
controllers is optimized using genetic algorithm (GA) and the output weights of
ANNs are optimized using particle swarm optimization (PSO) algorithm. The
controllers are radial bias function (RBF)-based, but to improve the robustness
of RBF controller, an error-integral term is added to RBF equation in the
second scheme. Experimental results show that GA- PSO-optimized improved RBF
(I-RBF) model controls network congestion effectively in terms of link
utilization with a low packet loss rate and outperform Drop Tail,
proportional-integral (PI), random exponential marking (REM), and adaptive
random early detection (ARED) controllers.Comment: arXiv admin note: text overlap with arXiv:1711.0635
- ā¦