Real-time Network Monitoring Supporting Percentile Error Objectives

Size: px
Start display at page:

Download "Real-time Network Monitoring Supporting Percentile Error Objectives"

Transcription

1 14 th HP Software University Association Workshop, July 2007, Munich, Germany Real-time Network Monitoring Supporting Percentile Error Objectives Alberto Gonzalez Prieto and Rolf Stadler School of Electrical Engineering KTH Royal Institute of Technology Stockholm, Sweden {gonzalez, Abstract. We report on the versatility of A-GAP for supporting different types of accuracy objectives. Previously, we considered accuracy objectives expressed in terms of the average error. In this paper, we focus on percentile error objectives. A-GAP is a protocol for continuous monitoring of network state variables. Network state variables are computed from device counters using aggregation functions, such as SUM, AVERAGE and MAX. A-GAP is designed to achieve a given monitoring accuracy with minimal overhead. A- GAP is decentralized and asynchronous to achieve robustness and scalability. It executes on an overlay that interconnects management processes on the devices. On this overlay, the protocol maintains a spanning tree and updates the network state variables through incremental aggregation. Based on a stochastic model, it dynamically configures local filters that control whether an update is sent towards the root of the tree. We evaluate A-GAP through simulation using real traces for an ISP topology (Abovenet). The results prove the versatility of A- GAP for supporting different types of accuracy objectives. The results also show that we can effectively control the trade-off between accuracy and protocol overhead, and that the overhead can be reduced significantly by allowing small errors. Keywords: Distributed management, real-time monitoring, large-scale distributed systems, adaptive systems 1 Introduction The ability to provide continuous estimates of management variables is vital for many management tasks, including network supervision, quality assurance, and proactive fault management. Often, management variables that are monitored in these tasks are aggregates that are computed from device variables across the network using functions such as SUM, AVERAGE, MIN, and MAX. Sample aggregates are the total number of VoIP flows, the maximum link utilization, or a histogram of the current load across routers in a network domain. While it is often crucial to know how accurate such estimates are, network management solutions deployed today usually provide only qualitative control of the accuracy and do not support the setting of an accuracy objective. 1

2 Management Station Global Aggregate Partial Aggregate Local variable Root 10 Physical Node Aggregating Node Leaf Node Fig. 1. Example of an aggregation tree with aggregation function SUM. Engineering continuous monitoring solutions for network management involves addressing the fundamental trade-off between accurate estimation of a variable and the management overhead in terms of traffic and processing load [6]. We focus on the problem of continuous monitoring with accuracy objectives for large-scale network environments. Our goal is to achieve an efficient solution that allows us to control the accuracy of the estimation. Specifically, in this paper, we show the versatility of our protocol, A-GAP [13] for supporting different accuracy objectives. A-GAP is a generic aggregation protocol with controllable accuracy. A-GAP allows for continuously computing aggregates of local variables by (i) creating and maintaining a self-stabilizing spanning tree and (ii) incrementally aggregating the variables along the tree (figure 1). It is push-based in the sense that changes in monitored variables are sent towards the management station along the aggregation tree. The protocol controls the management overhead by filtering updates that are sent from monitoring nodes to the management station. The filters periodically adapt to the dynamics of the monitored variables and the network environment. All operations in A-GAP, including computing the aggregation function and filter configuration, are executed in a decentralized and asynchronous fashion to ensure robustness and achieve scalability. We developed a stochastic model of the monitoring process, which allows us to compute the filter widths as the solution to the problem of minimizing the management overhead for a given estimation error. A distributed heuristic solution to this problem is implemented in A-GAP. A distinctive feature of this approach is that it provides us with an estimation of the error distribution at the management station in real-time. This allows us to choose from a variety of control objectives, including average error and percentiles, which we have chosen for this paper. 2

3 A-GAP assumes access to local variables. This can be realized through a variety of mechanisms including reading MIB variables and CLI commands. The specific mechanism used is transparent to A-GAP. This paper complements [13] by showing the versatility of A-GAP for supporting different types of accuracy objectives. In [13], we considered accuracy objectives expressed in terms of the average error. In this paper, we focus on percentile error objectives. Percentile-based accuracy is particularly relevant in the context of quality assurance. The paper is organized as follows. Section II defines the problem of real-time monitoring with accuracy objectives. Section III describes our solution for continuous monitoring with accuracy objectives, A-GAP. Section IV evaluates A-GAP through simulation. Section V discusses related work. Section VI concludes the paper. 2 Problem Statement: Real-time Monitoring with Accuracy 2.1 System Architecture This work assumes a distributed management architecture, whereby each network device participates in the computation by running management processes, either internally or on an external, associated device. These management processes communicate via a management overlay network for the purpose of monitoring. We also refer to this overlay as the network graph. A node in this graph represents a management process. The aggregation tree shown in figure 1 spans the management overlay. Inside each management process runs a leaf node and an aggregating node of this aggregation tree. The topology of this overlay can be chosen independently from the topology of the underlying physical network. 2.2 Problem Statement We consider a dynamically changing network graph G(t) = (V(t), E(t)) in which nodes n V(t) and edges/links e E(t) V(t) x V(t) may appear and disappear over time. Each leaf n has an associated local variable w n (t), which is an integer valued quantity. The term local variable is used to represent a local state variable or device counter that is being subjected to monitoring. Local variables are updated asynchronously with a given sampling rate. The objective is to engineer a protocol on this network graph that provides a management station with a continuous estimate of Σ n w n (t) for a given accuracy. The protocol should execute with minimal overhead in the sense that it minimizes the processing load on the nodes. We consider different types of accuracy objectives, such as the average error or percentiles (i.e., the administrator sets an interval that contains the estimation error 3

4 Local variable or partial aggregate Last update value Filter width Filter Exceeded: 1) Triggers an update to parent 2) Filter is shifted time Fig. 2. Each node has a local filter. It sends an update to its parent whenever the partial aggregate (or the local variable) exceeds the filter width. with probability p). The overhead is the maximum number of updates per second a node has to process. Throughout the paper we use SUM as aggregation function. Other functions can be supported as well, as discussed in [13]. 3 A-GAP: A Distributed Solution Our solution to the problem of real-time monitoring with accuracy is the A-GAP protocol [13]. A-GAP is based on GAP (Generic Aggregation Protocol), which we developed in our earlier work [1]. GAP is an asynchronous distributed protocol that builds and maintains a BFS (Breadth First Search) spanning tree on an overlay network. The tree is maintained in a similar way as the algorithm that underlies the 802.1d Spanning Tree Protocol (STP) [8]. In GAP, each node holds information about its children in the BFS tree, in order to compute the partial aggregate, i.e., the aggregate value of the local management variables from all nodes of the subtree where this node is the root. GAP is event-driven in the sense that messages are exchanged as results of events, such as the detection of a new neighbor on the overlay, the failure of a neighbor, an aggregate update or a change in the local management variable. A drawback of such an approach is that it can cause a high load on the root node or on nodes close to the root, specifically in large networks. In order to reduce this overhead, we introduce filters in the nodes. When the partial aggregate (or the local variable in the case of a leaf node) of a node n changes, then n sends an update to its parent if the difference between the value reported in its last update and the current value exceeds the local filter width F n. Figure 2 illustrates the behavior of a local filter. The solid line represents the partial aggregate (or the local variable), the dashed line gives the value of the last update from n to its parent, and the dotted line shows the filter width. The vertical line indicates the time at which n sends an update. 4

