Mobile Agents Based Load Balancing Method for Parallel Applications

Thant, Hninn Aye; San, Khaing Moe; Tun, Khin Mar Lar; Naing, Thinn Thu; Thein, Ni Lar

doi:10.1109/apsitt.2005.203634

Cited by 21 publications

(10 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We note that the complexity of each iteration is dominated by the derivations of (16). Based on the rules of counting floating point operations (flops) [37], we obtain the complexity of ( 16) as O 1.5K 2 + 24.5K − 13 flops. Then, the total complexity of the algorithm is equal to the product of the number of iterations and the complexity of each iteration, which is given by O 1.5K 2 + 24.5K − 13 log 2…”

Section: St (15b) (15c) (15d) and (19c) (25b)mentioning

confidence: 99%

On the Design of Secure Non-Orthogonal Multiple Access Systems

Liu

Yang

et al. 2017

IEEE J. Select. Areas Commun.

201

143

View full text Add to dashboard Cite

This paper proposes a new design of non-orthogonal multiple access (NOMA) under secrecy considerations. We focus on a NOMA system where a transmitter sends confidential messages to multiple users in the presence of an external eavesdropper. The optimal designs of decoding order, transmission rates, and power allocated to each user are investigated. Considering the practical passive eavesdropping scenario where the instantaneous channel state of the eavesdropper is unknown, we adopt the secrecy outage probability as the secrecy metric. We first consider the problem of minimizing the transmit power subject to the secrecy outage and quality of service constraints, and derive the closed-form solution to this problem. We then explore the problem of maximizing the minimum confidential information rate among users subject to the secrecy outage and transmit power constraints, and provide an iterative algorithm to solve this problem. We find that the secrecy outage constraint in the studied problems does not change the optimal decoding order for NOMA, and one should increase the power allocated to the user whose channel is relatively bad when the secrecy constraint becomes more stringent. Finally, we show the advantage of NOMA over orthogonal multiple access in the studied problems both analytically and numerically.Index Terms-Physical layer security, non-orthogonal multiple access, secrecy outage probability, power allocation.

show abstract

Section: St (15b) (15c) (15d) and (19c) (25b)mentioning

confidence: 99%

On the Design of Secure Non-Orthogonal Multiple Access Systems

Liu

Yang

et al. 2017

IEEE J. Select. Areas Commun.

201

143

View full text Add to dashboard Cite

show abstract

“…framework abstraction no framework agents based [22](*), [42], [39], [35] [16], [38](*), [24], [19] without agents [3], [2] [17], [45], [25], [34], [31] [46], [43], [44](*), [33] The above table gives another type of classification according to the criterion whether an approach uses agents or not ([11] identifies essentials of different multi-agent architectural styles (MAS) and shows how MAS can be characterized and evaluated), as well as whether an approach introduces a general framework (taking in the consideration both structured P2P and unstructured P2P net-works as well as grid). Those papers that use a very specific LB algorithm are marked with "(*)".…”

Section: Classification Of Lb Algorithmsmentioning

confidence: 99%

A Space-Based Generic Pattern for Self-Initiative Load Balancing Agents

Kühn

Šešum-Čavić

2009

Engineering Societies in the Agents World X

View full text Add to dashboard Cite

Load-Balancing is a significant problem in heterogeneous distributed systems. There exist many load balancing algorithms, however, most approaches are very problem specific oriented and a comparison is therefore complex. This paper proposes a generic architectural pattern for a load balancing framework that allows for the plugging of different load balancing algorithms, reaching from unintelligent to intelligent ones, to ease the selection of the best algorithm for a certain problem scenario. As in complex network environments there is no "one-fits-all solution", also the integration of several different algorithms shall be supported. The presented pattern assumes autonomous agents and decentralized control. It can be composed towards arbitrary network topologies, foresees exchangeable policies for load-balancing, and uses a black-board based communication mechanism to achieve high software architecture agility. The pattern has been implemented and first instantiations of it with three algorithms have been benchmarked.

show abstract

“…Mobile agents are suitable for applications that need [4]: code executed close to the data (e.g., for hospital legal issues [5]), fault tolerance (dealing with network failure or other issues [6]), task delegation, asynchronous processing (e.g., nomadic computing [7]), flexibility (e.g., interaction with different interfaces [8] and different environments [9]), and/or parallelism (e.g., load balancing [10]). …”

Section: Introductionmentioning

confidence: 99%

“…9 resume action IPMS ontology.Description The AMM agent issues a resume request to resume the agent execution in the remote platformTable F 10. Refuse exception predicates IPMS ontology.Set of term Protocols on the list are mandatoryprotocolcombinationSet of term Protocols on the list are the combinations allowed ma-system-notsupported String Mobile agent system indicated is not supported ma-os-notsupportedTable F.11 Failure exception predicates IPMS ontology.Table F.12 mobile-agent-description concept IPMS ontology.…”

mentioning

confidence: 99%