Adaptive agent driven routing in communication networks: comparison with a classical approach

1999 ◽  
Vol 02 (03) ◽  
pp. 209-219 ◽  
Author(s):  
Martin Heusse ◽  
Dominique Snyers ◽  
Yvon Kermarrec
Keyword(s):  
Load Balancing ◽  
Complex Systems ◽  
Communication Networks ◽  
Classical Approach ◽  
New Approach ◽  
Adaptive Agent ◽  
Quality Of Delivery

This paper follows an earlier publication in the Advances in Complex Systems journal (Heusse et al., 1998) where we presented a new algorithm based on collaborative agents for routing in communication networks. In this document, we shall investigate its load-balancing capability. This capability is required as a first step to achieve quality of delivery and service. We also compare our new approach to the classical ones and discuss their respective benefits.

Adaptive Agent-Driven Routing and Load Balancing in Communication Networks

1998 ◽  
Vol 01 (02n03) ◽  
pp. 237-254 ◽  
Author(s):  
Martin Heusse ◽  
Dominique Snyers ◽  
Sylvain Guérin ◽  
Pascale Kuntz
Keyword(s):  
Load Balancing ◽  
Communication Networks ◽  
Traffic Condition ◽  
Link State ◽  
New Family ◽  
Traffic Loads ◽  
Adaptive Agent ◽  
Simulated Network ◽  
Routing Tables ◽  
New Algorithms

This paper presents an unified overview of a new family of distributed algortithms for routing and load balancing in dynamic communication networks. These new algorithms are described as an extension to the classical routing algorithms: they combine the ideas of online asynchronous distance vector routing with adaptive link state routing. Estimates of the current traffic condition and link costs are measured by sending routing agents in the network that mix with the regular information packets and keep track of the costs (e.g. delay) encountered during their journey. The routing tables are then regularly updated based on that information without any central control nor complete knowledge of the network topology. Two new algorithms are proposed here. The first one is based on round trip routing agents that update the routing tables by backtracking their way after having reached the destination. The second one relies on forward agents that update the routing tables directly as they move toward their destination. An efficient co-operative scheme is proposed to deal with asymmetric connections. All these methods are compared on a simulated network with various traffic loads; the robustness of the new algorithms to network changes is proved on various dynamic scenarii.

scholarly journals Design and Performance Analysis of a New Framework of Multipath Load Balancing Routing in Ad-Hoc Network

2019 ◽  
Vol 8 (4) ◽  
pp. 12773-12778
Keyword(s):  
Load Balancing ◽  
Communication Networks ◽  
Network Performance ◽  
Ad Hoc ◽  
Multipath Routing ◽  
Buffer Size ◽  
Route Information ◽  
Load Balancing Algorithm ◽  
And Performance

In the communication networks, one of the major problems in the quality of service is congestion. Indeed, the phenomenon of congestion is due to the fact that many packets emitted follow the same paths. As a result, the increase the bandwidth offered can solve the problem only in the short term. In order to solve this problem, several solutions have been proposed, such as multipath routing algorithms, which distribute traffic between a source and a destination on several different paths, while taking into account the level of saturation of the intermediaries nodes, composing the different paths with a objective to avoid cluttered paths. Its purpose is to shed the excessive burden save a knot on its neighbors to improve performance and to exploit efficiently. In this paper we have analysis the load balancing in Multipath routing to achieve better network performance. We have study and reviewed the different load balancing algorithm in multipath network and based on review we have proposed a new load balancing algorithm in the multipath network. We have modified the packet of RREP and RREQ packet to transmit and receive the route information to compute the load of every path and we added a new field in RREP packet Buffer size to store the current node and their neighbor information to find the alternate route if network load in increase we have compare the performance of proposed protocol with the LB-AOMDV, SMR & AOMDV multipath routing protocols. NS2 is used for simulation

scholarly journals DeNASA: Destination-Naive AS-Awareness in Anonymous Communications

2016 ◽  
Vol 2016 (4) ◽  
pp. 356-372 ◽  
Author(s):  
Armon Barton ◽  
Matthew Wright
Keyword(s):  
Quality Of Service ◽  
Load Balancing ◽  
Relay Selection ◽  
Path Selection ◽  
The Other ◽  
Selection Algorithm ◽  
Anonymous Communications ◽  
New Approach ◽  
Tier 1