5 3.1 The Optimization Problem Estimating the network variable at the root node with minimal overhead for a given accuracy can be formalized as an optimization problem. Let n be a node in the network graph, ω n the rate of updates received by node n from its children, F n the filter width of node n, E root the distribution of the estimation error at the root node, and g() an arbitrary function of a probability distribution. We formulate the problem as Minimize { n } Max ω s.t. g( E root ) θ, (1) n whereby ω n and E root depend on the filter widths (F n ) n, which are the decision variables. We have developed a stochastic model for the monitoring process. The model is based on discrete-time Markov chains and describes individual nodes in their steady state. For each node n, the model relates the error of the partial aggregate of n, the step sizes that indicate changes in the partial aggregate, the rate of updates n sends and the width of the local filter. The model is described in detail in [13]. The model permits us to compute the distribution E root of the estimation error at the root node and the rate of updates ω n processed by each node. This allows us to support different types of accuracy objectives, i.e., different instantiations of the function g( E root ). In [13], we considered the average error as accuracy objective. In this paper, we show the versatility of our solution by considering a different type of accuracy objectives: percentile errors. Specifically, we show the capability of A-GAP for solving the network-wide problem Minimize { ω π } Max s.t. p( E root >γ) θ, (2) π where γ is the interval that contains the estimation error at the root with probability 1-θ. 3.2 The Realization of A-GAP An optimal solution to (eq. 1) can be computed using a (centralized) grid search algorithm, a well-known optimization technique, where the model variables for all nodes in the aggregation tree are computed bottom-up. Such an approach, however, is not feasible for large networks, since the computational cost of this algorithm grows exponentially with the number of nodes. A-GAP realizes a distributed heuristic, which attempts to minimize the maximum processing load on all nodes by minimizing the load within each node s neighborhood. A-GAP maps the network-wide problem (eq. 1) onto a local problem for each node n. For the particular case of (eq. 2), the mapping is as follows: Minimize { ω π } Max s.t. p( E n out >γn ) θ, (3) π 5

6 where π is the set composed by the node n and its children. This means that node n attempts to minimize the maximum load in a neighborhood for a given percentile error objective (γ n, θ) of its partial aggregate. (When the accuracy objective is expressed in terms of the average error a similar mapping is performed.) The node attempts to solve the local problem (eq. 3) by periodically re-computing the filters and accuracy objectives of its children, based on our model. Re-computing the filters (F c ) c allows node n to influence its own load ω n, while re-computing the accuracy objective (γ c, θ) of a child c allows the node to influence the load ω c on c. A-GAP computes the local filters and accuracy objectives in a decentralized and asynchronous fashion, as described in detail in [13]. The two key configuration parameters of A-GAP are (i) the maximum number of children whose filters and accuracy objectives are recomputed during a control cycle Ω, and (ii) the period of the control cycle τ. As discussed in [13], both parameters influence the adaptability and computational cost of A-GAP. 3.3 The Two Planes of A-GAP A-GAP can be understood as operating in two different planes. On the data plane, updates of the local variables are propagated towards the root and filtering occurs. In this plane, information flows bottom-up, from the leaves towards the root. In the control plane the filters are computed. In this plane, information flows in both directions, bottom-up and top-down. The model variables (step sizes and errors) flow from the leaves towards the root and are incrementally aggregated. The filters are distributed top-down, from the parents to their respective children. 4 Evaluation Through Simulation 4.1 Simulation setup and scenario. We have evaluated the capability of A-GAP for supporting percentile error objectives through extensive simulations using the SIMPSON simulator [4]. The results presented in the paper are based on simulations for two different types of overlay topologies. First, we consider an overlay that follows the physical topology of Abovenet [5], an ISP, which has 654 nodes and 1332 links. Second, we use a grid overlay topology with 25 nodes. The grid topology is built in such a way that each node has 4 neighbors, except for the nodes at the edges of a grid, which have 2 neighbors, and the four corner nodes of a grid, which have 1 neighbor. All evaluation scenarios share the following settings. Link speeds in the overlay are 100 Mbps. The communication delay is 4 ms, and the time to process a message at a node is 1 ms. We present results for θ=0.05 and different intervals γ (i.e., the estimation error is 6

7 Updates/sec Measured Error c Fig. 3. Management overhead incurred by A-GAP as a function of the estimation error c, computed using (eq. 4). (Abovenet topology, θ=0.05) within the given interval γ with 0.95 probability). The local control cycle in A-GAP is set to τ=1 sec, and the (maximum) number of children whose filters are recomputed during a control cycle is Ω =6 for the Abovenet overlay topology and Ω =4 for the grid overlay topology. The local management variable in the simulation experiments represents the number of HTTP flows traversing a given node. The monitored aggregate is the number of HTTP flows in the network (the aggregate is in the order of flows for the Abovenet scenarios). The local variables are updated asynchronously, once every second, based on packet traces captured on two 1 Gbit/s links that connect University of Twente to a research network [9]. All simulation runs start with an initialization phase of A-GAP, which takes some 30 seconds simulation time, followed by the setting of the accuracy objective (γ, θ) and a transient period of about 25 seconds, followed by the measurement period of 200 seconds. 4.2 The trade-off between estimation accuracy and protocol overhead. We have measured the protocol overhead (i.e., the maximum number of processed updates across all nodes) in function of the experienced error. Figure 3 shows the measurement results for the Abovenet overlay topology. Every point in figure 3 corresponds to a simulation run. As can be seen, the overhead decreases monotonically, as the estimation error increases. For small errors, the load decreases faster than for larger errors. Consequently, the overhead can be reduced by allowing a larger estimation error. For example, compared to an error objective of 0 (which results in an experienced error of 13, see below), allowing an error of 20 flows (experienced error 23) reduces the load by 77%. An error of 40 flows (experienced error 41) reduces the load by 88%. 7

8 25 20 Updates /sec Measured Error c Fig. 4. Management overhead incurred by A-GAP as a function of the estimation error c, computed using (eq. 4). (Grid topology, θ=0.05) Figure 4 shows the measurement results for the grid overlay. We can observe that the trend is similar for both topologies. In this case, allowing an error of 20 flows (experienced error 20) reduces the load in one order of magnitude. Qualitatively, these results are identical to those we presented in [13], where the accuracy objective was expressed in terms of the average error. A-GAP behaves similarly for both types of accuracy objectives Recall in this context that the overhead incurred by A-GAP does not depend on the value of the aggregate, but on the absolute changes to the aggregate. This means that two scenarios with the same absolute changes result in the same overhead, independent of the value of the aggregate. This is why, in this paper, we consider the absolute error as control parameter rather than the relative error. That said, A-GAP can easily be extended for using the relative error as control parameter. 4.3 Meeting the accuracy objective For the simulations described in IV.B, we compute the difference between the accuracy objective (γ, θ) and the (experienced) estimation error (c, θ), as a measure of how well the accuracy objective is achieved. It is computed as: t o +T 1 c = min {} k min diff ( t, d, k) t θ, (4) T d to 1 A( t) A ~ ( t + d) k diff ( t, d, k) =, (5) 0 else where A stands for the actual aggregate and à for the estimation provided by A- GAP at the root node during the measurement period T. For our experiments, d has an upper bound of 50 msec. 8

