|
|
- Darcy Harper
- 8 years ago
- Views:
Transcription
1 MULTI-AGENT SYSTEM FOR DECENTRALIZED COMPUTER NETWORK MANAGEMENT Krzysztof Cetnarowicz Jaros law Kozlak Institute of Computer Science, AGH - University of Mining and Metallurgy Al. Mickiewicza 30, Krakow, Poland cetnar@agh.edu.pl Abstract: Structure of the network becomes more and more complicated. Optimal management of a structure of a complex network becomes a dicult, work-consuming and costly task. A concept of a system being a module of a distributed operating system was presented in the paper. The module working as a decentralized multiagent system carries out current monitoring of protabilityofallnetwork connections. It takes advantage of abilities of mobile agents to negotiate and build plans of common enterprises, and realizes on-line (in real-time), self-acting reconguration of a network structure. As a result, we obtain a computer network that follows on its own, communication needs in the optimal manner. Copyright c 2000 IFAC. Keywords: multi-agent management, decentralized systems, computer networks, intelligent control, interaction mechanisms 1. INTRODUCTION The development of the computer network makes new tasks, such as optimal network designing, ecient and safe computer and network management more and more complex and dicult. These tasks should be supported in their realization by computer systems or even totally managed by them. It seems that due to a distributed character of the computer network, the above-mentioned tasks would be best managed by decentralized systems realized as multi-agent systems. Attempts at realizing such systems improving the process of packet routing in the computer network can be found in the papers of (Gibney and Jennings, 1998). An optimal movement of packets in the network depends on a proper routing which can make use of the current network structure in an optimal way. A proper choice of the network structure has a basic inuence on the eectiveness of activity. Consequently, it seems that multi-agent systems can be used for a more complex computer network management by means of eective packet routing but the evolution of the computer network must be steered dynamically, thus adapting its structure to the current needs. The computer system would then perform a double function of an automatic adaptation of the network to concrete needs of computer users (i.e. dynamic designing of the computer network structure) and an optimal use of the existing structure by means of decentralized packet routing. The second important task of the computer network management is to exploit such network safely. Due to its resistance to damage the capability to adapt to changing functioning conditions of the network, the multi-agent system can protect the computer network in an ecient way. The above tasks can be realized by a multi-agent decentralized system for computer management,
2 Fig. 1. Schema of the multi-agent system for network management in which agents base decision making processes on market mechanisms. 2. PRINCIPLES OF FUNCTIONING OF DECENTRALIZED SYSTEM MANAGING COMPUTER NETWORK To develop the multi-agent managing system for the computer network wehavetotake a particular point of view to consider the network as an environment for the agents population. The environment considered (computer network) should fulll the following features (g. 1): features of hardware: Network has a form of directed graph that consists of nodes and edges. Computers make nodes the former ones are able to store the sent information (packets). Edges make links between computers that enable sending information (packets) features of local nodes system's software: Nodes are responsible for directing packets in the network (the so-called routing), choosing a further optimal way according to the assumed criterion (in the current state - the fastest way). After choosing a way,apacket is directed to an appropriate edge. Through the intermediary of the edge, a packet reaches an appropriate (chosen by routing process) neighboring node. Network management system is based on the essential principle that denes conditions of a sending packet between the nodes. Sending of a packet follows the assumption that a packet pays for sending through every edge between the nodes. Therefore a packet is considered as a special agent (Agent - Packet Transporter - PT). Its task is to transport the entrusted information, from the source node to the destination node in given conditions (Cetnarowicz et al., 1999). The conditions (the quickest, the cheapest transport, etc.) are known to a given agent PT and are a basis for realizing a routing process. The payment may be done directly: For the purpose, each node (exactly - output port on an edge) has a bank account opened. Appropriate sums may be paid into the account by network Each packet which is to be sent in network has its account at (its own) bank and transfers an appropriate payment for sending, to an account of a sending port. Agents authorized to use the said bank accounts may perform all operations on the accounts with the intermediary of network operations. indirectly: In a simplied case, a sending port obtains a generalized payment in a form of some number of (stipulated) points. The number of points collected makes evidence on activity of a given port, and what follows - a given connection (an edge in a graph). The points collected may then be changed into cash and transferred from the funds, (e.g. centrally xed), planned to be spent on network functioning. The payments make a basis for market oriented decisions related to modications (extension, decrease) of certain parts of a network. Decision are undertaken and then realized by the multi-agent system managing the network. 3. MULTI-AGENT SYSTEM MANAGING THE NETWORK The multi-agent system consists of two main parts: a population of dierent kinds of agents and the environment in which the agents work. The environment is determined by the computer network and may be considered as particular graph (Fig. 1). There are the following types of agents in the system: Network Service agent that provides the interface between application in the systems and creates the Packet Carrier agent. Router agent that provides the routing process. Router Messenger agent that transfers routing information around the network.
3 If the negotiations are completed successfully the agent Investor-Proxy realizes the connection placing order for the appropriate service with the appropriate company. 4. INTERACTIONS IN THE MULTI-AGENT SYSTEM FOR COMPUTER NETWORK MANAGEMENT Fig. 2. Schema of the network where the agent undertake action to establish new connection Gate agent that makes possible for agents to leaveagiven node to reach the neighboring one. Packet Carrier agent that provides a transport of a given packet from the sender to the receiver node Linker agent that collects necessary information around the network (or its part) to enable detection of a problem of trac in the network. Investor agent that enables to undertake decisions with investment in the network (extension or reduction of connections, hosts etc.). Investor Proxy agent that participates in negotiations concerning investments in the network. The decisions concerning investments in the network (which results in the network modications) are settled as a result of negotiations among Investors and Investor Proxy agents. We can consider that host gate G 12 linking the host H 1 with the host H 2 nds that it is overloaded (it means that the connection between H 1 and H 2 has insucient transfer rate). A scenario of the action undertaken by agents to establish a new connection (or to raise data-transfer rate) may consists of the following steps (g. 2): Gate (port) G 12 at the host H 1 linking it with the host H 2 is overloaded and the agent Gate corresponding to the gate G 12 creates the agent Linker that is sent tothehosth 2. At the host H 2 the agent Linker veries the trac sent by the gate G 23 linking the host H 2 with the host H 3. If the trac from the host H 1 to the host H 3 going via the host H 2 is to heavy the agent Linker goes back to the host H 1 with a proposition to create a direct link between the hosts H 1 and H 3. This proposition is paid to the Investor agent at the host H 1. Investor agent at the host H 1 builds the nancial project of the enterprise, and sends the Investor-Proxy agent to the host H 3 to negotiate its participation in the project. 4.1 Introduction. An interaction protocol is a set of rules of interaction that describes what action each agent can take ateach time. In this chapter typical interaction protocols used in the multi-agent systems are presented, then a presentation is given how these protocols can be applied for the interactions in the system for the computer network management, which was presented in the previous chapter. 4.2 The choice of the interactions protocols used in the multi-agent systems. Contract net. Its idea is based on the mechanism of contracting, used in business (Smith, 1980). There are two roles of the agents in the protocol: manager { agent, which orders the realization of the task. It performs the following steps: the announcement of the needs of realization of the task, the reception and estimation of the proposition from the potential executors of the task, notication of the chosen executor, reception of the task performed and its processing, contractors { the agents { potential executors of the task. They perform the following steps: reception of the demand to perform the task, the evaluation of their capacities to perform the task, the answer (notication of the proposition or rejection), execution of the task if the proposition was accepted and sending the results received. Voting In some situations the agents can perform voting on the certain decisions. The result of the voting is obligatory for all agents participating in the voting. In (Sandholm, 1999) are presented some protocols of voting: plurality protocol. All propositions are evaluated simultaneously and the proposition accepted by the maximal quantity of agents wins. binary protocol. The propositions are evaluated in pairs. The one, which gets the minority of votes is rejected and the one which
4 receives the majority is accepted in the next voting. Bord's protocol. Each agent votes for the list of propositions. Each position on the list is associated with the value. After the negotiations the values from the lists of all agents are added up and the proposition which gets the best value from all agents wins. Auctions The exchange of goods between the agents may be realized by auction. The agents participating in the auction can perform one of the followings roles: auctioneer, participant of the auction. There are many dierent protocols of auctions which are associated with particular strategies of the agents. On the basis of an overview from (Sandholm, 1996) we canenumerate: English (rst-price open cry) auction The auctioneer proposes the initial price, the following participants have to make higher and higher bids. The goods goes to the participant, who oers the highest price. Dutch (descending) auction.the auctioneer oers a high price and then limits it progressively. The auction is won by the participant who is the rst to accept the proposed price. rst-price sealed-bid auction. The participants of the auction in secret deliver their prices oers to the auctioneer. The one who proposes the highest price wins and pays the price proposed by him. Vickrey auction (second-price sealed-bid). Similar to the previous kind of auction, but the winner pays the price not proposed by him, but the second proposed price. all-pay auction. All participants of the auction pay the prices oered by them, independently of the fact whether they win the auction or not. There is some modication of this auction - the participants who do not win the auction pay only some part of their oers. Market interactions The interactions based on the market approach have several advantages such as well analyzed (in economic science) theory and alow cost of communication. There are two kinds of agents in the system: producers and consumers. Producers transform the goods using technologies they have and the consumers put demands for the goods needed and their decisions are undertaken on the basis of their utility function (Wellman, 1996 Cheng and Wellman, 1997). The market approach was used for creation of the systems strictly connected with the management of the network: the system for analysis of the distributed multi-commodity ow problem (Wellman, 1993), nding the optimal localization of the mirrors of services in the Internet (Mullen and Wellman, 1995), system of routing of the packages in the Internet based on market mechanisms (Gibney and Jennings, 1998). 4.3 The types of the interactions in the multi-agent system for the management of the computer network. Introduction This sub-chapter will analyze, what interactions protocols can be chosen for particular tasks of the network management system. We concentrate on the following problems: choosing the Gate by PacketCarrier, which enables the best quality of the connection (using the criterion based on the cost and/or the performance of the link), gaining information about the state of the network, adding or removing the links to/from the network by Investor and Investor Proxy. Choosing the Gate by PacketCarrier The process of the choosing the Gate by thepacketcar- rrier may be realized using the following interactions protocols: Contract Net { Packet Carrier informs all Gates on the Node that it wants to transfer to a particular location in the Internet. The Gates inform what price it has to pay for the links, and what are other properties of the link (length, bandwidth etc.) The PacketCarrier chooses the best Gate from its point of view. voting { The PacketCarriers vote which link to choose and which link they acknowledge to be the best. auction { If the network is heavily loaded the PacketCarriers can take part in the auctions of bandwidth oered by the Gates. The opposite situation is also possible { the agent PacketCarrier demand to buy the permission to translocate by one of the Gates and the Gates participate in the auction oering lower and lower prices. The PacketCarrier chooses the lowest price. This algorithm may be used if the network is currently not much loaded.
5 market { The complex negotiation of the cost of the links between AgentCarriers (consumers) and Gate (producers) can be implemented using a market model. Gaining the information about the state of the network. Linker can gain the information about the state of the network using the following interaction protocols: Contract Net { Linker announces that it wants to buy information about the state of the network. The group of the nodes can send their propositions concerning the quality and the costs of the possessed information. Market { Linker and Gates take part in the exchange of the information about the structure of the network. The prices of the information are set by the market. The modication of the structure of the network - adding or removing the links The modication of the structure of the network by adding or removing the links can be performed using the following interaction protocols: Auction { Agents Investors take part in the auction of adding a new link to the network or sold the one by theinvestor who actually owns it.. Market { The Investors can buy or sell the owned links. 5. SIMULATION OF THE MULTI-AGENT SYSTEM The multi-agent system proposed for the network management has been modeled and veried by simulation (g. 3). It has a limited function { provides only the migration of the PacketCarriers using the Contract Net Protocol. The other tasks such as gaining information about the structure of the network and changing the structure of the network (adding/removing nodes) are not realized. The following interaction among agents has been realized: Packet carrier agent when arriving at a given host (node) is looking to a trip to reach the destination host at the lowest costs. At the host a number of options of transfer continuation at dierent prices is proposed to the packet carrier agent. Packet carrier agent accepts the solution, taking into consideration the price of the next displacement versus its own resources and the transfer rate versus the time it can waste Fig. 3. Schema of the examined network: a - at the beginning of simulation, b - at the end of simulation after improvement by system Table 1. Transfer rate between the hosts at the beginning of the simulation. (0) (1) (2) (3) (4) (5) (6) (0) { 10 { { { (1) 11 { 10 { { (2) { 10 { 10 { { 10 (3) { { 10 { 10 { 10 (4) 10 { { 10 { (5) { { 11 { 10 (6) { { Table 2. Transfer rate between the hosts at the end of the simulation. (0) (1) (2) (3) (4) (5) (6) (0) { 2 { { 6 32 { (1) 20 { 26 { { (2) { 18 { 10 { { 31 (3) { { 2 { 19 { 29 (4) 12 { { 6 { (5) { { 27 { 40 (6) { { for the whole transfer from the sender to the receiver. Packet carrier agent pays the gate agent for the transfer. With the resources saved the gate agents undertake modication of the network. The simulation of the system was performed on the computer network composed of 6 hosts with links giving the same transfer rate between every pair of hosts. The pricing policy is to favor the trac of the packet carrier agent toward the center of the network (i.e. toward the hosts H 5 and H 6 ). The initial state of the network with the same transfer
6 rate links between hosts is shown in Fig. 3a. The initial values of the transfer rate beetween the hosts are presented in Table 1. After a number of transfers the system using collected funds modied the parameters of the network. The result of the system investment is presented in Fig. 3b. After the improvements realized by the system the links toward the hosts H 5 and H 6 were reinforced (thick lines in the Fig. 3b). The nal values of the transfer rate between the hosts are presented in Table 2. REFERENCES Cetnarowicz, K., M. _ Zabinska and E. Cetnarowicz (1999). A decentralized multi-agent system for computer network reconguration.. In: Proceedings of the 21st International Workshop: Advances Simulation of Systems - AS- SIS'99 (J. Stefan, Ed.). MARQ, Ostrava, Czech Republic, Cheng, John Q. and Michael P. Wellman (1997). The walras algorithm: A convergent distributed implementation of general equilibrium outcomes. omputational Economics. Gibney, M.A. and N.R. Jennings (1998). Dynamic resource allocation by market based routing in telecommunications networks. In: Intelligent Agents for Telecommunications Applications (IATA'98) (Garijo F.J. Albayrac S., Ed.). Springer Verlag. Mullen, Tracy and Michael P. Wellman (1995). A simple computational market for network information services. In: ICMAS. Sandholm, Tuomas W. (1996). Negotiation among self-interested computationally limited agents. PhD thesis of University of Massachusetts Amherst. Sandholm, Tuomas W. (1999). Distributed rational decision making. In: Multiagent Systems. A Modern Approach to Distributed Articial Intelligenc (Gerhard Weiss, Ed.). Vol. II. Chap. 7, pp. 201{258. The MIT Press. Smith, Reid G. (1980). The contract net protocol: High-level communication and control in a distributed problem solver. IEEE Transactions on Computers. C-29(12), 1104{1113. Wellman, Michael P. (1993). A market-oriented programming environment and its application to distributed multicommodity ow problem. Journal of Articial Intelligence Research pp. 1{23. Wellman, Michael P. (1996). Market-oriented programming: some early lessons. In: Market- Based Control: A Paradigm for Distributed Resource Allocation (S. Clearwater, Ed.). World Scientic.
Multi-Agent System for Flexible Manufacturing Systems Management
Multi-Agent System for Flexible Manufacturing Systems Management Krzysztof Cetnarowicz, Jarosław Koźlak Institute of Computer Science AGH - University of Mining and Metallurgy Al. Mickiewicza 30, 30-059
More informationArchitecture bits. (Chromosome) (Evolved chromosome) Downloading. Downloading PLD. GA operation Architecture bits
A Pattern Recognition System Using Evolvable Hardware Masaya Iwata 1 Isamu Kajitani 2 Hitoshi Yamada 2 Hitoshi Iba 1 Tetsuya Higuchi 1 1 1-1-4,Umezono,Tsukuba,Ibaraki,305,Japan Electrotechnical Laboratory
More informationAn Active Packet can be classified as
Mobile Agents for Active Network Management By Rumeel Kazi and Patricia Morreale Stevens Institute of Technology Contact: rkazi,pat@ati.stevens-tech.edu Abstract-Traditionally, network management systems
More informationInfluences of Communication Disruptions on Decentralized Routing in Transport Logistics
Influences of Communication Disruptions on Decentralized Routing in Transport Logistics Bernd Scholz-Reiter, Christian Zabel BIBA Bremer Institut für Produktion und Logistik GmbH University of Bremen Hochschulring
More informationOscillations of the Sending Window in Compound TCP
Oscillations of the Sending Window in Compound TCP Alberto Blanc 1, Denis Collange 1, and Konstantin Avrachenkov 2 1 Orange Labs, 905 rue Albert Einstein, 06921 Sophia Antipolis, France 2 I.N.R.I.A. 2004
More informationProposition of a new approach to adapt SIP protocol to Ad hoc Networks
, pp.133-148 http://dx.doi.org/10.14257/ijseia.2014.8.7,11 Proposition of a new approach to adapt SIP protocol to Ad hoc Networks I. Mourtaji, M. Bouhorma, M. Benahmed and A. Bouhdir Computer and Communication
More informationSelf-organized Multi-agent System for Service Management in the Next Generation Networks
PROCEEDINGS OF THE WORKSHOP ON APPLICATIONS OF SOFTWARE AGENTS ISBN 978-86-7031-188-6, pp. 18-24, 2011 Self-organized Multi-agent System for Service Management in the Next Generation Networks Mario Kusek
More informationInformation Broker Agents in Intelligent Websites
Information Broker Agents in Intelligent Websites Catholijn M. Jonker, Jan Treur Vrije Universiteit Amsterdam, Department of Artificial Intelligence De Boelelaan 1081a, 1081 HV Amsterdam, The Netherlands
More informationEstablishing How Many VoIP Calls a Wireless LAN Can Support Without Performance Degradation
Establishing How Many VoIP Calls a Wireless LAN Can Support Without Performance Degradation ABSTRACT Ángel Cuevas Rumín Universidad Carlos III de Madrid Department of Telematic Engineering Ph.D Student
More informationInfluence of Load Balancing on Quality of Real Time Data Transmission*
SERBIAN JOURNAL OF ELECTRICAL ENGINEERING Vol. 6, No. 3, December 2009, 515-524 UDK: 004.738.2 Influence of Load Balancing on Quality of Real Time Data Transmission* Nataša Maksić 1,a, Petar Knežević 2,
More informationA Stock Trading Algorithm Model Proposal, based on Technical Indicators Signals
Informatica Economică vol. 15, no. 1/2011 183 A Stock Trading Algorithm Model Proposal, based on Technical Indicators Signals Darie MOLDOVAN, Mircea MOCA, Ştefan NIŢCHI Business Information Systems Dept.
More informationIntelligent Agents Serving Based On The Society Information
Intelligent Agents Serving Based On The Society Information Sanem SARIEL Istanbul Technical University, Computer Engineering Department, Istanbul, TURKEY sariel@cs.itu.edu.tr B. Tevfik AKGUN Yildiz Technical
More informationA Sarsa based Autonomous Stock Trading Agent
A Sarsa based Autonomous Stock Trading Agent Achal Augustine The University of Texas at Austin Department of Computer Science Austin, TX 78712 USA achal@cs.utexas.edu Abstract This paper describes an autonomous
More information8 Modeling network traffic using game theory
8 Modeling network traffic using game theory Network represented as a weighted graph; each edge has a designated travel time that may depend on the amount of traffic it contains (some edges sensitive to
More informationThesis work and research project
Thesis work and research project Hélia Pouyllau, INRIA of Rennes, Campus Beaulieu 35042 Rennes, helia.pouyllau@irisa.fr July 16, 2007 1 Thesis work on Distributed algorithms for endto-end QoS contract
More informationA Multi-Agent Approach to a Distributed Schedule Management System
UDC 001.81: 681.3 A Multi-Agent Approach to a Distributed Schedule Management System VYuji Wada VMasatoshi Shiouchi VYuji Takada (Manuscript received June 11,1997) More and more people are engaging in
More informationPrediction of Software Development Modication Eort Enhanced by a Genetic Algorithm
Prediction of Software Development Modication Eort Enhanced by a Genetic Algorithm Gerg Balogh, Ádám Zoltán Végh, and Árpád Beszédes Department of Software Engineering University of Szeged, Szeged, Hungary
More informationBuilding a virtual marketplace for software development tasks
Building a virtual marketplace for software development tasks Boris Kötting & Frank Maurer University of Kaiserlautern & University of Calgary koetting@informatik.uni-kl.de & maurer@cpsc.ucalgary.ca Abstract
More informationHow To Write A Privacy Preserving Firewall Optimization Protocol
Asia-pacific Journal of Multimedia Services Convergence with Art, Humanities and Sociology Vol.1, No.2 (2011), pp. 93-100 http://dx.doi.org/10.14257/ajmscahs.2011.12.06 Secure Multi-Party Computation in
More informationA Semantic Marketplace of Peers Hosting Negotiating Intelligent Agents
A Semantic Marketplace of Peers Hosting Negotiating Intelligent Agents Theodore Patkos and Dimitris Plexousakis Institute of Computer Science, FO.R.T.H. Vassilika Vouton, P.O. Box 1385, GR 71110 Heraklion,
More informationChapter 5 Pricing Foundations and Implications on Web Service Pricing
Chapter 5 Pricing Foundations and Implications on Web Service Pricing 5.1 Pricing Principles in General One of the key building parts of a market is its market mechanism. This mechanism encloses the rules
More informationMS MS - Management Station MNE - Managed Network Element. Link l LAN MNE MNE...
Analyzing Mobile Agent Scalability in Network Management Marcelo Gon alves Rubinstein and Otto Carlos Muniz Bandeira Duarte {rubi, otto}@gta.ufrj.br Grupo de Teleinform tica e Automa o - GTA Universidade
More informationSimulate Grid Resource Trading via Cognitive Agent: A Case Study
Simulate Grid Resource Trading via Cognitive Agent: A Case Study Yuhui Qiu Faculty of Computer and Information Science Southwest University, Chonqing, China yhqiu@swu.edu.cn Zhixing Huang Faculty of Computer
More informationFlexible mobility management strategy in cellular networks
Flexible mobility management strategy in cellular networks JAN GAJDORUS Department of informatics and telecommunications (161114) Czech technical university in Prague, Faculty of transportation sciences
More informationPERFORMANCE STUDY AND SIMULATION OF AN ANYCAST PROTOCOL FOR WIRELESS MOBILE AD HOC NETWORKS
PERFORMANCE STUDY AND SIMULATION OF AN ANYCAST PROTOCOL FOR WIRELESS MOBILE AD HOC NETWORKS Reza Azizi Engineering Department, Bojnourd Branch, Islamic Azad University, Bojnourd, Iran reza.azizi@bojnourdiau.ac.ir
More information3-12 Autonomous Access Control among Nodes in Sensor Networks with Security Policies
3-12 Autonomous Access Control among Nodes in Sensor Networks with Security Policies This paper describes a new framework of policy control sensor networks. Sensor networks are shared by various applications,
More informationChapter 7. Sealed-bid Auctions
Chapter 7 Sealed-bid Auctions An auction is a procedure used for selling and buying items by offering them up for bid. Auctions are often used to sell objects that have a variable price (for example oil)
More informationFPGA Implementation of IP Packet Segmentation and Reassembly in Internet Router*
SERBIAN JOURNAL OF ELECTRICAL ENGINEERING Vol. 6, No. 3, December 2009, 399-407 UDK: 004.738.5.057.4 FPGA Implementation of IP Packet Segmentation and Reassembly in Internet Router* Marko Carević 1,a,
More informationAn Empirical Approach - Distributed Mobility Management for Target Tracking in MANETs
An Empirical Approach - Distributed Mobility Management for Target Tracking in MANETs G.Michael Assistant Professor, Department of CSE, Bharath University, Chennai, TN, India ABSTRACT: Mobility management
More informationFunction and Structure Design for Regional Logistics Information Platform
, pp. 223-230 http://dx.doi.org/10.14257/ijfgcn.2015.8.4.22 Function and Structure Design for Regional Logistics Information Platform Wang Yaowu and Lu Zhibin School of Management, Harbin Institute of
More informationChannel Allocation in Cellular Telephone. Systems. Lab. for Info. and Decision Sciences. Cambridge, MA 02139. bertsekas@lids.mit.edu.
Reinforcement Learning for Dynamic Channel Allocation in Cellular Telephone Systems Satinder Singh Department of Computer Science University of Colorado Boulder, CO 80309-0430 baveja@cs.colorado.edu Dimitri
More informationCournot s model of oligopoly
Cournot s model of oligopoly Single good produced by n firms Cost to firm i of producing q i units: C i (q i ), where C i is nonnegative and increasing If firms total output is Q then market price is P(Q),
More informationChapter 4 Multi-Stage Interconnection Networks The general concept of the multi-stage interconnection network, together with its routing properties, have been used in the preceding chapter to describe
More informationKeywords: Dynamic Load Balancing, Process Migration, Load Indices, Threshold Level, Response Time, Process Age.
Volume 3, Issue 10, October 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Load Measurement
More informationImproving the Performance of TCP Using Window Adjustment Procedure and Bandwidth Estimation
Improving the Performance of TCP Using Window Adjustment Procedure and Bandwidth Estimation R.Navaneethakrishnan Assistant Professor (SG) Bharathiyar College of Engineering and Technology, Karaikal, India.
More informationAutoconfiguration and maintenance of the IP address in ad-hoc mobile networks
1 Autoconfiguration and maintenance of the IP address in ad-hoc mobile networks M. Fazio, M. Villari, A. Puliafito Università di Messina, Dipartimento di Matematica Contrada Papardo, Salita Sperone, 98166
More informationIMPROVING RESOURCE LEVELING IN AGILE SOFTWARE DEVELOPMENT PROJECTS THROUGH AGENT-BASED APPROACH
IMPROVING RESOURCE LEVELING IN AGILE SOFTWARE DEVELOPMENT PROJECTS THROUGH AGENT-BASED APPROACH Constanta Nicoleta BODEA PhD, University Professor, Economic Informatics Department University of Economics,
More informationAnalysis and Design of Active Queue Management for TCP-RED Congestion Control Strategies
Analysis and Design of Active Queue Management for TCP-RED Congestion Control Strategies By Nabhan Hamadneh A thesis submitted for the degree of Doctor of Philosophy School of Information Technology, Murdoch
More informationAn intelligent stock trading decision support system through integration of genetic algorithm based fuzzy neural network and articial neural network
Fuzzy Sets and Systems 118 (2001) 21 45 www.elsevier.com/locate/fss An intelligent stock trading decision support system through integration of genetic algorithm based fuzzy neural network and articial
More informationA Bidding Strategy of Intermediary in Display Advertisement Auctions
Master Thesis A Bidding Strategy of Intermediary in Display Advertisement Auctions Supervisor Associate Professor Shigeo MATSUBARA Department of Social Informatics Graduate School of Informatics Kyoto
More informationHow To Optimize Online Video Ads
Proceedings of the 2011 IEEE Systems and Information Engineering Design Symposium, University of Virginia, Charlottesville, VA, USA, April 29, 2011 FridayPM1Modeling.2 Bidding Strategies Optimization for
More informationTopology-based network security
Topology-based network security Tiit Pikma Supervised by Vitaly Skachek Research Seminar in Cryptography University of Tartu, Spring 2013 1 Introduction In both wired and wireless networks, there is the
More informationInternational Journal of Applied Science and Technology Vol. 2 No. 3; March 2012. Green WSUS
International Journal of Applied Science and Technology Vol. 2 No. 3; March 2012 Abstract 112 Green WSUS Seifedine Kadry, Chibli Joumaa American University of the Middle East Kuwait The new era of information
More information5 Performance Management for Web Services. Rolf Stadler School of Electrical Engineering KTH Royal Institute of Technology. stadler@ee.kth.
5 Performance Management for Web Services Rolf Stadler School of Electrical Engineering KTH Royal Institute of Technology stadler@ee.kth.se April 2008 Overview Service Management Performance Mgt QoS Mgt
More informationPeer to Peer Search Engine and Collaboration Platform Based on JXTA Protocol
Peer to Peer Search Engine and Collaboration Platform Based on JXTA Protocol Andraž Jere, Marko Meža, Boštjan Marušič, Štefan Dobravec, Tomaž Finkšt, Jurij F. Tasič Faculty of Electrical Engineering Tržaška
More informationReview Methods Configuration, Administration and Network Monitoring in High-Rate Onboard Networking Standards
Review Methods Configuration, Administration and Network Monitoring in High-Rate Onboard Networking Standards Ksenia Khramenkova, Stanislava Oleynikova Saint-Petersburg State University of Aerospace Instrumentation
More informationssumathy@vit.ac.in upendra_mcs2@yahoo.com
S. Sumathy 1 and B.Upendra Kumar 2 1 School of Computing Sciences, VIT University, Vellore-632 014, Tamilnadu, India ssumathy@vit.ac.in 2 School of Computing Sciences, VIT University, Vellore-632 014,
More informationBusiness Case for S/Gi Network Simplification
Business Case for S/Gi Network Simplification Executive Summary Mobile broadband traffic growth is driving large cost increases but revenue is failing to keep pace. Service providers, consequently, are
More informationTrust Management and Network Layer Security Protocols Matt Blaze 1 and John Ioannidis 1 and Angelos D. Keromytis 2 1 AT&T Laboratories { Research fmab,jig@research.att.com 2 Distributed Systems Labs CIS
More information0-7803-5538-5/99/$10.00 (c) 1999 IEEE
Converged Voice Video and Data Wired-Wireless LANs Testbed A. Ganz A. Phonphoem N. Llopis I. Kim K. Wongthavarawat Multimedia Networks Laboratory ECE Department University of Massachusetts Amherst MA 01003
More informationOperations management: Special topic: supply chain management
OpenStax-CNX module: m35461 1 Operations management: Special topic: supply chain management Global Text Project This work is produced by OpenStax-CNX and licensed under the Creative Commons Attribution
More informationDual Mechanism to Detect DDOS Attack Priyanka Dembla, Chander Diwaker 2 1 Research Scholar, 2 Assistant Professor
International Association of Scientific Innovation and Research (IASIR) (An Association Unifying the Sciences, Engineering, and Applied Research) International Journal of Engineering, Business and Enterprise
More information1. The subnet must prevent additional packets from entering the congested region until those already present can be processed.
Congestion Control When one part of the subnet (e.g. one or more routers in an area) becomes overloaded, congestion results. Because routers are receiving packets faster than they can forward them, one
More informationUsing Logs to Increase Availability in Real-Time. Tiina Niklander and Kimmo Raatikainen. University of Helsinki, Department of Computer Science
Using Logs to Increase Availability in Real-Time Main-Memory Tiina Niklander and Kimmo Raatikainen University of Helsinki, Department of Computer Science P.O. Box 26(Teollisuuskatu 23), FIN-14 University
More informationGame Theory 1. Introduction
Game Theory 1. Introduction Dmitry Potapov CERN What is Game Theory? Game theory is about interactions among agents that are self-interested I ll use agent and player synonymously Self-interested: Each
More informationADMINISTRATION AND CONFIGURATION OF HETEROGENEOUS NETWORKS USING AGLETS
ANNALS OF THE FACULTY OF ENGINEERING HUNEDOARA 2006, Tome IV, Fascicole 1, (ISSN 1584 2665) FACULTY OF ENGINEERING HUNEDOARA, 5, REVOLUTIEI, 331128, HUNEDOARA ADMINISTRATION AND CONFIGURATION OF HETEROGENEOUS
More informationThe Use of Artificially Intelligent Agents with Bounded Rationality in the Study of Economic Markets
From: AAAI-96 Proceedings. Copyright 1996, AAAI (www.aaai.org). All rights reserved. The Use of Artificially Intelligent Agents with Bounded Rationality in the Study of Economic Markets Vijay Rajan and
More informationImplementation of a Lightweight Service Advertisement and Discovery Protocol for Mobile Ad hoc Networks
Implementation of a Lightweight Advertisement and Discovery Protocol for Mobile Ad hoc Networks Wenbin Ma * Department of Electrical and Computer Engineering 19 Memorial Drive West, Lehigh University Bethlehem,
More informationA Tool for Multimedia Quality Assessment in NS3: QoE Monitor
A Tool for Multimedia Quality Assessment in NS3: QoE Monitor D. Saladino, A. Paganelli, M. Casoni Department of Engineering Enzo Ferrari, University of Modena and Reggio Emilia via Vignolese 95, 41125
More informationMethodology Framework for Analysis and Design of Business Intelligence Systems
Applied Mathematical Sciences, Vol. 7, 2013, no. 31, 1523-1528 HIKARI Ltd, www.m-hikari.com Methodology Framework for Analysis and Design of Business Intelligence Systems Martin Závodný Department of Information
More informationAn analysis of price impact function in order-driven markets
Available online at www.sciencedirect.com Physica A 324 (2003) 146 151 www.elsevier.com/locate/physa An analysis of price impact function in order-driven markets G. Iori a;, M.G. Daniels b, J.D. Farmer
More informationSimple Channel-Change Games for Spectrum- Agile Wireless Networks
Simple Channel-Change Games for Spectrum- Agile Wireless Networks Roli G. Wendorf and Howard Blum Seidenberg School of Computer Science and Information Systems Pace University White Plains, New York, USA
More informationLOAD BALANCING AND EFFICIENT CLUSTERING FOR IMPROVING NETWORK PERFORMANCE IN AD-HOC NETWORKS
LOAD BALANCING AND EFFICIENT CLUSTERING FOR IMPROVING NETWORK PERFORMANCE IN AD-HOC NETWORKS Saranya.S 1, Menakambal.S 2 1 M.E., Embedded System Technologies, Nandha Engineering College (Autonomous), (India)
More informationDesigning the Market Game for a Commodity Trading Simulation
Designing the Market Game for a Commodity Trading Simulation Shih-Fen Cheng School of Information Systems Singapore Management University sfcheng@smu.edu.sg Abstract In this paper, we propose to design
More informationLecture 2.1 : The Distributed Bellman-Ford Algorithm. Lecture 2.2 : The Destination Sequenced Distance Vector (DSDV) protocol
Lecture 2 : The DSDV Protocol Lecture 2.1 : The Distributed Bellman-Ford Algorithm Lecture 2.2 : The Destination Sequenced Distance Vector (DSDV) protocol The Routing Problem S S D D The routing problem
More informationAn Optimization Model of Load Balancing in P2P SIP Architecture
An Optimization Model of Load Balancing in P2P SIP Architecture 1 Kai Shuang, 2 Liying Chen *1, First Author, Corresponding Author Beijing University of Posts and Telecommunications, shuangk@bupt.edu.cn
More informationMAXIMIZING RESTORABLE THROUGHPUT IN MPLS NETWORKS
MAXIMIZING RESTORABLE THROUGHPUT IN MPLS NETWORKS 1 M.LAKSHMI, 2 N.LAKSHMI 1 Assitant Professor, Dept.of.Computer science, MCC college.pattukottai. 2 Research Scholar, Dept.of.Computer science, MCC college.pattukottai.
More informationA MULTI-AGENT BASED CONFIGURATION PROCESS FOR MASS CUSTOMIZATION
A MULTI-AGENT BASED CONFIGURATION PROCESS FOR MASS CUSTOMIZATION Thorsten Blecker*, Nizar Abdelkafi*, and Gerold Kreutler** *Department of Production/Operations Management ** Department of Computer Science
More informationModule 15: Network Structures
Module 15: Network Structures Background Topology Network Types Communication Communication Protocol Robustness Design Strategies 15.1 A Distributed System 15.2 Motivation Resource sharing sharing and
More informationNew QOS Routing Algorithm for MPLS Networks Using Delay and Bandwidth Constraints
New QOS Routing Algorithm for MPLS Networks Using Delay and Bandwidth Constraints Santosh Kulkarni 1, Reema Sharma 2,Ishani Mishra 3 1 Department of ECE, KSSEM Bangalore,MIEEE, MIETE & ISTE 2 Department
More informationA Clone-Pair Approach for the Determination of the Itinerary of Imprecise Mobile Agents with Firm Deadlines
A Clone-Pair Approach for the Determination of the Itinerary of Imprecise Mobile Agents with Firm Deadlines Luciana Rech, Carlos Montez and Rômulo de Oliveira Department of Automation and Systems Engineering
More informationIn Proceedings of the First IEEE Workshop on Real-Time Applications, New York, NY, May 1993.
In Proceedings of the First IEEE Workshop on Real-Time Applications, New York, NY, May 1993. Probabilistic Job Scheduling for Distributed Real-time Applications Azer Bestavros Dimitrios Spartiotis Computer
More informationIn the next generation network architectures for the Internet backbone, MPLS is being considered for protection and restoration and fast rerouting fun
An Algorithm for Rerouting in Trac Engineering of MPLS Based IP Networks Muckai KGirish, Bei Zhou y and Jian-Qiang Hu z Abstract Multiprotocol label switching (MPLS) enables IP networks with Quality of
More informationCROSS LAYER BASED MULTIPATH ROUTING FOR LOAD BALANCING
CHAPTER 6 CROSS LAYER BASED MULTIPATH ROUTING FOR LOAD BALANCING 6.1 INTRODUCTION The technical challenges in WMNs are load balancing, optimal routing, fairness, network auto-configuration and mobility
More informationAnalysis of an Artificial Hormone System (Extended abstract)
c 2013. This is the author s version of the work. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purpose or for creating
More informationGoldberg, D. E. (1989). Genetic algorithms in search, optimization, and machine learning. Reading, MA:
is another objective that the GA could optimize. The approach used here is also adaptable. On any particular project, the designer can congure the GA to focus on optimizing certain constraints (such as
More informationPART III. OPS-based wide area networks
PART III OPS-based wide area networks Chapter 7 Introduction to the OPS-based wide area network 7.1 State-of-the-art In this thesis, we consider the general switch architecture with full connectivity
More informationPath Optimization in Computer Networks
Path Optimization in Computer Networks Roman Ciloci Abstract. The main idea behind path optimization is to find a path that will take the shortest amount of time to transmit data from a host A to a host
More informationQUALITY OF SERVICE METRICS FOR DATA TRANSMISSION IN MESH TOPOLOGIES
QUALITY OF SERVICE METRICS FOR DATA TRANSMISSION IN MESH TOPOLOGIES SWATHI NANDURI * ZAHOOR-UL-HUQ * Master of Technology, Associate Professor, G. Pulla Reddy Engineering College, G. Pulla Reddy Engineering
More informationPINK: Proactive INjection into ack, a queue manager to impose fair resource allocation among TCP ows
PINK: Proactive INjection into ack, a queue manager to impose fair resource allocation among TCP ows Carlo A. Grazia, Martin Klapez, Natale Patriciello, Maurizio Casoni Department of Engineering Enzo Ferrari
More informationChapter 16: Distributed Operating Systems
Module 16: Distributed ib System Structure, Silberschatz, Galvin and Gagne 2009 Chapter 16: Distributed Operating Systems Motivation Types of Network-Based Operating Systems Network Structure Network Topology
More informationBandwidth Allocation in a Network Virtualization Environment
Bandwidth Allocation in a Network Virtualization Environment Juan Felipe Botero jfbotero@entel.upc.edu Xavier Hesselbach xavierh@entel.upc.edu Department of Telematics Technical University of Catalonia
More informationAnalyzing the Procurement Process in a Simplified Version of the TAC SCM Game
Analyzing the Procurement Process in a Simplified Version of the TAC SCM Game Hosna Jabbari December 9, 2005 Abstract The TAC supply chain management game presents a simulated market environment with automated
More informationOptical interconnection networks with time slot routing
Theoretical and Applied Informatics ISSN 896 5 Vol. x 00x, no. x pp. x x Optical interconnection networks with time slot routing IRENEUSZ SZCZEŚNIAK AND ROMAN WYRZYKOWSKI a a Institute of Computer and
More informationSimulation Tool for Market-Based Cloud Resource Allocation
Simulation Tool for Market-Based Cloud Resource Allocation Carlos Mera Gómez a, b Supervisor: Dr. Rami Bahsoon b, c MSc in Internet Software Systems a School of Computer Science, University of Birmingham,
More informationSix Strategies for Building High Performance SOA Applications
Six Strategies for Building High Performance SOA Applications Uwe Breitenbücher, Oliver Kopp, Frank Leymann, Michael Reiter, Dieter Roller, and Tobias Unger University of Stuttgart, Institute of Architecture
More informationGiving life to today s media distribution services
Giving life to today s media distribution services FIA - Future Internet Assembly Athens, 17 March 2014 Presenter: Nikolaos Efthymiopoulos Network architecture & Management Group Copyright University of
More informationLoad Balancing among Access Points
among Access Points Master Thesis Department of Informatics MSc in Computer Science Athens University of Economics and Business Mmlab Meeting, June 2010 Outline Introduction 1 Introduction Objectives The
More informationGame Theory Based Iaas Services Composition in Cloud Computing
Game Theory Based Iaas Services Composition in Cloud Computing Environment 1 Yang Yang, *2 Zhenqiang Mi, 3 Jiajia Sun 1, First Author School of Computer and Communication Engineering, University of Science
More informationSoftware development process
OpenStax-CNX module: m14619 1 Software development process Trung Hung VO This work is produced by OpenStax-CNX and licensed under the Creative Commons Attribution License 2.0 Abstract A software development
More informationTOPOLOGIES NETWORK SECURITY SERVICES
TOPOLOGIES NETWORK SECURITY SERVICES 1 R.DEEPA 1 Assitant Professor, Dept.of.Computer science, Raja s college of Tamil Studies & Sanskrit,Thiruvaiyaru ABSTRACT--In the paper propose about topology security
More informationOpnet Based simulation for route redistribution in EIGRP, BGP and OSPF network protocols
IOSR Journal of Electronics and Communication Engineering (IOSR-JECE) e-issn: 2278-2834,p- ISSN: 2278-8735.Volume 9, Issue 1, Ver. IV (Jan. 2014), PP 47-52 Opnet Based simulation for route redistribution
More informationCopyright DEALMAKER.COM Worldwide Patents Granted & Pending
The law of supply and demand dictates that in a perfectly balanced market prices gravitate towards equilibrium; where supply and demand become exactly equal... The next generation of electronic marketplaces
More informationDistributed Dynamic Load Balancing for Iterative-Stencil Applications
Distributed Dynamic Load Balancing for Iterative-Stencil Applications G. Dethier 1, P. Marchot 2 and P.A. de Marneffe 1 1 EECS Department, University of Liege, Belgium 2 Chemical Engineering Department,
More informationPerformance of networks containing both MaxNet and SumNet links
Performance of networks containing both MaxNet and SumNet links Lachlan L. H. Andrew and Bartek P. Wydrowski Abstract Both MaxNet and SumNet are distributed congestion control architectures suitable for
More informationA Comparison Study of Qos Using Different Routing Algorithms In Mobile Ad Hoc Networks
A Comparison Study of Qos Using Different Routing Algorithms In Mobile Ad Hoc Networks T.Chandrasekhar 1, J.S.Chakravarthi 2, K.Sravya 3 Professor, Dept. of Electronics and Communication Engg., GIET Engg.
More informationSimulation of Heuristic Usage for Load Balancing In Routing Efficiency
Simulation of Heuristic Usage for Load Balancing In Routing Efficiency Nor Musliza Mustafa Fakulti Sains dan Teknologi Maklumat, Kolej Universiti Islam Antarabangsa Selangor normusliza@kuis.edu.my Abstract.
More informationON NETWORK BANDWIDTH SHARING FOR TRANSPORTING RATE-ADAPTIVE PACKET VIDEO USING FEEDBACK. Fujitsu Laboratories of America, Sunnyvale, CA, USA
ON NETWORK BANDWIDTH SHARING FOR TRANSPORTING RATE-ADAPTIVE PACKET VIDEO USING FEEDBACK YIWEI THOMAS HOU 1 SHIVENDRA S. PANWAR 2 ZHI-LI ZHANG 3 HENRY TZENG 4 YA-QIN ZHANG 5 1 Fujitsu Laboratories of America,
More informationCustomer Specific Wireless Network Solutions Based on Standard IEEE 802.15.4
Customer Specific Wireless Network Solutions Based on Standard IEEE 802.15.4 Michael Binhack, sentec Elektronik GmbH, Werner-von-Siemens-Str. 6, 98693 Ilmenau, Germany Gerald Kupris, Freescale Semiconductor
More informationA Platform for Trading Agent Competition
A Platform for Trading Agent Competition Dongmo Zhang and Chun Gao Intelligent Systems Laboratory University of Western Sydney Australia Outline 1 Trading Agent Competition 2 Market Design Game 3 Strategic
More information