Abstract Prior approaches to AS-aware path selection in Tor do not consider node bandwidth or the other characteristics that Tor uses to ensure load balancing and quality of service. Further, since the AS path from the client’s exit to her destination can only be inferred once the destination is known, the prior approaches may have problems constructing circuits in advance, which is important for Tor performance. In this paper, we propose and evaluate DeNASA, a new approach to AS-aware path selection that is destination-naive, in that it does not need to know the client’s destination to pick paths, and that takes advantage of Tor’s circuit selection algorithm. To this end, we first identify the most probable ASes to be traversed by Tor streams. We call this set of ASes the Suspect AS list and find that it consists of eight highest ranking Tier 1 ASes. Then, we test the accuracy of Qiu and Gao AS-level path inference on identifying the presence of these ASes in the path, and we show that inference accuracy is 90%. We develop an AS-aware algorithm called DeNASA that uses Qiu and Gao inference to avoid Suspect ASes. DeNASA reduces Tor stream vulnerability by 74%. We also show that DeNASA has performance similar to Tor. Due to the destination-naive property, time to first byte (TTFB) is close to Tor’s, and due to leveraging Tor’s bandwidth-weighted relay selection, time to last byte (TTLB) is also similar to Tor’s.

Measuring and monitoring outputs in social care: the problem of measuring quality

2008 ◽  
Vol 74 (4) ◽  
pp. 535-553 ◽  
Author(s):  
Juliette Malley ◽  
Ann Netten
Keyword(s):  
User Satisfaction ◽  
Social Care ◽  
Quality Of Services ◽  
New Approach ◽  
Care Services ◽  
Quality Of Delivery ◽  
Key Issues ◽  
The Impact ◽  
Monitoring Quality

The focus of this article is the measurement of quality within the context of a new approach to measuring government-funded social care services. The approach builds on principles set out in a UK review led by Professor Sir Tony Atkinson. At its heart are the concepts of capacity for benefit, describing the potential benefit to users from services, and quality, reflecting the extent to which the benefit is realized. We report on a study designed to explore the suitability of a weighted user satisfaction measure to measure quality, examining in particular its sensitivity to changes in the quality of social care over time. The study finds some problems with using weighted user satisfaction. We discuss potential reasons for these problems, including the possibility of gaming and the specification of the measure, and discuss a way forward in the context of the requirement to draw upon routine sources of data. Points for practitioners The article describes a practical approach to measuring and monitoring outcomes and productivity in social care. Routine measures are used as far as possible, weighted to reflect outcomes for services users. The concepts of Capacity for Benefit and quality in this context potentially allow commissioners and managers to distinguish the impact on productivity of: the potential of services as they are currently configured, the dependency of service users, and the quality of delivery. The article identifies key issues and problems in using measures of satisfaction both as performance indicators and monitoring quality of services in the proposed approach.

Simulation modeling of packet switching network segment functioning

2019 ◽  
pp. 75-82
Author(s):  
D. V. Shelkovoy ◽  
A. A. Chernikov
Keyword(s):  
Quality Of Service ◽  
Communication Networks ◽  
Simulation Modeling ◽  
Data Stream ◽  
Switching Network ◽  
Data Packets ◽  
Channel Resource ◽  
Switching Node ◽  
Joint Examination

The testing results of required channel resource mathematical estimating models for the for serving the proposed multimedia load in packet-switched communication networks are presented in the article. The assessment of the attainable level of quality of service at the level of data packet transportation was carried out by means of simulation modeling of the functioning of a switching node of a communication network. The developed modeling algorithm differs from the existing ones by taking into account the introduced delay for processing each data stream packet arriving at the switching node, depending on the size of the reserved buffer and the channel resource for its maintenance. A joint examination of the probability of packet loss and the introduced delay in the processing of data packets in the border router allows a comprehensive assessment of the quality of service «end to end», which in turn allows you to get more accurate values of the effective data transmitted rate by aggregating flows at the entrance to the transport network.

Guideline for the management of long tunnelled external ventricular drains in chronic hydrocephalus

2021 ◽  
Vol 30 (7) ◽  
pp. 416-421
Author(s):  
Phillip Correia Copley ◽  
John Emelifeonwu ◽  
Pasquale Gallo ◽  
Drahoslav Sokol ◽  
Jothy Kandasamy ◽  
...  
Keyword(s):  
Quality Of Life ◽  
Nursing Care ◽  
Pilocytic Astrocytoma ◽  
Parental Education ◽  
Chronic Hydrocephalus ◽  
Treatment Protocols ◽  
New Approach ◽  
Viable Treatment

This article reports on the journey of a child with an inoperable hypothalamic-origin pilocytic astrocytoma causing hydrocephalus, which was refractory to treatment with shunts, and required a new approach. With multidisciplinary support, excellent nursing care and parental education, the child's hydrocephalus was managed long term in the community with bilateral long-tunnelled external ventricular drains (LTEVDs). This article describes the patient's journey and highlights the treatment protocols that were created to achieve this feat. Despite the difficulties in initially setting up these protocols, they proved successful and thus the team managing the patient proposed that LTEVDs are a viable treatment option for children with hydrocephalus in the context of inoperable tumours to help maximise quality of life.

Sign in / Sign up

Export Citation Format

Share Document