9 45 40 Estimation Error c A-GAP Ideal Error Objective Fig. 5. Estimation error c (eq. 4) as a function of the accuracy objective γ (eq. 2) set by the manager at invocation of A-GAP. The figure shows how well the objective γ is achieved. (Abovenet topology, θ=0.05) Figure 5 shows the results for the Abovenet topology and Figure 6 those corresponding to the grid topology. We observe that the difference between the estimation error and the error objective is small. The difference between γ and c in figures 5 and 6 has two main causes. First, updates from different nodes in the network experience different delays in reaching the root, which distorts the evolution of the estimate at the root node. (This distortion is not captured by our stochastic model, since, for reasons of simplicity, it does not consider networking and processing delays). A second cause is the inaccuracy in the stochastic model variables used for filter computation, for instance, as a result of errors in the estimation of the evolution of the local variables. We note again that the difference between γ and c is small, despite these potential sources of error. For a given scenario, the minimum estimation error c min is achieved when no updates are filtered. Note that in that case, the difference between γ and c is only caused by the different delays updates experience in reaching the root. When no updates are filtered, the estimation of the model variables has no impact. For the Abovenet topology, c min = 13; and for the grid topology c min = 2. The minimum estimation error c min is larger for the larger topology (the Abovenet). We explain this by the fact that as the size of the network increases, the range of delays experienced by updates (from different nodes) increases. It is feasible to give a bound for the difference between γ and c in real-time, based on the evolution of local variables and the processing/communication delays, for the purpose of tuning the protocol at run-time. Comparing these results with those in [13], we see the same qualitative behavior again. 9

10 Estimation Error c A-GAP Ideal Error Objective Fig. 6. Estimation error c (eq. 4) as a function of the accuracy objective γ (eq. 2) set by the manager at invocation of A-GAP. The figure shows how well the objective γ is achieved. (Grid topology, θ=0.05) 5 Related Work A significant amount of research effort has been put on controlling the fundamental trade off between overhead and accuracy in the context of computer networks. To the best of our knowledge, all the solutions proposed to date only support one type of accuracy objectives, the maximum error [6][7][10][12]. These works focus on guaranteeing that the difference between the estimation and the actual aggregate is always within a configurable range. In contrast, our solution supports different types of accuracy objectives. A-GAP enables us to use any metric that can be computed from an error distribution. The works in [10] and [6] show that, while guaranteeing a maximum error is relatively simple, this is a loose upper bound on the accuracy achieved. This is in line with our results, and speaks for using other types of accuracy objectives. Note that our protocol also permits to provide information about the distribution of experienced error (including the maximum error), while the other schemes cannot provide any estimation of the experienced error. In [6], the authors propose a centralized design, where all nodes report directly to the management station, which aggregates the updates. In contrast, we use incremental aggregation, which (i) distributes the cost of computing the aggregate among all the nodes, and (ii) permits positive and negative errors to cancel each other out, which permits reducing the overhead. The work presented in [7] differs from our work in two key aspects. First, it uses synchronized rounds of operation. In contrast, A-GAP is asynchronous. The motivation for this is the achievement of robustness and scalability. Second, the algorithm in [7] estimates statistics from all the partial aggregates, which depend on the filters. A-GAP only estimates the local variables, which are not affected by filters. All other variables are continuously computed by A-GAP based on these estimates. This gives A-GAP more flexibility in selecting the duration of the control cycle. 10

11 The overhead vs QoE performance achieved by [7], [10], and [12] resembles a negative exponential function for the errors considered, as is the case for A-GAP. 6 Discussion In this paper, we have demonstrated the versatility of our protocol A-GAP for supporting different types of accuracy objectives. Specifically, we have shown that the protocol supports objectives expressed in terms of percentile errors. Previously [13], we had shown its capability for supporting accuracy objectives in terms of the average error. The design of A-GAP allows for supporting any accuracy objective that can be defined as a function of the error distribution. This versatility of A-GAP contrasts with related works, which can only support maximum error objectives, which are easier to control than percentiles and the average error. Based on our own experiences and those reported in [10] and [11], we argue that the average error and percentiles are more significant control parameters for practical scenarios. The protocol dynamically adapts to changes in network topology and to node failures [13], as well as to changes in the statistics that are computed from the local management variables. We consider management protocols that exhibit this kind of autonomic behavior essential for future communication systems. A-GAP continuously estimates the evolution of the management variables that the protocol aggregates. Based on these estimates, all others variables such as the error distributions and incurred overhead are dynamically computed. This approach makes A-GAP adaptive in the sense that changes in the model variables, such as the evolution of the partial aggregate, are computed instead of estimated and, therefore, adapt much faster. While we use SUM as aggregation function throughout this paper, additional aggregation functions, including AVERAGE, MIN, and MAX can be supported by the protocol with straightforward modifications, as discussed in [13]. In general, aggregation functions which are composed of functions that are both commutative and associative can be supported in A-GAP. Currently, we are investigating the quantitative benefits of decentralizing network monitoring. As for future work, we plan to investigate more efficient solutions to the local problem in (eq. 3). We also plan to include support for percentile error objectives in our A-GAP prototype [14]. (Currently, it only supports average error objectives.). This requires only minor modifications to the prototype. Acknowledgments. The authors would like to thank György Dán and Mads Dam at KTH for fruitful discussions around the stochastic model and the design of A-GAP. This work uses network traces collected by the DACS group of the University of Twente for the protocol evaluation. This paper was supported in part by the EC IST- EMANICS Network of Excellence (#26854). It describes work undertaken in the context of the Ambient Networks IST project, which is partially funded by the Commission of the European Union. 11

12 References 1. M. Dam, R. Stadler, A Generic Protocol for Network State Aggregation, Radiovetenskap och Kommunication (RVK), Linkoping, Sweden, June S. Dolev, A. Israeli, and S. Moran, Self-Stabilization of Dynamic Systems Assuming only read/write Atomicity, Distributed Computing, 7:3-16, K. Lim, R. Stadler, A Navigation Pattern for Scalable Internet Management, IEEE/IFIP IM 2001, Seattle, USA, May K. Lim and R. Stadler. SIMPSON a SIMple Pattern Simulator for Networks. July N. Spring, R. Mahajan, and D. Wetherall, Measuring ISP topologies with Rocketfuel, ACM/SIGCOMM, Pittsburgh, USA, August C. Olston and J. Widom, Efficient Monitoring and Querying of Distributed, Dynamic Data via Approximate Replication, IEEE Data Engineering Bulletin, March Antonios Deligiannakis, Yannis Kotidis, and Nick Roussopoulos, Hierarchical In- Network Data Aggregation with Quality Guarantees, EDBT 2004, Crete, Greece, March IEEE. ANSI/IEEE Std 802.1D, 1998 Edition. IEEE, R. van de Meent, A. Pras, Traffic Measurement Data Repository, University of Twente, M. A. Sharaf et al, Balancing energy efficiency and quality of aggregate data in sensor networks, ACM International Journal on Very Large Data Bases, 13(4): , December A. Boulis et al., Aggregation in sensor networks: an energy - accuracy tradeoff, Elsevier Ad-hoc Networks Journal (special issue on sensor network protocols and applications), pages , C. Intanagonwiwat et al., Impact of network density on data aggregation in wireless sensor networks, 22nd International Conference on Distributed Computing Systems, Vienna, Austria, July A. Gonzalez Prieto, R.Stadler, A-GAP: An Adaptive Protocol for Continuous Network Monitoring with Accuracy Objectives, to appear in IEEE Transactions on Network and Service Management. Available at: A. Gonzalez Prieto and R.Stadler "Implementation and Evaluation of A-GAP: Adaptive Monitoring with Controllable Accuracy", submitted to the ACM SIGCOMM workshop on Internet Network Management (INM 07), Kyoto, Japan, August 31, Available at: 12

The Advantages of Network-Wide Monitoring Systems

The Advantages of Network-Wide Monitoring Systems Decentralized Real-time Monitoring of Network-wide Aggregates ABSTRACT The traditional monitoring paradigm of network and systems management, characterized by a central entity polling individual devices,

More information

Adaptive Real-time Monitoring for Large-scale Networked Systems ALBERTO GONZALEZ PRIETO

Adaptive Real-time Monitoring for Large-scale Networked Systems ALBERTO GONZALEZ PRIETO Adaptive Real-time Monitoring for Large-scale Networked Systems ALBERTO GONZALEZ PRIETO Doctoral Thesis Stockholm, Sweden, 2008 School of Electrical Engineering KTH, Stockholm, Sweden Akademisk avhandling

More information

DAG based In-Network Aggregation for Sensor Network Monitoring

DAG based In-Network Aggregation for Sensor Network Monitoring DAG based In-Network Aggregation for Sensor Network Monitoring Shinji Motegi, Kiyohito Yoshihara and Hiroki Horiuchi KDDI R&D Laboratories Inc. {motegi, yosshy, hr-horiuchi}@kddilabs.jp Abstract Wireless

More information

Distributed Monitoring and Resource Management for Large Cloud Environments FETAHI ZEBENIGUS WUHIB

Distributed Monitoring and Resource Management for Large Cloud Environments FETAHI ZEBENIGUS WUHIB Distributed Monitoring and Resource Management for Large Cloud Environments FETAHI ZEBENIGUS WUHIB Doctoral Thesis Stockholm, Sweden, December 2010 TRITA-EE 2010:051 ISSN 1653-5146 ISBN 978-91-7415-794-9

More information

PERFORMANCE ANALYSIS OF AD-HOC ON DEMAND DISTANCE VECTOR FOR MOBILE AD- HOC NETWORK

PERFORMANCE ANALYSIS OF AD-HOC ON DEMAND DISTANCE VECTOR FOR MOBILE AD- HOC NETWORK http:// PERFORMANCE ANALYSIS OF AD-HOC ON DEMAND DISTANCE VECTOR FOR MOBILE AD- HOC NETWORK Anjali Sahni 1, Ajay Kumar Yadav 2 1, 2 Department of Electronics and Communication Engineering, Mewar Institute,

More information

Distributed Dynamic Load Balancing for Iterative-Stencil Applications

Distributed 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 information

Stability of QOS. Avinash Varadarajan, Subhransu Maji {avinash,smaji}@cs.berkeley.edu

Stability of QOS. Avinash Varadarajan, Subhransu Maji {avinash,smaji}@cs.berkeley.edu Stability of QOS Avinash Varadarajan, Subhransu Maji {avinash,smaji}@cs.berkeley.edu Abstract Given a choice between two services, rest of the things being equal, it is natural to prefer the one with more

More information

An Active Packet can be classified as

An 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 information

5 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. 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 information

A NOVEL RESOURCE EFFICIENT DMMS APPROACH

A NOVEL RESOURCE EFFICIENT DMMS APPROACH A NOVEL RESOURCE EFFICIENT DMMS APPROACH FOR NETWORK MONITORING AND CONTROLLING FUNCTIONS Golam R. Khan 1, Sharmistha Khan 2, Dhadesugoor R. Vaman 3, and Suxia Cui 4 Department of Electrical and Computer

More information

Hierarchical In-Network Data Aggregation with Quality Guarantees

Hierarchical In-Network Data Aggregation with Quality Guarantees Hierarchical In-Network Data Aggregation with Quality Guarantees Antonios Deligiannakis 1, Yannis Kotidis 2, and Nick Roussopoulos 1 1 University of Maryland, College Park MD 20742, USA, {adeli,nick}@cs.umd.edu

More information

Adaptive Tolerance Algorithm for Distributed Top-K Monitoring with Bandwidth Constraints

Adaptive Tolerance Algorithm for Distributed Top-K Monitoring with Bandwidth Constraints Adaptive Tolerance Algorithm for Distributed Top-K Monitoring with Bandwidth Constraints Michael Bauer, Srinivasan Ravichandran University of Wisconsin-Madison Department of Computer Sciences {bauer, srini}@cs.wisc.edu

More information

A Scalable Monitoring Approach Based on Aggregation and Refinement

A Scalable Monitoring Approach Based on Aggregation and Refinement IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL 20, NO 4, MAY 2002 677 A Scalable Monitoring Approach Based on Aggregation and Refinement Yow-Jian Lin, Member, IEEE and Mun Choon Chan, Member, IEEE

More information

Management by Network Search

Management by Network Search Management by Network Search Misbah Uddin, Prof. Rolf Stadler KTH Royal Institute of Technology, Sweden Dr. Alex Clemm Cisco Systems, CA, USA November 11, 2014 ANRP Award Talks Session IETF 91 Honolulu,

More information

A Mobility Tolerant Cluster Management Protocol with Dynamic Surrogate Cluster-heads for A Large Ad Hoc Network

A Mobility Tolerant Cluster Management Protocol with Dynamic Surrogate Cluster-heads for A Large Ad Hoc Network A Mobility Tolerant Cluster Management Protocol with Dynamic Surrogate Cluster-heads for A Large Ad Hoc Network Parama Bhaumik 1, Somprokash Bandyopadhyay 2 1 Dept. of Information Technology, Jadavpur

More information

4 Internet QoS Management

4 Internet QoS Management 4 Internet QoS Management Rolf Stadler School of Electrical Engineering KTH Royal Institute of Technology stadler@ee.kth.se September 2008 Overview Network Management Performance Mgt QoS Mgt Resource Control

More information

How To Make A Network Plan Based On Bg, Qos, And Autonomous System (As)

How To Make A Network Plan Based On Bg, Qos, And Autonomous System (As) Policy Based QoS support using BGP Routing Priyadarsi Nanda and Andrew James Simmonds Department of Computer Systems Faculty of Information Technology University of Technology, Sydney Broadway, NSW Australia

More information

Evaluation of Unlimited Storage: Towards Better Data Access Model for Sensor Network

Evaluation of Unlimited Storage: Towards Better Data Access Model for Sensor Network Evaluation of Unlimited Storage: Towards Better Data Access Model for Sensor Network Sagar M Mane Walchand Institute of Technology Solapur. India. Solapur University, Solapur. S.S.Apte Walchand Institute

More information

Chapter 4. VoIP Metric based Traffic Engineering to Support the Service Quality over the Internet (Inter-domain IP network)

Chapter 4. VoIP Metric based Traffic Engineering to Support the Service Quality over the Internet (Inter-domain IP network) Chapter 4 VoIP Metric based Traffic Engineering to Support the Service Quality over the Internet (Inter-domain IP network) 4.1 Introduction Traffic Engineering can be defined as a task of mapping traffic

More information

Bloom Filter based Inter-domain Name Resolution: A Feasibility Study

Bloom Filter based Inter-domain Name Resolution: A Feasibility Study Bloom Filter based Inter-domain Name Resolution: A Feasibility Study Konstantinos V. Katsaros, Wei Koong Chai and George Pavlou University College London, UK Outline Inter-domain name resolution in ICN

More information

other. A B AP wired network

other. A B AP wired network 1 Routing and Channel Assignment in Multi-Channel Multi-Hop Wireless Networks with Single-NIC Devices Jungmin So + Nitin H. Vaidya Department of Computer Science +, Department of Electrical and Computer

More information

Isolines: Energy-efficient Mapping in Sensor Networks

Isolines: Energy-efficient Mapping in Sensor Networks Isolines: Energy-efficient Mapping in Sensor Networks Ignacio Solis and Katia Obraczka {isolis, katia}@cse.ucsc.edu Computer Engineering Department University of California, Santa Cruz April 15, 2005 Abstract

More information

Load Distribution in Large Scale Network Monitoring Infrastructures

Load Distribution in Large Scale Network Monitoring Infrastructures Load Distribution in Large Scale Network Monitoring Infrastructures Josep Sanjuàs-Cuxart, Pere Barlet-Ros, Gianluca Iannaccone, and Josep Solé-Pareta Universitat Politècnica de Catalunya (UPC) {jsanjuas,pbarlet,pareta}@ac.upc.edu

More information

Traffic Engineering for Multiple Spanning Tree Protocol in Large Data Centers

Traffic Engineering for Multiple Spanning Tree Protocol in Large Data Centers Traffic Engineering for Multiple Spanning Tree Protocol in Large Data Centers Ho Trong Viet, Yves Deville, Olivier Bonaventure, Pierre François ICTEAM, Université catholique de Louvain (UCL), Belgium.

More information

An Efficient Distributed Algorithm to Identify and Traceback DDoS Traffic

An Efficient Distributed Algorithm to Identify and Traceback DDoS Traffic Ó The Author 26. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org doi:1.193/comjnl/bxl26

More information

EQ-BGP: an efficient inter-domain QoS routing protocol

EQ-BGP: an efficient inter-domain QoS routing protocol EQ-BGP: an efficient inter-domain QoS routing protocol Andrzej Beben Institute of Telecommunications Warsaw University of Technology Nowowiejska 15/19, 00-665 Warsaw, Poland abeben@tele.pw.edu.pl Abstract

More information

Prediction of DDoS Attack Scheme

Prediction of DDoS Attack Scheme Chapter 5 Prediction of DDoS Attack Scheme Distributed denial of service attack can be launched by malicious nodes participating in the attack, exploit the lack of entry point in a wireless network, and

More information

A Power Efficient QoS Provisioning Architecture for Wireless Ad Hoc Networks

A Power Efficient QoS Provisioning Architecture for Wireless Ad Hoc Networks A Power Efficient QoS Provisioning Architecture for Wireless Ad Hoc Networks Didem Gozupek 1,Symeon Papavassiliou 2, Nirwan Ansari 1, and Jie Yang 1 1 Department of Electrical and Computer Engineering

More information

Robust Router Congestion Control Using Acceptance and Departure Rate Measures

Robust Router Congestion Control Using Acceptance and Departure Rate Measures Robust Router Congestion Control Using Acceptance and Departure Rate Measures Ganesh Gopalakrishnan a, Sneha Kasera b, Catherine Loader c, and Xin Wang b a {ganeshg@microsoft.com}, Microsoft Corporation,

More information

Security-Aware Beacon Based Network Monitoring

Security-Aware Beacon Based Network Monitoring Security-Aware Beacon Based Network Monitoring Masahiro Sasaki, Liang Zhao, Hiroshi Nagamochi Graduate School of Informatics, Kyoto University, Kyoto, Japan Email: {sasaki, liang, nag}@amp.i.kyoto-u.ac.jp

More information

Locality Based Protocol for MultiWriter Replication systems

Locality Based Protocol for MultiWriter Replication systems Locality Based Protocol for MultiWriter Replication systems Lei Gao Department of Computer Science The University of Texas at Austin lgao@cs.utexas.edu One of the challenging problems in building replication

More information

Efficient Doubletree: An Algorithm for Large-Scale Topology Discovery

Efficient Doubletree: An Algorithm for Large-Scale Topology Discovery Middle-East Journal of Scientific Research 15 (9): 1264-1271, 2013 ISSN 1990-9233 IDOSI Publications, 2013 DOI: 10.5829/idosi.mejsr.2013.15.9.11480 Efficient Doubletree: An Algorithm for Large-Scale Topology

More information

QUALITY OF SERVICE METRICS FOR DATA TRANSMISSION IN MESH TOPOLOGIES

QUALITY 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 information

Decentralizing Network Management

Decentralizing Network Management Submitted to IEEE electronic Transactions on Network and Service Management (etnsm) 1 Decentralizing Network Management Koon-Seng Lim, Constantin Adam, Student Members, IEEE and Rolf Stadler, Member, IEEE

More information

Monitoring within an Autonomic Network: A. Framework

Monitoring within an Autonomic Network: A. Framework Monitoring within an Autonomic Network: A GANA based Network Monitoring i Framework Anastasios Zafeiropoulos, Athanassios Liakopoulos, Alan Davy, Ranganai Chaparadza tzafeir@grnet.gr Greek Research and

More information

PERFORMANCE 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 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 information

On demand synchronization and load distribution for database grid-based Web applications

On demand synchronization and load distribution for database grid-based Web applications Data & Knowledge Engineering 51 (24) 295 323 www.elsevier.com/locate/datak On demand synchronization and load distribution for database grid-based Web applications Wen-Syan Li *,1, Kemal Altintas, Murat

More information

A Passive Method for Estimating End-to-End TCP Packet Loss

A Passive Method for Estimating End-to-End TCP Packet Loss A Passive Method for Estimating End-to-End TCP Packet Loss Peter Benko and Andras Veres Traffic Analysis and Network Performance Laboratory, Ericsson Research, Budapest, Hungary {Peter.Benko, Andras.Veres}@eth.ericsson.se

More information

CoMPACT-Monitor: Change-of-Measure based Passive/Active Monitoring Weighted Active Sampling Scheme to Infer QoS

CoMPACT-Monitor: Change-of-Measure based Passive/Active Monitoring Weighted Active Sampling Scheme to Infer QoS CoMPACT-Monitor: Change-of-Measure based Passive/Active Monitoring Weighted Active Sampling Scheme to Infer QoS Masaki Aida, Keisuke Ishibashi, and Toshiyuki Kanazawa NTT Information Sharing Platform Laboratories,

More information

Efficient Doubletree: An Algorithm for Large-Scale Topology Discovery

Efficient Doubletree: An Algorithm for Large-Scale Topology Discovery IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661, p- ISSN: 2278-8727Volume 13, Issue 3 (Jul. - Aug. 2013), PP 05-12 Efficient Doubletree: An Algorithm for Large-Scale Topology Discovery

More information

Performance of networks containing both MaxNet and SumNet links

Performance 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 information

Comparative Analysis of Congestion Control Algorithms Using ns-2

Comparative Analysis of Congestion Control Algorithms Using ns-2 www.ijcsi.org 89 Comparative Analysis of Congestion Control Algorithms Using ns-2 Sanjeev Patel 1, P. K. Gupta 2, Arjun Garg 3, Prateek Mehrotra 4 and Manish Chhabra 5 1 Deptt. of Computer Sc. & Engg,

More information

An Efficient Primary-Segmented Backup Scheme for Dependable Real-Time Communication in Multihop Networks

An Efficient Primary-Segmented Backup Scheme for Dependable Real-Time Communication in Multihop Networks IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 11, NO. 1, FEBRUARY 2003 81 An Efficient Primary-Segmented Backup Scheme for Dependable Real-Time Communication in Multihop Networks Krishna Phani Gummadi, Madhavarapu

More information

A REPORT ON ANALYSIS OF OSPF ROUTING PROTOCOL NORTH CAROLINA STATE UNIVERSITY

A REPORT ON ANALYSIS OF OSPF ROUTING PROTOCOL NORTH CAROLINA STATE UNIVERSITY A REPORT ON ANALYSIS OF OSPF ROUTING PROTOCOL Using OPNET 14.5 Modeler NORTH CAROLINA STATE UNIVERSITY SUBMITTED BY: SHOBHANK SHARMA ssharma5@ncsu.edu Page 1 ANALYSIS OF OSPF ROUTING PROTOCOL A. Introduction

More information

Autonomous Fast Rerouting for Software Defined Network

Autonomous Fast Rerouting for Software Defined Network Autonomous ast Rerouting for Software Defined Network 2012.10.29 NTT Network Service System Laboratories, NTT Corporation Shohei Kamamura, Akeo Masuda, Koji Sasayama Page 1 Outline 1. Background and Motivation

More information

A Dynamic Polling Scheme for the Network Monitoring Problem

A Dynamic Polling Scheme for the Network Monitoring Problem A Dynamic Polling Scheme for the Network Monitoring Problem Feng Gao, Jairo Gutierrez* Dept. of Computer Science *Dept. of Management Science and Information Systems University of Auckland, New Zealand

More information

A New Approach to Developing High-Availability Server

A New Approach to Developing High-Availability Server A New Approach to Developing High-Availability Server James T. Yu, Ph.D. School of Computer Science, Telecommunications, and Information Systems DePaul University jyu@cs.depaul.edu ABSTRACT This paper

More information

Location Information Services in Mobile Ad Hoc Networks

Location Information Services in Mobile Ad Hoc Networks Location Information Services in Mobile Ad Hoc Networks Tracy Camp, Jeff Boleng, Lucas Wilcox Department of Math. and Computer Sciences Colorado School of Mines Golden, Colorado 841 Abstract In recent

More information

Self-Compressive Approach for Distributed System Monitoring

Self-Compressive Approach for Distributed System Monitoring Self-Compressive Approach for Distributed System Monitoring Akshada T Bhondave Dr D.Y Patil COE Computer Department, Pune University, India Santoshkumar Biradar Assistant Prof. Dr D.Y Patil COE, Computer

More information

Network & Agent Based Intrusion Detection Systems

Network & Agent Based Intrusion Detection Systems Network & Agent Based Intrusion Detection Systems Hakan Albag TU Munich, Dep. of Computer Science Exchange Student Istanbul Tech. Uni., Dep. Of Comp. Engineering Abstract. The following document is focused

More information

An Empirical Approach - Distributed Mobility Management for Target Tracking in MANETs

An 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 information

Performance Evaluation of AODV, OLSR Routing Protocol in VOIP Over Ad Hoc

Performance Evaluation of AODV, OLSR Routing Protocol in VOIP Over Ad Hoc (International Journal of Computer Science & Management Studies) Vol. 17, Issue 01 Performance Evaluation of AODV, OLSR Routing Protocol in VOIP Over Ad Hoc Dr. Khalid Hamid Bilal Khartoum, Sudan dr.khalidbilal@hotmail.com

More information

A Multi-Poller based Energy-Efficient Monitoring Scheme for Wireless Sensor Networks

A Multi-Poller based Energy-Efficient Monitoring Scheme for Wireless Sensor Networks A Multi-Poller based Energy-Efficient Monitoring Scheme for Wireless Sensor Networks Changlei Liu and Guohong Cao Department of Computer Science & Engineering The Pennsylvania State University E-mail:

More information

An Architecture for the Self-management of Lambda-Connections in Hybrid Networks

An Architecture for the Self-management of Lambda-Connections in Hybrid Networks An Architecture for the Self-management of Lambda-Connections in Hybrid Networks Tiago Fioreze, Remco van de Meent, and Aiko Pras University of Twente, Enschede, the Netherlands {t.fioreze, r.vandemeent,

More information

AN EFFICIENT STRATEGY OF AGGREGATE SECURE DATA TRANSMISSION

AN EFFICIENT STRATEGY OF AGGREGATE SECURE DATA TRANSMISSION INTERNATIONAL JOURNAL OF REVIEWS ON RECENT ELECTRONICS AND COMPUTER SCIENCE AN EFFICIENT STRATEGY OF AGGREGATE SECURE DATA TRANSMISSION K.Anusha 1, K.Sudha 2 1 M.Tech Student, Dept of CSE, Aurora's Technological

More information

KT The Value Networking Company

KT The Value Networking Company KT The Value Networking Company IRIMS (Internet Routing Information Management System) 2005. 9 Y.D. KIM, G.E.KIM, C.K.Hwang, J.H.YOO (webman, gekim, ckhwang, styoo@kt kt.co..co.kr) Abstract An AS (Autonomous

More information

TOPOLOGIES NETWORK SECURITY SERVICES

TOPOLOGIES 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 information

Validating the System Behavior of Large-Scale Networked Computers

Validating the System Behavior of Large-Scale Networked Computers Validating the System Behavior of Large-Scale Networked Computers Chen-Nee Chuah Robust & Ubiquitous Networking (RUBINET) Lab http://www.ece.ucdavis.edu/rubinet Electrical & Computer Engineering University

More information

LOAD 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 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 information

Cisco Nexus Data Broker: Deployment Use Cases with Cisco Nexus 3000 Series Switches

Cisco Nexus Data Broker: Deployment Use Cases with Cisco Nexus 3000 Series Switches White Paper Cisco Nexus Data Broker: Deployment Use Cases with Cisco Nexus 3000 Series Switches What You Will Learn Network Traffic monitoring using taps and Switched Port Analyzer (SPAN) is not a new

More information

Effective Network Monitoring

Effective Network Monitoring Effective Network Monitoring Yuri Breitbart, Feodor Dragan, Hassan Gobjuka Department of Computer Science Kent State University Kent, OH 44242 {yuri,dragan,hgobjuka}@cs.kent.edu 1 Abstract Various network

More information

A Network Management Framework for Emerging Telecommunications Network. asamba@kent.edu

A Network Management Framework for Emerging Telecommunications Network. asamba@kent.edu Symposium on Modeling and Simulation Tools for Emerging Telecommunication Networks: Needs, Trends, Challenges, Solutions Munich, Germany, Sept. 8 9, 2005 A Network Management Framework for Emerging Telecommunications

More information

Disaster Recovery Design Ehab Ashary University of Colorado at Colorado Springs

Disaster Recovery Design Ehab Ashary University of Colorado at Colorado Springs Disaster Recovery Design Ehab Ashary University of Colorado at Colorado Springs As a head of the campus network department in the Deanship of Information Technology at King Abdulaziz University for more

More information

An apparatus for P2P classification in Netflow traces

An apparatus for P2P classification in Netflow traces An apparatus for P2P classification in Netflow traces Andrew M Gossett, Ioannis Papapanagiotou and Michael Devetsikiotis Electrical and Computer Engineering, North Carolina State University, Raleigh, USA

More information

Master s Thesis. A Study on Active Queue Management Mechanisms for. Internet Routers: Design, Performance Analysis, and.

Master s Thesis. A Study on Active Queue Management Mechanisms for. Internet Routers: Design, Performance Analysis, and. Master s Thesis Title A Study on Active Queue Management Mechanisms for Internet Routers: Design, Performance Analysis, and Parameter Tuning Supervisor Prof. Masayuki Murata Author Tomoya Eguchi February

More information

Chapter 3. Enterprise Campus Network Design

Chapter 3. Enterprise Campus Network Design Chapter 3 Enterprise Campus Network Design 1 Overview The network foundation hosting these technologies for an emerging enterprise should be efficient, highly available, scalable, and manageable. This

More information

Response time behavior of distributed voting algorithms for managing replicated data

Response time behavior of distributed voting algorithms for managing replicated data Information Processing Letters 75 (2000) 247 253 Response time behavior of distributed voting algorithms for managing replicated data Ing-Ray Chen a,, Ding-Chau Wang b, Chih-Ping Chu b a Department of

More information

Proactive, Resource-Aware, Tunable Real-time Fault-tolerant Middleware

Proactive, Resource-Aware, Tunable Real-time Fault-tolerant Middleware Proactive, Resource-Aware, Tunable Real-time Fault-tolerant Middleware Priya Narasimhan T. Dumitraş, A. Paulos, S. Pertet, C. Reverte, J. Slember, D. Srivastava Carnegie Mellon University Problem Description

More information

EXTENDING NETWORK KNOWLEDGE: MAKING OLSR A QUALITY OF SERVICE CONDUCIVE PROTOCOL

EXTENDING NETWORK KNOWLEDGE: MAKING OLSR A QUALITY OF SERVICE CONDUCIVE PROTOCOL EXTENDING NETWORK KNOWLEDGE: MAKING OLSR A QUALITY OF SERVICE CONDUCIVE PROTOCOL by Pedro Eduardo Villanueva-Pena, Thomas Kunz Carleton University January, 2006 This report examines mechanisms to gradually

More information

Wireless Sensor Networks Database: Data Management and Implementation

Wireless Sensor Networks Database: Data Management and Implementation Sensors & Transducers 2014 by IFSA Publishing, S. L. http://www.sensorsportal.com Wireless Sensor Networks Database: Data Management and Implementation Ping Liu Computer and Information Engineering Institute,

More information

Transactional Support for SDN Control Planes "

Transactional Support for SDN Control Planes Transactional Support for SDN Control Planes Petr Kuznetsov Telecom ParisTech WTTM, 2015 Software Defined Networking An emerging paradigm in computer network management Separate forwarding hardware (data

More information

CROSS LAYER BASED MULTIPATH ROUTING FOR LOAD BALANCING

CROSS 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 information

Proceedings of the Federated Conference on Computer Science and Information Systems pp. 1005 1011

Proceedings of the Federated Conference on Computer Science and Information Systems pp. 1005 1011 Proceedings of the Federated Conference on Computer Science and Information Systems pp. 1005 1011 ISBN 978-83-60810-22-4 978-83-60810-22-4/$25.00 c 2011 IEEE 1005 1006 PROCEEDINGS OF THE FEDCSIS. SZCZECIN,

More information

Establishing 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 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 information

A very short history of networking

A very short history of networking A New vision for network architecture David Clark M.I.T. Laboratory for Computer Science September, 2002 V3.0 Abstract This is a proposal for a long-term program in network research, consistent with the

More information

A Framework for End-to-End Proactive Network Management

A Framework for End-to-End Proactive Network Management A Framework for End-to-End Proactive Network Management S. Hariri, Y. Kim, P. Varshney, Department of Electrical Engineering and Computer Science Syracuse University, Syracuse, NY 13244 {hariri, yhkim,varshey}@cat.syr.edu

More information

Development of Monitoring Tools for Measuring Network Performances: A Passive Approach

Development of Monitoring Tools for Measuring Network Performances: A Passive Approach IJCST Vo l. 6, Is s u e 4, Oc t - De c 2015 ISSN : 0976-8491 (Online) ISSN : 2229-4333 (Print) Development of Monitoring Tools for Measuring Network Performances: A Passive Approach 1 Abdullah Al Mamun,

More information

Adaptive Probing: A Monitoring-Based Probing Approach for Fault Localization in Networks

Adaptive Probing: A Monitoring-Based Probing Approach for Fault Localization in Networks Adaptive Probing: A Monitoring-Based Probing Approach for Fault Localization in Networks Akshay Kumar *, R. K. Ghosh, Maitreya Natu *Student author Indian Institute of Technology, Kanpur, India Tata Research

More information

AN EFFICIENT DISTRIBUTED CONTROL LAW FOR LOAD BALANCING IN CONTENT DELIVERY NETWORKS

AN EFFICIENT DISTRIBUTED CONTROL LAW FOR LOAD BALANCING IN CONTENT DELIVERY NETWORKS Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 9, September 2014,

More information

International journal of Engineering Research-Online A Peer Reviewed International Journal Articles available online http://www.ijoer.

International journal of Engineering Research-Online A Peer Reviewed International Journal Articles available online http://www.ijoer. RESEARCH ARTICLE ISSN: 2321-7758 GLOBAL LOAD DISTRIBUTION USING SKIP GRAPH, BATON AND CHORD J.K.JEEVITHA, B.KARTHIKA* Information Technology,PSNA College of Engineering & Technology, Dindigul, India Article

More information

A Conference Control Protocol for Highly Interactive Video-conferencing

A Conference Control Protocol for Highly Interactive Video-conferencing A Conference Control Protocol for Highly Interactive Video-conferencing Ruibiao Qiu Fred Kuhns Jerome R. Cox Applied Research Laboratory Department of Computer Science Washington University Saint Louis,

More information

Customer Specific Wireless Network Solutions Based on Standard IEEE 802.15.4

Customer 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 information

DRAFT. 1 Proposed System. 1.1 Abstract

DRAFT. 1 Proposed System. 1.1 Abstract Doctoral Thesis Proposal A language-level approach to distributed computation with weak synchronization and its application to cloud and edge computing environments. Christopher Meiklejohn Université catholique

More information

Analyzing Mission Critical Voice over IP Networks. Michael Todd Gardner

Analyzing Mission Critical Voice over IP Networks. Michael Todd Gardner Analyzing Mission Critical Voice over IP Networks Michael Todd Gardner Organization What is Mission Critical Voice? Why Study Mission Critical Voice over IP? Approach to Analyze Mission Critical Voice

More information

6.852: Distributed Algorithms Fall, 2009. Class 2

6.852: Distributed Algorithms Fall, 2009. Class 2 .8: Distributed Algorithms Fall, 009 Class Today s plan Leader election in a synchronous ring: Lower bound for comparison-based algorithms. Basic computation in general synchronous networks: Leader election

More information

A NETWORK CONSTRUCTION METHOD FOR A SCALABLE P2P VIDEO CONFERENCING SYSTEM

A NETWORK CONSTRUCTION METHOD FOR A SCALABLE P2P VIDEO CONFERENCING SYSTEM A NETWORK CONSTRUCTION METHOD FOR A SCALABLE P2P VIDEO CONFERENCING SYSTEM Hideto Horiuchi, Naoki Wakamiya and Masayuki Murata Graduate School of Information Science and Technology, Osaka University 1

More information

Keywords Distributed Computing, On Demand Resources, Cloud Computing, Virtualization, Server Consolidation, Load Balancing

Keywords Distributed Computing, On Demand Resources, Cloud Computing, Virtualization, Server Consolidation, Load Balancing Volume 5, Issue 1, January 2015 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Survey on Load

More information

Towards P2P-based Computer Network Management *

Towards P2P-based Computer Network Management * Towards P2P-based Computer Network Management * Hui Xu, and Debao Xiao Department of Computer Science, Huazhong Normal University Wuhan, P.R. China, 430079 xuhui_1004@hotmail.com Abstract Nowadays, the

More information

Consecutive Geographic Multicasting Protocol in Large-Scale Wireless Sensor Networks

Consecutive Geographic Multicasting Protocol in Large-Scale Wireless Sensor Networks 21st Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications Consecutive Geographic Multicasting Protocol in Large-Scale Wireless Sensor Networks Jeongcheol Lee, Euisin

More information

A Hybrid Electrical and Optical Networking Topology of Data Center for Big Data Network

A Hybrid Electrical and Optical Networking Topology of Data Center for Big Data Network ASEE 2014 Zone I Conference, April 3-5, 2014, University of Bridgeport, Bridgpeort, CT, USA A Hybrid Electrical and Optical Networking Topology of Data Center for Big Data Network Mohammad Naimur Rahman

More information

Resource Monitoring in GRID computing

Resource Monitoring in GRID computing Seminar May 16, 2003 Resource Monitoring in GRID computing Augusto Ciuffoletti Dipartimento di Informatica - Univ. di Pisa next: Network Monitoring Architecture Network Monitoring Architecture controls

More information

A NOVEL OVERLAY IDS FOR WIRELESS SENSOR NETWORKS

A NOVEL OVERLAY IDS FOR WIRELESS SENSOR NETWORKS A NOVEL OVERLAY IDS FOR WIRELESS SENSOR NETWORKS Sumanta Saha, Md. Safiqul Islam, Md. Sakhawat Hossen School of Information and Communication Technology The Royal Institute of Technology (KTH) Stockholm,

More information

A Study of Dynamic Addressing Techniques in Mobile Ad hoc Networks

A Study of Dynamic Addressing Techniques in Mobile Ad hoc Networks A Study of Dynamic Addressing Techniques in Mobile Ad hoc Networks Yuan Sun Elizabeth M. Belding-Royer Department of Computer Science University of California, Santa Barbara suny, ebelding @cs.ucsb.edu

More information

EFFICIENT DETECTION IN DDOS ATTACK FOR TOPOLOGY GRAPH DEPENDENT PERFORMANCE IN PPM LARGE SCALE IPTRACEBACK

EFFICIENT DETECTION IN DDOS ATTACK FOR TOPOLOGY GRAPH DEPENDENT PERFORMANCE IN PPM LARGE SCALE IPTRACEBACK EFFICIENT DETECTION IN DDOS ATTACK FOR TOPOLOGY GRAPH DEPENDENT PERFORMANCE IN PPM LARGE SCALE IPTRACEBACK S.Abarna 1, R.Padmapriya 2 1 Mphil Scholar, 2 Assistant Professor, Department of Computer Science,

More information

Evolution der Dienste im zukünftigen Internet

Evolution der Dienste im zukünftigen Internet Prof. Dr. P. Tran-Gia Evolution der Dienste im zukünftigen Internet www3.informatik.uni-wuerzburg.de Tools to find the Future Internet Impossible to see the future is. (Master Yoda) IP & Post-IP future

More information

WAVE: Popularity-based and Collaborative In-network Caching for Content-Oriented Networks

WAVE: Popularity-based and Collaborative In-network Caching for Content-Oriented Networks WAVE: Popularity-based and Collaborative In-network Caching for Content-Oriented Networks K. D. Cho et al., IEEE INFOCOM 2012 Workshop, pp. 316-321, March 2012. January 17, 2013 Byeong-Gi Kim Park Laboratory,

More information

Monitoring Large-Scale Wireless Sensor Networks

Monitoring Large-Scale Wireless Sensor Networks Monitoring Large-Scale Wireless Sensor Networks using Epidemic Protocols Daniela Gavidia, Spyros Voulgaris, Maarten van Steen Vrije Universiteit Amsterdam Faculty of Science Department of Computer Science

More information

Switched Interconnect for System-on-a-Chip Designs

Switched Interconnect for System-on-a-Chip Designs witched Interconnect for ystem-on-a-chip Designs Abstract Daniel iklund and Dake Liu Dept. of Physics and Measurement Technology Linköping University -581 83 Linköping {danwi,dake}@ifm.liu.se ith the increased

More information

A Distributed Constraint Optimization Algorithm for Dynamic Load Balancing in WLANs

A Distributed Constraint Optimization Algorithm for Dynamic Load Balancing in WLANs A Distributed Constraint Optimization Algorithm for Dynamic Load Balancing in WLANs Shanjun Cheng 1, Anita Raja 1, Jiang(Linda) Xie 2, and Ivan Howitt 2 1 Department of Software and Information Systems

More information

Dependability in Web Services

Dependability in Web Services Dependability in Web Services Christian Mikalsen chrismi@ifi.uio.no INF5360, Spring 2008 1 Agenda Introduction to Web Services. Extensible Web Services Architecture for Notification in Large- Scale Systems.

More information