| Author | Title | Year | Journal/Proceedings | Keywords | INSPEC Keywords | DOI/URL |
|---|---|---|---|---|---|---|
| Abdelwahed, S. and Jia Bai and Rong Su and Kandasamy, N. | On the application of predictive control techniques for adaptive performance management of computing systems | 2009 | Network and Service Management, IEEE Transactions on Vol. 6(4), pp. 212 -225 |
self-management of computing systems , autonomic computing , model-based management techniques , power management of computing systems | adaptive control , control engineering computing , fault tolerant computing , predictive control , real-time systems | DOI |
| Abstract: This paper addresses adaptive performance management of real-time computing systems. We consider a generic model-based predictive control approach that can be applied to a variety of computing applications in which the system performance must be tuned using a finite set of control inputs. The paper focuses on several key aspects affecting the application of this control technique to practical systems. In particular, we present techniques to enhance the speed of the control algorithm for real-time systems. Next we study the feasibility of the predictive control policy for a given system model and performance specification under uncertain operating conditions. The paper then introduces several measures to characterize the performance of the controller, and presents a generic tool for system modeling and automatic control synthesis. Finally, we present a case study involving a real-time computing system to demonstrate the applicability of the predictive control framework. | ||||||
BibTeX:
@article{5374030,
author = {Abdelwahed, S. and Jia Bai and Rong Su and Kandasamy, N.},
title = {On the application of predictive control techniques for adaptive performance management of computing systems},
journal = {Network and Service Management, IEEE Transactions on},
year = {2009},
volume = {6},
number = {4},
pages = {212 -225},
doi = {http://dx.doi.org/10.1109/TNSM.2009.04.090402}
}
|
||||||
| Adam, C. and Stadler, R. | Service Middleware for Self-Managing Large-Scale Systems | 2007 | Network and Service Management, IEEE Transactions on Vol. 4(3), pp. 50 -64 |
control systems , distributed algorithms , large-scale systems , middleware , peer to peer computing , resource management , routing , scalability , size control , system testing | client-server systems , computational complexity , distributed algorithms , middleware , peer-to-peer computing , resource allocation | DOI |
| Abstract: Resource management poses particular challenges in large-scale systems, such as server clusters that simultaneously process requests from a large number of clients. A resource management scheme for such systems must scale both in the in the number of cluster nodes and the number of applications the cluster supports. Current solutions do not exhibit both of these properties at the same time. Many are centralized, which limits their scalability in terms of the number of nodes, or they are decentralized but rely on replicated directories, which also reduces their ability to scale. In this paper, we propose novel solutions to request routing and application placement- two key mechanisms in a scalable resource management scheme. Our solution to request routing is based on selective update propagation, which ensures that the control load on a cluster node is independent of the system size. Application placement is approached in a decentralized manner, by using a distributed algorithm that maximizes resource utilization and allows for service differentiation under overload. The paper demonstrates how the above solutions can be integrated into an overall design for a peer-to-peer management middleware that exhibits properties of self-organization. Through complexity analysis and simulation, we show to which extent the system design is scalable. We have built a prototype using accepted technologies and have evaluated it using a standard benchmark. The testbed measurements show that the implementation, within the parameter range tested, operates efficiently, quickly adapts to a changing environment and allows for effective service differentiation by a system administrator. | ||||||
BibTeX:
@article{4489641,
author = {Adam, C. and Stadler, R.},
title = {Service Middleware for Self-Managing Large-Scale Systems},
journal = {Network and Service Management, IEEE Transactions on},
year = {2007},
volume = {4},
number = {3},
pages = {50 -64},
doi = {http://dx.doi.org/10.1109/TNSM.2007.021103}
}
|
||||||
| Adam, Constantin and Stadler, Rolf | A middleware design for large-scale clusters offering multiple services | 2006 | Network and Service Management, IEEE Transactions on Vol. 3(1), pp. 1 -12 |
autonomic computing , decentralized control , quality of service , self-organization , web services | DOI | |
| Abstract: We present a decentralized design that dynamically allocates resources to multiple services inside a global server cluster. The design supports QoS objectives (maximum response time and maximum loss rate) for each service. A system administrator can modify policies that assign relative importance to services and, in this way, control the resource allocation process. Distinctive features of our design are the use of an epidemic protocol to disseminate state and control information, as well as the decentralized evaluation of utility functions to control resource partitioning among services. Simulation results show that the system operates both effectively and efficiently; it meets the QoS objectives and dynamically adapts to load changes and to failures. In case of overload, the service quality degrades gracefully, controlled by the cluster policies. | ||||||
BibTeX:
@article{4798302,
author = {Adam, Constantin and Stadler, Rolf},
title = {A middleware design for large-scale clusters offering multiple services},
journal = {Network and Service Management, IEEE Transactions on},
year = {2006},
volume = {3},
number = {1},
pages = {1 -12},
doi = {http://dx.doi.org/10.1109/TNSM.2006.4798302}
}
|
||||||
| Agarwal, M. and Gautam Kar and Mahindru, R. and Neogi, A. and Sailer, A. | Performance problem prediction in transaction-based e-business systems | 2008 | Network and Service Management, IEEE Transactions on Vol. 5(1), pp. 1 -10 |
costs , data mining , delay , monitoring , network servers , performance analysis , resource management , runtime environment , throughput , web server | business data processing , electronic data interchange | DOI |
| Abstract: Key areas in managing e-commerce systems are problem prediction, root cause analysis, and automated problem remediation. Anticipating SLO violations by proactive problem determination (PD) is particularly important since it can significantly lower the business impact of application performance problems. The main contribution of this paper is to investigate proactive PD based on two important concepts: dependency graphs and dynamic runtime performance characteristics of resources that comprise an I/T environment. The authors show how one can calculate and use the contribution of all supporting resources for a transaction to the end-to-end SLO for that transaction. Higher order moments of these components' contributions are further tracked for proactive alerting. An important aspect of this process is the classification of user transactions based on the profile of their resource usage, enabling one to set appropriate thresholds for the different classes only. Combined with the complete or semi-complete dependency information, our approach confines the scope of potential root causes to a small set of components, thus enabling efficient performance problem anticipation and quick remediation. | ||||||
BibTeX:
@article{4570775,
author = {Agarwal, M. and Gautam Kar and Mahindru, R. and Neogi, A. and Sailer, A.},
title = {Performance problem prediction in transaction-based e-business systems},
journal = {Network and Service Management, IEEE Transactions on},
year = {2008},
volume = {5},
number = {1},
pages = {1 -10},
doi = {http://dx.doi.org/10.1109/TNSM.2008.080101}
}
|
||||||
| Agarwal, Manoj K. and Gupta, Manish and Kar, Gautam and Neogi, Anindya and Sailer, Anca | Mining activity data for dynamic dependency discovery in e-business systems | 2004 | Network and Service Management, IEEE Transactions on Vol. 1(2), pp. 49 -58 |
resource management , computer network management , dependency graph , event correlation , monitoring | DOI | |
| Abstract: The growing popularity of e-business has stimulated web sites to evolve from static content servers to complex multi-tier systems built from heterogeneous server platforms. E-businesses now spend a large fraction of their IT budgets maintaining, troubleshooting, and optimizing these web sites. It has been shown that such system management activities may be simplified or automated to various extents if a dynamic dependency graph of the system were available. Currently, all known solutions to the dynamic dependency graph extraction problem are intrusive in nature, i.e. require modifications at application or middleware level. In this paper, we describe non-intrusive techniques based on data mining, which process existing monitoring data generated by server platforms to automatically extract the system component dependency graphs in multi-tier e-business platforms, without any additional application or system modification. | ||||||
BibTeX:
@article{4798290,
author = {Agarwal, Manoj K. and Gupta, Manish and Kar, Gautam and Neogi, Anindya and Sailer, Anca},
title = {Mining activity data for dynamic dependency discovery in e-business systems},
journal = {Network and Service Management, IEEE Transactions on},
year = {2004},
volume = {1},
number = {2},
pages = {49 -58},
doi = {http://dx.doi.org/10.1109/TNSM.2004.4798290}
}
|
||||||
| Aib, I. and Boutaba, R. | On Leveraging Policy-Based Management for Maximizing Business Profit | 2007 | Network and Service Management, IEEE Transactions on Vol. 4(3), pp. 25 -39 |
cost function , error correction , heart , laser sintering , phase detection , quality management , quality of service , runtime , scheduling algorithm , testing | approximation theory , optimisation , profitability , scheduling | DOI |
| Abstract: This paper presents a systematic approach to business and policy driven refinement. It also discusses an implementation of an application-hosting service level agreement (SLA) use case. We make use of a simple application hosting SLA template, for which we derive a low-level policy-based service level specification (SLS). The SLS policy set is then analyzed for static consistency and runtime efficiency. The Static Analysis phase involves several consistency tests introduced to detect and correct errors in the original SLS. The Dynamic analysis phase considers the runtime dynamics of policy execution as part of the policy refinement process. This latter phase aims at optimizing the business profit of the service provider. Through mathematical approximation, we derive three policy scheduling algorithms. The algorithms are then implemented and compared against random and first come first served (FCFS) scheduling. This paper shows, in addition to the systematic refinement process, the importance of analyzing the dynamics of a policy management solution before it is actually implemented. The simulations have been performed using the VS Policy Simulator tool. | ||||||
BibTeX:
@article{4489642,
author = {Aib, I. and Boutaba, R.},
title = {On Leveraging Policy-Based Management for Maximizing Business Profit},
journal = {Network and Service Management, IEEE Transactions on},
year = {2007},
volume = {4},
number = {3},
pages = {25 -39},
doi = {http://dx.doi.org/10.1109/TNSM.2007.021104}
}
|
||||||
| Al-Shaer, E.S. and Hamed, H.H. | Modeling and Management of Firewall Policies | 2004 | Network and Service Management, IEEE Transactions on Vol. 1(1), pp. 2 -10 |
defense industry , high level languages , home automation , ip networks , information filtering , information filters , matched filters , national security , technology management , telecommunication traffic | DOI | |
| Abstract: Firewalls are core elements in network security. However, managing firewall rules, especially for enterprise networks, has become complex and error-prone. Firewall filtering rules have to be carefully written and organized in order to correctly implement the security policy. In addition, inserting or modifying a filtering rule requires thorough analysis of the relationship between this rule and other rules in order to determine the proper order of this rule and commit the updates. In this paper we present a set of techniques and algorithms that provide automatic discovery of firewall policy anomalies to reveal rule conflicts and potential problems in legacy firewalls, and anomaly-free policy editing for rule insertion, removal, and modification. This is implemented in a user-friendly tool called ¿Firewall Policy Advisor.¿ The Firewall Policy Advisor significantly simplifies the management of any generic firewall policy written as filtering rules, while minimizing network vulnerability due to firewall rule misconfiguration. | ||||||
BibTeX:
@article{4623689,
author = {Al-Shaer, E.S. and Hamed, H.H.},
title = {Modeling and Management of Firewall Policies},
journal = {Network and Service Management, IEEE Transactions on},
year = {2004},
volume = {1},
number = {1},
pages = {2 -10},
doi = {http://dx.doi.org/10.1109/TNSM.2004.4623689}
}
|
||||||
| Alshaer, H. and Elmirghani, J. | Multilayer Dynamic Traffic Grooming with Constrained Differentiated Resilience in IP/MPLS-over-WDM Networks | 2012 | Network and Service Management, IEEE Transactions on Vol. 9(1), pp. 60-72 |
constraints-based differentiated resilience , ip/mpls-over-wdm networks , differentiated traffic grooming , dynamic connections provisioning , heuristic scheme , multilayer scheme | DOI | |
| Abstract: Our research study in this paper focuses on supporting differentiated resilience services in IP/MPLS-over-WDM networks with minimum resources while guaranteeing the quality in provisioned services (QoS) for subscribers. This has been achieved through our multilayer scheme which supports dynamic traffic grooming associated with constrained differentiated resilience. This scheme incorporates an intelligent adaptive heuristic approach and other traffic management mechanisms which solve multiple challenging problems: Differentiated multilayer dynamic traffic grooming based on connections granularity and priority, and connection admission control and wavelength assignment subject to multiple QoS and resilience constraints. We have implemented this scheme to evaluate its performance through conducting simulation experiments. The results demonstrate that our multilayer scheme can enable a network operator to significantly improve the utilization of resources in WDM networks as well as reduce the connection and bandwidth blocking probabilities of all supported traffic classes while guaranteeing their requirements in terms of QoS, resilience and optical physical impairments. | ||||||
BibTeX:
@article{6092406,
author = {Alshaer, H. and Elmirghani, J.},
title = {Multilayer Dynamic Traffic Grooming with Constrained Differentiated Resilience in IP/MPLS-over-WDM Networks},
journal = {Network and Service Management, IEEE Transactions on},
year = {2012},
volume = {9},
number = {1},
pages = {60-72},
doi = {http://dx.doi.org/10.1109/TNSM.2011.110911.110115}
}
|
||||||
| Ariba, Y. and Gouaisbaut, F. and Labit, Y. | Feedback control for router management and TCP/IP network stability | 2009 | Network and Service Management, IEEE Transactions on Vol. 6(4), pp. 255 -266 |
active queue management , tcp network model , congestion control , control theory , multiple time delay system , stability | computer network management , delays , quality of service , queueing theory , stability , state feedback , telecommunication congestion control , telecommunication network topology , time-varying systems , transport protocols | DOI |
| Abstract: Several works have established links between congestion control in communication networks and feedback control theory. In this paper, following this paradigm, the design of an AQM (active queue management) ensuring the stability of the congestion phenomenon at a router is proposed. To this end, a modified fluid flow model of TCP (transmission control protocol) that takes into account all delays of the topology is introduced. Then, appropriate tools from control theory are used to address the stability issue and to cope with the time-varying nature of the multiple delays. More precisely, the design of the AQM is formulated as a structured state feedback for multiple time delay systems through the quadratic separation framework. The objective of this mechanism is to ensure the regulation of the queue size of the congested router as well as flow rates to a prescribed level. Furthermore, the proposed methodology allows to set arbitrarily the QoS (quality of service) of the communications following through the controlled router. Finally, a numerical example and some simulations support the exposed theory. | ||||||
BibTeX:
@article{5374033,
author = {Ariba, Y. and Gouaisbaut, F. and Labit, Y.},
title = {Feedback control for router management and TCP/IP network stability},
journal = {Network and Service Management, IEEE Transactions on},
year = {2009},
volume = {6},
number = {4},
pages = {255 -266},
doi = {http://dx.doi.org/10.1109/TNSM.2009.04.090405}
}
|
||||||
| Badonnel, R. and State, R. and Festor, O. | A Probabilistic Approach for Managing Mobile Ad-Hoc Networks | 2007 | Network and Service Management, IEEE Transactions on Vol. 4(1), pp. 39 -50 |
ad hoc networks , disaster management , fault detection , information management , monitoring , nominations and elections , organizing , quality management , quality of service | ad hoc networks , mobile computing , mobile radio , telecommunication network management | DOI |
| Abstract: A pure management approach where all the nodes are managed at any time is too strict for mobile ad-hoc networks. Instead of addressing the management of the whole network, we propose a probabilistic scheme where only a subset of nodes is managed in order to provide a light-weight and efficient management. These nodes are determined based on their network behavior to favor subsets of well connected and network participating nodes. With respect to such a selective management scheme, we derive probabilistic guarantees on the percentage of nodes to be managed. Our contribution is centered on a distributed self-organizing management algorithm at the application layer, its efficient deployment into a management architecture and on a comprehensive simulation study. We will show how to organize the management plane by extracting spatio-temporal components and by selecting manager nodes with several election mechanisms based on degree centrality, eigenvector centrality and K-means paradigm. | ||||||
BibTeX:
@article{4275033,
author = {Badonnel, R. and State, R. and Festor, O.},
title = {A Probabilistic Approach for Managing Mobile Ad-Hoc Networks},
journal = {Network and Service Management, IEEE Transactions on},
year = {2007},
volume = {4},
number = {1},
pages = {39 -50},
doi = {http://dx.doi.org/10.1109/TNSM.2007.030104}
}
|
||||||
| Baliosian, J. and Stadler, R. | Distributed auto-configuration of neighboring cell graphs in radio access networks | 2010 | Network and Service Management, IEEE Transactions on Vol. 7(3), pp. 145 -157 |
self-management, distributed management , auto-configuration, radio access networks, umts | 3g mobile communication , mobility management (mobile radio) , radio access networks , radio links , routing protocols , telecommunication network planning , telecommunication network reliability | DOI |
| Abstract: In order to execute a handover processes in a GSM or UMTS Radio Access Network, each cell has a list of neighbors to which such handovers may be made. Today, these lists are statically configured during network planning, which does not allow for dynamic adaptation of the network to changes and unexpected events such as a cell failure. This paper advocates an autonomic, decentralized approach to dynamically configure neighboring cell lists. The main contribution of this work is a novel protocol, called DOC, which detects and continuously tracks the coverage overlaps among cells. The protocol executes on a spanning tree where the nodes are radio base stations and the links represent communication channels. Over this tree, nodes periodically exchange information about terminals that are in their respective coverage area. Bloom filters are used for efficient representations of terminal sets and efficient set operations. The protocol aggregates Bloom filters to reduce the communication overhead and also for routing messages along the tree. Using simulation, we study the system in steady state, when a base station is added or a base station fails, and also during the initialization phase where the system self-configures. | ||||||
BibTeX:
@article{5560570,
author = {Baliosian, J. and Stadler, R.},
title = {Distributed auto-configuration of neighboring cell graphs in radio access networks},
journal = {Network and Service Management, IEEE Transactions on},
year = {2010},
volume = {7},
number = {3},
pages = {145 -157},
doi = {http://dx.doi.org/10.1109/TNSM.2010.1009.I9P0330}
}
|
||||||
| Balon, S. and Lepropre, J. and Delcourt, O. and Skivee, F. and Leduc, G. | Traffic Engineering an Operational Network with the TOTEM Toolbox | 2007 | Network and Service Management, IEEE Transactions on Vol. 4(1), pp. 51 -61 |
algorithm design and analysis , failure analysis , multiprotocol label switching , power engineering and energy , protocols , routing , telecommunication traffic , tellurium , testing , traffic control | multiprotocol label switching , telecommunication networks , traffic engineering computing | DOI |
| Abstract: We explain how the TOTEM toolbox can be used to engineer an operational network. TOTEM is an open source TOolbox for Traffic Engineering Methods which covers IP- based and MPLS-based intradomain traffic engineering (TE) algorithms, but also interdomain TE. In this paper, we use the toolbox as an off-line simulator to optimise the traffic of an operational network. To help an operator choose between an IP-based or MPLS-based solution, or find the best way to load- balance a network for a given traffic, our case study compares several IP and MPLS routing algorithms, evaluates the impact of hot-potato routing on the intradomain traffic matrix, and analyses the worst-case link failure. This study reveals the power of a toolbox that federates many traffic engineering algorithms. | ||||||
BibTeX:
@article{4275034,
author = {Balon, S. and Lepropre, J. and Delcourt, O. and Skivee, F. and Leduc, G.},
title = {Traffic Engineering an Operational Network with the TOTEM Toolbox},
journal = {Network and Service Management, IEEE Transactions on},
year = {2007},
volume = {4},
number = {1},
pages = {51 -61},
doi = {http://dx.doi.org/10.1109/TNSM.2007.030105}
}
|
||||||
| Bandara, Arosha K. and Lupu, Emil C. and Russo, Alessandra and Dulay, Naranker and Sloman, Morris and Flegkas, Paris and Charalambides, Marinos and Pavlou, George | Policy refinement for IP differentiated services Quality of Service management | 2006 | Network and Service Management, IEEE Transactions on Vol. 3(2), pp. 2 -13 |
goal refinement , policy refinement , refinement patterns | DOI | |
| Abstract: Policy-based management provides the ability to dynamically re-configure DiffServ networks such that desired Quality of Service (QoS) goals are achieved. This includes network provisioning decisions, performing admission control, and adapting bandwidth allocation dynamically. QoS management aims to satisfy the Service Level Agreements (SLAs) contracted by the provider and therefore QoS policies are derived from SLA specifications and the provider's business goals. This policy refinement is usually performed manually with no means of verifying that the policies written are supported by the network devices and actually achieve the desired QoS goals. Tool support is lacking and policy refinement has rarely been addressed in the literature. This paper extends our previous approach to policy refinement and shows how to apply it to the domain of DiffServ QoS management. We make use of goal elaboration and abductive reasoning to derive strategies that will achieve a given high-level goal. By combining these strategies with events and constraints, we show how policies can be refined, and what tool support can be provided for the refinement process using examples from the QoS management domain. The approach presented here can be used in other application domains such as storage area networks or security management. | ||||||
BibTeX:
@article{4798308,
author = {Bandara, Arosha K. and Lupu, Emil C. and Russo, Alessandra and Dulay, Naranker and Sloman, Morris and Flegkas, Paris and Charalambides, Marinos and Pavlou, George},
title = {Policy refinement for IP differentiated services Quality of Service management},
journal = {Network and Service Management, IEEE Transactions on},
year = {2006},
volume = {3},
number = {2},
pages = {2 -13},
doi = {http://dx.doi.org/10.1109/TNSM.2006.4798308}
}
|
||||||
| Bannazadeh, H. and Leon-Garcia, A. | A Distributed Probabilistic Commitment Control Algorithm for Service-Oriented Systems | 2010 | Network and Service Management, IEEE Transactions on Vol. 7(4), pp. 204 -217 |
admission control , finite capacity queuing networks , qos guarantee , queuing networks , service-oriented architecture | distributed algorithms , quality of service , queueing theory , service-oriented architecture | DOI |
| Abstract: Application creation through service composition is a cornerstone for several architectures including Service-Oriented Architecture. As the number and diversity of applications created based on this paradigm increase, the need for guaranteeing quality of service becomes more important. In this paper, we present a distributed algorithm for guaranteeing a specified level of application completion probability. The algorithm is designed to control service commitments in both queue-less and queue-enabled service-oriented systems. The algorithm does not assume a specific distribution type for service execution times and application request inter-arrival times, and hence is suitable for systems with stationary or non-stationary request arrivals. We show that the proposed distributed algorithm achieves its performance objectives for both queue-less and queue-enabled service oriented systems. | ||||||
BibTeX:
@article{5668977,
author = {Bannazadeh, H. and Leon-Garcia, A.},
title = {A Distributed Probabilistic Commitment Control Algorithm for Service-Oriented Systems},
journal = {Network and Service Management, IEEE Transactions on},
year = {2010},
volume = {7},
number = {4},
pages = {204 -217},
doi = {http://dx.doi.org/10.1109/TNSM.2010.1012.I9P0338}
}
|
||||||
| Bao, F. and Chen, I. and Chang, M. and Cho, J. | Hierarchical Trust Management for Wireless Sensor Networks and its Applications to Trust-Based Routing and Intrusion Detection | 2012 | Network and Service Management, IEEE Transactions on Vol. 9(Early Access) |
trust management , intrusion detection , performance analysis , routing , security , wireless sensor networks | DOI | |
| Abstract: We propose a highly scalable cluster-based hierarchical trust management protocol for wireless sensor networks (WSNs) to effectively deal with selfish or malicious nodes. Unlike prior work, we consider multidimensional trust attributes derived from communication and social networks to evaluate the overall trust of a sensor node. By means of a novel probability model, we describe a heterogeneous WSN comprising a large number of sensor nodes with vastly different social and quality of service (QoS) behaviors with the objective to yield quotedblleft ground truthquotedblright node status. This serves as a basis for validating our protocol design by comparing subjective trust generated as a result of protocol execution at runtime against objective trust obtained from actual node status. To demonstrate the utility of our hierarchical trust management protocol, we apply it to trust-based geographic routing and trust-based intrusion detection. For each application, we identify the best trust composition and formation to maximize application performance. Our results indicate that trust-based geographic routing approaches the ideal performance level achievable by flooding-based routing in message delivery ratio and message delay without incurring substantial message overhead. For trust-based intrusion detection, we discover that there exists an optimal trust threshold for minimizing false positives and false negatives. Furthermore, trust-based intrusion detection outperforms traditional anomaly-based intrusion detection approaches in both the detection probability and the false positive probability. | ||||||
BibTeX:
@article{6174485,
author = {Bao, F. and Chen, I. and Chang, M. and Cho, J.},
title = {Hierarchical Trust Management for Wireless Sensor Networks and its Applications to Trust-Based Routing and Intrusion Detection},
journal = {Network and Service Management, IEEE Transactions on},
year = {2012},
volume = {9},
number = {Early Access},
doi = {http://dx.doi.org/10.1109/TCOMM.2012.031912.110179}
}
|
||||||
| Bartolini, C. and Stefanelli, C. and Tortonesi, M. | SYMIAN: Analysis and performance improvement of the IT incident management process | 2010 | Network and Service Management, IEEE Transactions on Vol. 7(3), pp. 132 -144 |
business-driven it management (bdim) , it service management, incident management , decision support, information technology infrastructure library (itil) | decision support systems , information management , organisational aspects | DOI |
| Abstract: Incident Management is the process through which IT support organizations manage to restore normal service operation after a service disruption. The complexity of real-life enterprise-class IT support organizations makes it extremely hard to understand the impact of organizational, structural and behavioral components on the performance of the currently adopted incident management strategy and, consequently, which actions could improve it. This paper presents SYMIAN, a decision support tool for the performance improvement of the incident management function in IT support organizations. SYMIAN simulates the effect of corrective measures before their actual implementation, enabling time, effort, and cost saving. To this end, SYMIAN models the IT support organization as an open queuing network, thereby enabling the evaluation of both the system-wide dynamics as well as the behavior of the individual organization components and their interactions. Experimental results show the SYMIAN effectiveness in the performance analysis and tuning of the incident management process for real-life IT support organizations. | ||||||
BibTeX:
@article{5560569,
author = {Bartolini, C. and Stefanelli, C. and Tortonesi, M.},
title = {SYMIAN: Analysis and performance improvement of the IT incident management process},
journal = {Network and Service Management, IEEE Transactions on},
year = {2010},
volume = {7},
number = {3},
pages = {132 -144},
doi = {http://dx.doi.org/10.1109/TNSM.2010.1009.I9P0321}
}
|
||||||
| Batista, Daniel M. and da Fonseca, Nelson L. S. | Scheduling Grid Tasks in Face of Uncertain Communication Demands | 2011 | Network and Service Management, IEEE Transactions on Vol. 8(2), pp. 92 -103 |
grid networks , resource management , task scheduling , uncertainty | fuzzy set theory , grid computing , optimisation , quality of service , scheduling | DOI |
| Abstract: Grid scheduling is essential to Quality of Service provisioning as well as to efficient management of grid resources. Grid scheduling usually considers the state of the grid resources as well application demands. However, such demands are generally unknown for highly demanding applications, since these often generate data which will be transferred during their execution. Without appropriate assessment of these demands, scheduling decisions can lead to poor performance. Thus, it is of paramount importance to consider uncertainties in the formulation of a grid scheduling problem. This paper introduces the IPDT-FUZZY scheduler, a scheduler which considers the demands of grid applications with such uncertainties. The scheduler uses fuzzy optimization, and both computational and communication demands are expressed as fuzzy numbers. Its performance was evaluated, and it was shown to be attractive when communication requirements are uncertain. Its efficacy is compared, via simulation, to that of a deterministic counterpart scheduler and the results reinforce its adequacy for dealing with the lack of accuracy in the estimation of communication demands. | ||||||
BibTeX:
@article{5871351,
author = {Batista, Daniel M. and da Fonseca, Nelson L. S.},
title = {Scheduling Grid Tasks in Face of Uncertain Communication Demands},
journal = {Network and Service Management, IEEE Transactions on},
year = {2011},
volume = {8},
number = {2},
pages = {92 -103},
doi = {http://dx.doi.org/10.1109/TNSM.2011.050311.100060}
}
|
||||||
| Battisha, M. and Elmaghraby, A. and Meleis, H. and Samineni, S. | Adaptive tracking of network behavioral signals for real time forensic analysis of service quality degradation | 2008 | Network and Service Management, IEEE Transactions on Vol. 5(2), pp. 105 -117 |
adaptive control , adaptive systems , computer crime , degradation , forensics , jitter , programmable control , quality management , signal analysis , web and internet services | ip networks , adaptive signal detection , computer crime , moving average processes , quality of service , telecommunication security | DOI |
| Abstract: The current shift from the static access based service model to the dynamic application based service model introduced major challenges for effective forensics of any quality degradation of the provided service. In addition, about 55 percent of the Tier 1 and Tier 2 providers are planning to offer managed security services to guarantee an attack free IP service. In this article, we propose a novel approach of modeling the network behavior in order to select meaningful metrics to be used in tracking the network behavior changes. Based on the deftly selected metrics, we utilize an adaptive exponentially weighted moving average (EWMA) with a moving centerline control chart to monitor the changes of the network behavior. Signaling the network behavior changes in association with the service objective based network behavioral model should provide the required information for effective forensic of the service quality degradation. Our methodology is applied on both simulated and real traces of network behavioral metrics. We illustrate the effectiveness of the forensic analysis model for the selection of relevant behavioral metrics. As well, we show how the adaptive EWMA can be used for tracking the changes in the network behavior from normal to abnormal and vice versa. | ||||||
BibTeX:
@article{4694135,
author = {Battisha, M. and Elmaghraby, A. and Meleis, H. and Samineni, S.},
title = {Adaptive tracking of network behavioral signals for real time forensic analysis of service quality degradation},
journal = {Network and Service Management, IEEE Transactions on},
year = {2008},
volume = {5},
number = {2},
pages = {105 -117},
doi = {http://dx.doi.org/10.1109/TNSM.2008.021104}
}
|
||||||
| Begnum, Kyrre and Burgess, Mark and Jonassen, Tore M. and Fagernes, Siri | On the stability of adaptive Service Level Agreements | 2006 | Network and Service Management, IEEE Transactions on Vol. 3(1), pp. 13 -21 |
service level agreements , adaptive policy , dynamical systems , feedback | DOI | |
| Abstract: We consider some implications of non-linear feedback, due to policy combinatorics, on policy-based management of networked services. We pay special attention to the case where the monitoring of certain aspects of Service Level Agreements is used to alter future policy dynamically, according to a control feedback scheme. Using two simple models, we show that nonlinear policies are generally unstable to service provision, i.e. provide no reliable service levels (QoS). Hence we conclude that automated control by policy-rule combinatorics can damage quality of service goals. | ||||||
BibTeX:
@article{4798303,
author = {Begnum, Kyrre and Burgess, Mark and Jonassen, Tore M. and Fagernes, Siri},
title = {On the stability of adaptive Service Level Agreements},
journal = {Network and Service Management, IEEE Transactions on},
year = {2006},
volume = {3},
number = {1},
pages = {13 -21},
doi = {http://dx.doi.org/10.1109/TNSM.2006.4798303}
}
|
||||||
| Bellavista, P. and Cinque, M. and Cotroneo, D. and Foschini, L. | Self-adaptive handoff management for mobile streaming continuity | 2009 | Network and Service Management, IEEE Transactions on Vol. 6(2), pp. 80 -94 |
resource management, handoff management, quality of service, wireless networks, multimedia streaming | internet , media streaming , mobile computing , mobility management (mobile radio) , quality of service , radio access networks | DOI |
| Abstract: Self-adaptive management and quality adaptation of multimedia services are open challenges in the heterogeneous wireless Internet, where different wireless access points potentially enable anywhere anytime Internet connectivity. One of the most challenging issues is to guarantee streaming continuity with maximum quality, despite possible handoffs at multimedia provisioning time. To enable handoff management to self-adapt to specific application requirements with minimum resource consumption, this paper offers three main contributions. First, it proposes a simple way to specify handoff-related service-level objectives that are focused on quality metrics and tolerable delay. Second, it presents how to automatically derive from these objectives a set of parameters to guide system-level configuration about handoff strategies and dynamic buffer tuning. Third, it describes the design and implementation of a novel handoff management infrastructure for maximizing streaming quality while minimizing resource consumption. Our infrastructure exploits i) experimentally evaluated tuning diagrams for resource management and ii) handoff prediction/awareness. The reported results show the effectiveness of our approach, which permits to achieve the desired quality-delay tradeoff in common Internet deployment environments, even in presence of vertical handoffs. | ||||||
BibTeX:
@article{5374829,
author = {Bellavista, P. and Cinque, M. and Cotroneo, D. and Foschini, L.},
title = {Self-adaptive handoff management for mobile streaming continuity},
journal = {Network and Service Management, IEEE Transactions on},
year = {2009},
volume = {6},
number = {2},
pages = {80 -94},
doi = {http://dx.doi.org/10.1109/TNSM.2009.090602}
}
|
||||||
| Bellavista, P. and Corradi, A. and Giannelli, C. | Differentiated Management Strategies for Multi-Hop Multi-Path Heterogeneous Connectivity in Mobile Environments | 2011 | Network and Service Management, IEEE Transactions on Vol. 8(3), pp. 190 -204 |
wireless computing , connectivity management , context awareness , cooperative networking , network management middleware | internet , middleware , mobile computing , mobility management (mobile radio) | DOI |
| Abstract: The widespread availability of mobile devices with multiple wireless interfaces, such as UMTS/GPRS, IEEE 802.11a/b/g and Bluetooth, is pushing for the support of multi-homing and multi-channel connectivity, also enabled by multi-hop cooperative paths to the Internet. The goal is to transparently allow the synergic exploitation of "best" connectivity opportunities available at runtime, by enabling cooperative connectivity, extended wireless coverage, and effective load balancing (for both energy and bandwidth consumption). To this purpose, we claim the need for innovative, lightweight, and proactive evaluation metrics for connectivity management by exploiting application-level awareness of expected node mobility, path throughput, and energy availability. To demonstrate the effectiveness of these solution guidelines for Multi-hop Multi-path Heterogeneous Connectivity (MMHC), we have designed, implemented, and thoroughly evaluated our evaluation metrics on top of the MMHC middleware, which are original because they i) enable the management of multiple multi-hop paths, also made up by heterogeneous wireless links, ii) support connectivity management decisions depending on dynamically gathered context indicators, and iii) can proactively trigger management operations with limited overhead. The extensive set of reported results, from both simulations and real testbed, provides a useful guide for the full understanding of how, to what extent, and which context-based evaluation metrics can enable effective MMHC management in differentiated application/deployment scenarios. | ||||||
BibTeX:
@article{6009141,
author = {Bellavista, P. and Corradi, A. and Giannelli, C.},
title = {Differentiated Management Strategies for Multi-Hop Multi-Path Heterogeneous Connectivity in Mobile Environments},
journal = {Network and Service Management, IEEE Transactions on},
year = {2011},
volume = {8},
number = {3},
pages = {190 -204},
doi = {http://dx.doi.org/10.1109/TCOMM.2011.072611.100066}
}
|
||||||
| Bera, P. and Ghosh, S.K. and Dasgupta, P. | Policy Based Security Analysis in Enterprise Networks: A Formal Approach | 2010 | Network and Service Management, IEEE Transactions on Vol. 7(4), pp. 231 -243 |
network security , sat based verification , access control policies (acl) | authorisation , business data processing , computability , computer network security , formal verification , network routing | DOI |
| Abstract: In a typical enterprise network, there are several sub-networks or network zones corresponding to different departments or sections of the organization. These zones are interconnected through set of Layer-3 network devices (or routers). The service accesses within the zones and also with the external network (e.g., Internet) are usually governed by a enterprise-wide security policy. This policy is implemented through appropriate set of access control lists (ACL rules) distributed across various network interfaces of the enterprise network. Such networks faces two major security challenges, (i) conflict free representation of the security policy, and (ii) correct implementation of the policy through distributed ACL rules. This work presents a formal verification framework to analyze the security implementations in an enterprise network with respect to the organizational security policy. It generates conflict-free policy model from the enterprise-wide security policy and then formally verifies the distributed ACL implementations with respect to the conflict-free policy model. The complexity in the verification process arises from extensive use of temporal service access rules and presence of hidden service access paths in the networks. The proposed framework incorporates formal modeling of conflict-free policy specification and distributed ACL implementation in the network and finally deploys Boolean satisfiability (SAT) based verification procedure to check the conformation between the policy and implementation models. | ||||||
BibTeX:
@article{5668979,
author = {Bera, P. and Ghosh, S.K. and Dasgupta, P.},
title = {Policy Based Security Analysis in Enterprise Networks: A Formal Approach},
journal = {Network and Service Management, IEEE Transactions on},
year = {2010},
volume = {7},
number = {4},
pages = {231 -243},
doi = {http://dx.doi.org/10.1109/TNSM.2010.1012.0365}
}
|
||||||
| Breitgand, David and Goldstein, Maayan and Shehory, Ealan HenisaOnn | Efficient Control of False Negative and False Positive Errors with Separate Adaptive Thresholds | 2011 | Network and Service Management, IEEE Transactions on Vol. 8(2), pp. 128 -140 |
system performance , adaptive algorithm , adaptive control , performance analysis | adaptive control , error statistics , performance evaluation , systems analysis | DOI |
| Abstract: Component level performance thresholds are widely used as a basic means for performance management. As the complexity of managed applications increases, manual threshold maintenance becomes a difficult task. Complexity arises from having a large number of application components and their operational metrics, dynamically changing workloads, and compound relationships between application components. To alleviate this problem, we advocate that component level thresholds should be computed, managed and optimized automatically and autonomously. To this end, we have designed and implemented a performance threshold management application that automatically and dynamically computes two separate component level thresholds: one for controlling Type I errors and another for controlling Type II errors. Our solution additionally facilitates metric selection thus minimizing management overheads. We present the theoretical foundation for this autonomic threshold management application, describe a specific algorithm and its implementation, and evaluate it using real-life scenarios and production data sets. As our present study shows, with proper parameter tuning, our on-line dynamic solution is capable of nearly optimal performance thresholds calculation. | ||||||
BibTeX:
@article{5708247,
author = {Breitgand, David and Goldstein, Maayan and Shehory, Ealan HenisaOnn},
title = {Efficient Control of False Negative and False Positive Errors with Separate Adaptive Thresholds},
journal = {Network and Service Management, IEEE Transactions on},
year = {2011},
volume = {8},
number = {2},
pages = {128 -140},
doi = {http://dx.doi.org/10.1109/TNSM.2011.020111.00055}
}
|
||||||
| Brunner, Marcu and Nunzi, Giorgio and Dietz, Thomas and Kazuhiko, Isoyama | Customer-oriented GMPLS service management and resilience differentiation | 2004 | Network and Service Management, IEEE Transactions on Vol. 1(2), pp. 92 -102 |
internet , marketing and sales , multiprotocol label switching , packet switching , resilience , routing , sonet , service oriented architecture , standardization , wavelength division multiplexing | DOI | |
| Abstract: Generalized Multi-Protocol Label Switching (GMPLS) is currently under standardization at the Internet Engineering Task Force (IETF). It basically reuses the MPLS control plane (IP routing and signaling) for various technologies such as fiber switching, DWDM, SONET, and packet MPLS. In this article, we propose a management architecture, which allows a service provider to offer customers various services based on a GMPLS infrastructure. The business model behind the architecture is comparable to the online flight ticket sales systems known. | ||||||
BibTeX:
@article{4798294,
author = {Brunner, Marcu and Nunzi, Giorgio and Dietz, Thomas and Kazuhiko, Isoyama},
title = {Customer-oriented GMPLS service management and resilience differentiation},
journal = {Network and Service Management, IEEE Transactions on},
year = {2004},
volume = {1},
number = {2},
pages = {92 -102},
doi = {http://dx.doi.org/10.1109/TNSM.2004.4798294}
}
|
||||||
| Burgess, M. and Canright, G. | Scalability of Peer Configuration Management in Logically Ad Hoc Networks | 2004 | Network and Service Management, IEEE Transactions on Vol. 1(1), pp. 21 -29 |
ad hoc networks , communication channels , databases , mobile computing , open systems , peer to peer computing , protocols , scalability , technology management , telecommunication network management | DOI | |
| Abstract: Current interest in ad hoc and peer-to-peer networking technologies prompts a re-examination of models for configuration management within these frameworks. In the future, network management methods may have to scale to millions of nodes within a single organization, with complex social constraints. In this paper, we discuss whether it is possible to manage the configuration of large numbers of network devices using well known and not so well known configuration models, and we discuss how the special characteristics of ad hoc and peer-to-peer networks are reflected in this problem. | ||||||
BibTeX:
@article{4623691,
author = {Burgess, M. and Canright, G.},
title = {Scalability of Peer Configuration Management in Logically Ad Hoc Networks},
journal = {Network and Service Management, IEEE Transactions on},
year = {2004},
volume = {1},
number = {1},
pages = {21 -29},
doi = {http://dx.doi.org/10.1109/TNSM.2004.4623691}
}
|
||||||
| Burst, Ken and Joiner, Laurie and Grimes, Gary | Delay Based Congestion Detection and Admission Control for Voice quality in enterprise or carrier controlled IP Networks | 2005 | Network and Service Management, IEEE Transactions on Vol. 2(1), pp. 1 -8 |
admission control , delay , diffserv networks , ip networks , internet telephony , multiprotocol label switching , probes , protocols , quality of service , waste materials | DOI | |
| Abstract: Reservations based admission control, using Multi-protocol Label Switching (MPLS) is the leading method being considered by traditional carriers for maintaining Quality of Service (QoS) when deploying Voice over Internet Protocol (VoIP). In this research we explore an alternative to reservations based admission control called Delay Based Congestion Detection and Admission Control (DBCD/AC), a form of Endpoint Admission Control. DBCD/AC is a method for edge devices, such as media gateways, to detect impending congestion in the core based on delay measurements and analysis. When impending congestion is detected, the edge devices refuse new incoming connections to the media gateways to mitigate the congestion. This research examines the characteristics of DBCD/AC and finds that DBCD/AC is a promising alternative to a reservations based admission control approach for enterprise or carrier controlled IP Networks. | ||||||
BibTeX:
@article{4798296,
author = {Burst, Ken and Joiner, Laurie and Grimes, Gary},
title = {Delay Based Congestion Detection and Admission Control for Voice quality in enterprise or carrier controlled IP Networks},
journal = {Network and Service Management, IEEE Transactions on},
year = {2005},
volume = {2},
number = {1},
pages = {1 -8},
doi = {http://dx.doi.org/10.1109/TNSM.2005.4798296}
}
|
||||||
| Capone, A. and Elias, J. and Martignon, F. | Models and Algorithms for the Design of Service Overlay Networks | 2008 | Network and Service Management, IEEE Transactions on Vol. 5(3), pp. 143 -156 |
service deployment, network planning, overlay networks, service-level agreements, optimization, heuristics | internet , quality of service , telecommunication network planning | DOI |
| Abstract: Service overlay networks (SONs) can provide end-to-end quality of service guarantees in the Internet without requiring significant changes to the underlying network infrastructure. A SON is an application-layer network operated by a third-party Internet service provider (ISP) that owns a set of overlay nodes, residing in the underlying ISP domains, interconnected by overlay links. The deployment of a SON can be a capital-intensive investment, and hence its planning requires careful decisions, including the overlay nodes' placement, the capacity provisioning of overlay links as well as of access links that connect the end-users to the SON infrastructure. In this paper, we propose two novel optimization models for the planning of SONs. The first model minimizes the SON installation cost while providing full coverage to all network's users. The second model maximizes the SON operator's profit by further choosing which users to serve, based on the expected gain, and taking into consideration budget constraints. We also introduce two efficient heuristics to get near-optimal solutions for largescale instances in a reasonable computation time. We provide numerical results of the proposed models and heuristics on a set of realistic-size instances, and discuss the effect of different parameters on the characteristics of the planned networks. We show that in the considered network scenarios the proposed heuristics perform close to the optimum with a short computing time. | ||||||
BibTeX:
@article{4805131,
author = {Capone, A. and Elias, J. and Martignon, F.},
title = {Models and Algorithms for the Design of Service Overlay Networks},
journal = {Network and Service Management, IEEE Transactions on},
year = {2008},
volume = {5},
number = {3},
pages = {143 -156},
doi = {http://dx.doi.org/10.1109/TNSM.2009.031102}
}
|
||||||
| Chia-Wei Chang and Seungjoon Lee and Lin, B. and Jia Wang | The taming of the shrew: mitigating low-rate TCP-targeted attack | 2010 | Network and Service Management, IEEE Transactions on Vol. 7(1), pp. 1 -13 |
shrew attack, differential tagging, fair drop rate | telecommunication network routing , telecommunication security , transport protocols | DOI |
| Abstract: A Shrew attack, which uses a low-rate burst carefully designed to exploit TCP's retransmission timeout mechanism, can throttle the bandwidth of a TCP flow in a stealthy manner. While such an attack can significantly degrade the performance of all TCP-based protocols and services including Internet routing (e.g., BGP), no existing scheme clearly solves the problem in real network scenarios. In this paper, we propose a simple protection mechanism, called SAP (Shrew Attack Protection), for defending against a Shrew attack. Rather than attempting to track and isolate Shrew attackers, SAP identifies TCP victims by monitoring their drop rates and preferentially admits those packets from the victims with high drop rates to the output queue. This is to ensure that well-behaved TCP sessions can retain their bandwidth shares. Our simulation results indicate that under a Shrew attack, SAP can prevent TCP sessions from closing, and effectively enable TCP flows to maintain high throughput. SAP is a destination-port-based mechanism and requires only a small number of counters to find potential victims, which makes SAP readily implementable on top of existing router mechanisms. | ||||||
BibTeX:
@article{5412869,
author = {Chia-Wei Chang and Seungjoon Lee and Lin, B. and Jia Wang},
title = {The taming of the shrew: mitigating low-rate TCP-targeted attack},
journal = {Network and Service Management, IEEE Transactions on},
year = {2010},
volume = {7},
number = {1},
pages = {1 -13},
doi = {http://dx.doi.org/10.1109/TNSM.2010.I8P0308}
}
|
||||||
| Charalambides, M. and Flegkas, P. and Pavlou, G. and Rubio-Loyola, J. and Bandara, A.K. and Lupu, E.C. and Russo, A. and Dulay, N. and Sloman, M. | Policy conflict analysis for diffserv quality of service management | 2009 | Network and Service Management, IEEE Transactions on Vol. 6(1), pp. 15 -30 |
qos management policies, conflict detection, dynamic conflict resolution. | diffserv networks , bandwidth allocation , computer network management , formal specification , process algebra , program diagnostics , quality of service , reasoning about programs , telecommunication computing , telecommunication congestion control , telecommunication traffic | DOI |
| Abstract: Policy-based management provides the ability to (re-)configure differentiated services networks so that desired Quality of Service (QoS) goals are achieved. This requires implementing network provisioning decisions, performing admission control, and adapting bandwidth allocation to emerging traffic demands. A policy-based approach facilitates flexibility and adaptability as policies can be dynamically changed without modifying the underlying implementation. However, inconsistencies may arise in the policy specification. In this paper we provide a comprehensive set of QoS policies for managing Differentiated Services (DiffServ) networks, and classify the possible conflicts that can arise between them. We demonstrate the use of Event Calculus and formal reasoning for the analysis of both static and dynamic conflicts in a semi-automated fashion. In addition, we present a conflict analysis tool that provides network administrators with a user-friendly environment for determining and resolving potential inconsistencies. The tool has been extensively tested with large numbers of policies over a range of conflict types. | ||||||
BibTeX:
@article{5331278,
author = {Charalambides, M. and Flegkas, P. and Pavlou, G. and Rubio-Loyola, J. and Bandara, A.K. and Lupu, E.C. and Russo, A. and Dulay, N. and Sloman, M.},
title = {Policy conflict analysis for diffserv quality of service management},
journal = {Network and Service Management, IEEE Transactions on},
year = {2009},
volume = {6},
number = {1},
pages = {15 -30},
doi = {http://dx.doi.org/10.1109/TNSM.2009.090302}
}
|
||||||
| Ming Chen and Xiaorui Wang and Taylor, B. | Achieving Bounded Matching Delay and Maximized Throughput in Information Dissemination Management | 2011 | Network and Service Management, IEEE Transactions on Vol. 8(1), pp. 26 -38 |
feedback control real-time scheduling , distributed model predictive control , distributed systems , end-to-end task , quality of service , real-time and embedded systems | information dissemination , information management , information systems , optimal control , predictive control | DOI |
| Abstract: The demand for high performance information dissemination is increasing in many applications, such as e-commerce and security alerting systems. These applications usually require that the desired information be matched between numerous sources and sinks based on established subscriptions in a timely manner while a maximized system throughput be achieved to find more matched results. Existing work primarily focuses on only one of the two requirements, either timeliness or throughput. This can lead to an unnecessarily underutilized system or poor guarantees on matching delays. In this paper, we propose an integrated solution that controls both the matching delay and CPU utilization in information dissemination systems to achieve bounded matching delay for high-priority information and maximized system throughput in an example information dissemination system. In addition, we design an admission control scheme to meet the timeliness requirements for selected low-priority information. Our solution is based on optimal control theory for guaranteed control accuracy and system stability. Empirical results on a hardware testbed demonstrate that our controllers can meet the timeliness requirements while achieving maximized system throughput. | ||||||
BibTeX:
@article{5702355,
author = {Ming Chen and Xiaorui Wang and Taylor, B.},
title = {Achieving Bounded Matching Delay and Maximized Throughput in Information Dissemination Management},
journal = {Network and Service Management, IEEE Transactions on},
year = {2011},
volume = {8},
number = {1},
pages = {26 -38},
doi = {http://dx.doi.org/10.1109/TNSM.2011.012111.00004}
}
|
||||||
| Chen, Yang and Wang, Xiao and Shi, Cong and Lua, Eng Keong and Fu, Xiaoming and Deng, Beixing and Li, Xing | Phoenix: A Weight-Based Network Coordinate System Using Matrix Factorization | 2011 | Network and Service Management, IEEE Transactions on Vol. 8(4), pp. 334 -347 |
internet topology , peer to peer computing , network coordinate system , network monitoring , triangle inequality violation | DOI | |
| Abstract: Network coordinate (NC) systems provide a lightweight and scalable way for predicting the distances, i.e., round-trip latencies among Internet hosts. Most existing NC systems embed hosts into a low dimensional Euclidean space. Unfortunately, the persistent occurrence of Triangle Inequality Violation (TIV) on the Internet largely limits the distance prediction accuracy of those NC systems. Some alternative systems aim at handling the persistent TIV, however, they only achieve comparable prediction accuracy with Euclidean distance based NC systems. In this paper, we propose an NC system, so-called Phoenix, which is based on the matrix factorization model. Phoenix introduces a weight to each reference NC and trusts the NCs with higher weight values more than the others. The weight-based mechanism can substantially reduce the impact of the error propagation. Using the representative aggregate data sets and the newly measured dynamic data set collected from the Internet, our simulations show that Phoenix achieves significantly higher prediction accuracy than other NC systems. We also show that Phoenix quickly converges to steady state, performs well under host churn, handles the drift of the NCs successfully by using regularization, and is robust against measurement anomalies. Phoenix achieves a scalable yet accurate end-to-end distances monitoring. In addition, we study how well an NC system can characterize the TIV property on the Internet by introducing two new quantitative metrics, so-called RE_RPL and AE_RPL. We show that Phoenix is able to characterize TIV better than other existing NC systems. | ||||||
BibTeX:
@article{6092405,
author = {Chen, Yang and Wang, Xiao and Shi, Cong and Lua, Eng Keong and Fu, Xiaoming and Deng, Beixing and Li, Xing},
title = {Phoenix: A Weight-Based Network Coordinate System Using Matrix Factorization},
journal = {Network and Service Management, IEEE Transactions on},
year = {2011},
volume = {8},
number = {4},
pages = {334 -347},
doi = {http://dx.doi.org/10.1109/TNSM.2011.110911.100079}
}
|
||||||
| Chieng, David and Marshall, Alan and Parr, Gerard | SLA brokering and bandwidth reservation negotiation schemes for QoS-aware internet | 2005 | Network and Service Management, IEEE Transactions on Vol. 2(1), pp. 39 -49 |
availability , bandwidth , channel allocation , diffserv networks , engineering management , ip networks , prototypes , quality of service , telecommunication traffic , web and internet services | DOI | |
| Abstract: We present a novel Service Level Agreement (SLA)-driven service provisioning architecture, which enables dynamic and flexible bandwidth reservation schemes on a per-user or per-application basis. Various session level SLA negotiation schemes involving bandwidth allocation, service start time and service duration parameters are introduced and analyzed. The results show that these negotiation schemes can be utilized for the benefit of both end users and network providers in achieving the highest individual SLA optimization in terms of key Quality of Service (QoS) metrics and price. The inherent characteristics of software agents such as autonomy, adaptability and social abilities offer many advantages in this dynamic, complex, and distributed network environment especially when performing Service Level Agreements (SLA) definition negotiations and brokering tasks. This article also presents a service broker prototype based on Fujitsu's Phoenix Open Agent Mediator (OAM) agent technology, which was used to demonstrate a range of SLA brokering scenarios. | ||||||
BibTeX:
@article{4798300,
author = {Chieng, David and Marshall, Alan and Parr, Gerard},
title = {SLA brokering and bandwidth reservation negotiation schemes for QoS-aware internet},
journal = {Network and Service Management, IEEE Transactions on},
year = {2005},
volume = {2},
number = {1},
pages = {39 -49},
doi = {http://dx.doi.org/10.1109/TNSM.2005.4798300}
}
|
||||||
| Cianfrani, A. and Eramo, V. and Listanti, M. and Polverini, M. and Vasilakos, A. | An OSPF-Integrated Routing Strategy for QoS-Aware Energy Saving in IP Backbone Networks | 2012 | Network and Service Management, IEEE Transactions on Vol. 9(Early Access) |
energy efficient networks , ip routing , performance evaluation | DOI | |
| Abstract: This paper deals with an energy saving routing solution, called Energy Saving IP Routing (ESIR), to be applied in an IP network. ESIR operation is integrated with Open Shorthest Path First (OSPF) protocol and allows the selection of the links to be switched off so that the negative effects of the IP topology reconfiguration procedures are avoided. The basic mechanisms which ESIR is based on are the concepts of SPT exportation and move. These mechanisms allow to share a Shortest Path Tree (SPT) between neighbor routers, so that the overall set of active network links can be reduced. Properties of moves are defined and the energy saving problem in an IP network is formulated as the problem of finding the Maximum Set of Compatible Moves (MSCM). The MSCM problem is investigated in two steps: firstly, a relaxed version of the problem, named basic MSCM problem, is considered in which QoS requirements are neglected; in the second step, the solution of the full problem, named QoS-aware MSCM problem, is faced. We prove that the basic MSCM problem can be formulated as the well-known Maximum Clique Problem in a graph; instead the QoS-aware MSCM introduces a condition equivalent to the Knapsack problem. ILP formulations to solve both the problems are given and heuristics to solve them in practical cases are proposed. The performance evaluation shows that in a real ISP network scenario ESIR is able to switch off up to 30% of network links by exploiting over-provisioning adopted by operators in the network resource planning phase and typical daily traffic trend. | ||||||
BibTeX:
@article{6172595,
author = {Cianfrani, A. and Eramo, V. and Listanti, M. and Polverini, M. and Vasilakos, A.},
title = {An OSPF-Integrated Routing Strategy for QoS-Aware Energy Saving in IP Backbone Networks},
journal = {Network and Service Management, IEEE Transactions on},
year = {2012},
volume = {9},
number = {Early Access},
doi = {http://dx.doi.org/10.1109/TNSM.2012.031512.110165}
}
|
||||||
| Cicic, T. and Hansen, A.F. and Kvalbein, A. and Hartmann, M. and Martin, R. and Menth, M. and Gjessing, S. and Lysne, O. | Relaxed multiple routing configurations: IP fast reroute for single and correlated failures | 2009 | Network and Service Management, IEEE Transactions on Vol. 6(1), pp. 1 -14 |
ip fast reroute, multi-topology routing, network protection, network utilization, correlated failures, shared risk groups. | ip networks , computer network management , fault tolerance , telecommunication network reliability , telecommunication network routing , telecommunication network topology , telecommunication traffic | DOI |
| Abstract: Multi-topology routing is an increasingly popular IP network management concept that allows transport of different traffic types over disjoint network paths. The concept is of particular interest for implementation of IP fast reroute (IP FRR). The authors have previously proposed an IP FRR scheme based on multi-topology routing called multiple routing configurations (MRC). MRC supports guaranteed, instantaneous recovery from any single link or node failure in biconnected networks as well as from many combined failures, provided sufficient bandwidth on the surviving links. Furthermore, in MRC different failures result in routing over different network topologies, which gives a good control of the traffic distribution in the networks after a failure. In this paper we present two contributions. First we define an enhanced IP FRR scheme which we call "relaxed MRC" (rMRC). Through experiments we demonstrate that rMRC is an improvement over MRC in all important aspects. Resource utilization in the presence of failures is significantly better, both in terms of paths lengths and in terms of load distribution between the links. The requirement to internal state in the routers is reduced as rMRC requires fewer backup topologies to provide the same degree of protection. In addition to this, the preprocessing needed to generate the backup topologies is simplified. The second contribution is an extension of rMRC that can provide fast reroute in the presence of multiple correlated failures. Our evaluations demonstrate only a small penalty in path lengths and in the number of backup topologies required. | ||||||
BibTeX:
@article{5331277,
author = {Cicic, T. and Hansen, A.F. and Kvalbein, A. and Hartmann, M. and Martin, R. and Menth, M. and Gjessing, S. and Lysne, O.},
title = {Relaxed multiple routing configurations: IP fast reroute for single and correlated failures},
journal = {Network and Service Management, IEEE Transactions on},
year = {2009},
volume = {6},
number = {1},
pages = {1 -14},
doi = {http://dx.doi.org/10.1109/TNSM.2009.090301}
}
|
||||||
| Cittadini, L. and Rimondini, M. and Vissicchio, S. and Corea, M. and Di Battista, G. | From Theory to Practice: Efficiently Checking BGP Configurations for Guaranteed Convergence | 2011 | Network and Service Management, IEEE Transactions on Vol. 8(4), pp. 387 - 400 |
algorithms , bgp , network management , routing convergence and stability | DOI | |
| Abstract: Internet Service Providers can enforce a fine-grained control of Interdomain Routing by cleverly configuring the Border Gateway Protocol. However, the price to pay for the flexibility of BGP is the lack of convergence guarantees. The literature on network protocol design introduced several sufficient conditions that routing policies should satisfy to guarantee convergence. However, a methodology to systematically check BGP policies for convergence is still missing. This paper presents two fundamental contributions. First, we describe a heuristic algorithm that statically checks BGP configurations for guaranteed routing convergence. Our algorithm has several highly desirable properties: i) it exceeds state-of-the-art algorithms by correctly reporting more configurations as stable, ii) it can be implemented efficiently enough to analyze Internet-scale configurations, iii) it is free from false positives, namely never reports a potentially oscillating configuration as stable, and iv) it can help spot troublesome points in a detected oscillation. Second, we propose an architecture for a modular tool that exploits our algorithm to process native router configurations and report the presence of potential oscillations. Such a tool can effectively integrate syntactic checkers and assist operators in verifying configurations. We validate our approach using a prototype implementation and show that it scales well enough to enable Internet-scale convergence checks. | ||||||
BibTeX:
@article{6070518,
author = {Cittadini, L. and Rimondini, M. and Vissicchio, S. and Corea, M. and Di Battista, G.},
title = {From Theory to Practice: Efficiently Checking BGP Configurations for Guaranteed Convergence},
journal = {Network and Service Management, IEEE Transactions on},
year = {2011},
volume = {8},
number = {4},
pages = {387 - 400},
doi = {http://dx.doi.org/10.1109/TNSM.2011.110311.100109}
}
|
||||||
| Colitti, L. and Di Battista, G. and Patrignani, M. | IPv6-in-IPv4 Tunnel Discovery: Methods and Experimental Results | 2004 | Network and Service Management, IEEE Transactions on Vol. 1(1), pp. 30 -38 |
data security , encapsulation , fets , ip networks , internet , network topology , routing protocols , testing , transport protocols , tunneling | DOI | |
| Abstract: Tunnels are widely used to improve security and to expand networks without having to deploy native infrastructure. They play an important role in the migration to IPv6, which relies on IPv6-in-IPv4 tunnels where native connectivity is not available. However, tunnels offer lower performance and are less than native links. In this paper we introduce a number of techniques to detect, and collect information about, IPv6-in-IPv4 tunnels, and show how a known tunnel can be used as a ¿vantage point¿ to launch third-party tunnel-discovery explorations, scaling up the discovery process. We describe our Tunneltrace tool, which implements the proposed techniques, and validate them by means of a wide experimentation on the 6bone tunneled network, on native networks in Italy, the Netherlands, and Japan, and through the test boxes deployed worldwide by the RIPE NCC as part of the Test Traffic Measurements Service. We assess to what extent 6bone registry information is coherent with the actual network topology, and we provide the first experimental results on the current distribution of IPv6-in-IPv4 tunnels in the Internet, showing that even ¿native¿ networks reach more than 60 percent of all IPv6 prefixes through tunnels. Furthermore, we provide historical data on the migration to native IPv6, showing that the impact of tunnels in the IPv6 Internet did not significantly decrease over a six-month period. Finally, we briefly touch on the security issues posed by IPv6-in-IPv4 tunnels, discussing possible threats and countermeasures. | ||||||
BibTeX:
@article{4623692,
author = {Colitti, L. and Di Battista, G. and Patrignani, M.},
title = {IPv6-in-IPv4 Tunnel Discovery: Methods and Experimental Results},
journal = {Network and Service Management, IEEE Transactions on},
year = {2004},
volume = {1},
number = {1},
pages = {30 -38},
doi = {http://dx.doi.org/10.1109/TNSM.2004.4623692}
}
|
||||||
| Cridlig, V. and State, R. and Festor, O. | Role-Based Access Control for XML enabled multi-protocol management gateways | 2006 | Network and Service Management, IEEE Transactions on Vol. 3(1), pp. 22 -32 |
management gateways , snmp , xml-based management , key management , security | DOI | |
| Abstract: While security is often supported in standard management frameworks, security is of major importance in the management plane. In this paper we address the provisioning of a security #x201C;continuum #x201D; for management frameworks based on multi-protocol gateways. We provide an in depth security extension of such a gateway using the Role Based Access Control paradigm and show how to integrate our approach within a broader XML-based management framework. Two case studies are investigated: while the first one proposes to map an XML-based RBAC policy to SNMP access control model, the second one maps the same policy to CLI security levels. The target objective is to provide consistent access control policies not only locally on each device whatever be the network management framework but also globally through the managed domain. | ||||||
BibTeX:
@article{4798304,
author = {Cridlig, V. and State, R. and Festor, O.},
title = {Role-Based Access Control for XML enabled multi-protocol management gateways},
journal = {Network and Service Management, IEEE Transactions on},
year = {2006},
volume = {3},
number = {1},
pages = {22 -32},
doi = {http://dx.doi.org/10.1109/TNSM.2006.4798304}
}
|
||||||
| Croce, D. and Leonardi, E. and Mellia, M. | Large-Scale Available Bandwidth Measurements: Interference in Current Techniques | 2011 | Network and Service Management, IEEE Transactions on Vol. 8(4), pp. 361 - 374 |
available bandwidth , distributed systems , measurements , mutual interference , scalability | DOI | |
| Abstract: The end-to-end available bandwidth of an Internet path is a desirable information that can be exploited to optimize system performance. Several tools have been proposed in the past to estimate it. However, existing measurement techniques were not designed for large-scale deployments. In this paper we show that current tools do not properly work where multiple probing processes share a portion of a path. We provide experimental evidence to quantify the impact of mutual interference between measurements. We further analyze the characteristics of popular tools, quantifying (i) the impact of mutual interference, (ii) the total overhead imposed to the network and (iii) the intrusiveness of the measurement process in a large-scale scenario. Our goal is to effectively quantify the impact of concurrent measurements on current estimation techniques and to offer some simple guidelines for dimensioning a large-scale measurement system. | ||||||
BibTeX:
@article{6070521,
author = {Croce, D. and Leonardi, E. and Mellia, M.},
title = {Large-Scale Available Bandwidth Measurements: Interference in Current Techniques},
journal = {Network and Service Management, IEEE Transactions on},
year = {2011},
volume = {8},
number = {4},
pages = {361 - 374},
doi = {http://dx.doi.org/10.1109/TNSM.2011.110311.110110}
}
|
||||||
| Dandapat, S. and Mitra, B. and Choudhury, R. and Ganguly, N. | Smart Association Control in Wireless Mobile Environment Using Max-Flow | 2012 | Network and Service Management, IEEE Transactions on Vol. 9(1), pp. 73-86 |
load balancing , association control , fairness , max-flow , wireless internet | DOI | |
| Abstract: WiFi clients must associate to a specific Access Point (AP) to communicate over the Internet. Current association methods are based on maximum Received Signal Strength Index (RSSI) implying that a client associates to the strongest AP around it. This is a simple scheme that has performed well in purely distributed settings. Modern wireless networks, however, are increasingly being connected by a wired backbone. The backbone allows for out-of-band communication among APs, opening up opportunities for improved protocol design. This paper takes advantage of this opportunity through a coordinated client association scheme where APs consider a global view of the network, and decide on the optimal client-AP association. We show that such an association outperforms RSSI based schemes in several scenarios, while remaining practical and scalable for wide-scale deployment. We also show that optimal association is a NP-Hard problem and our max-flow based heuristic is a promising solution. | ||||||
BibTeX:
@article{6094145,
author = {Dandapat, S. and Mitra, B. and Choudhury, R. and Ganguly, N.},
title = {Smart Association Control in Wireless Mobile Environment Using Max-Flow},
journal = {Network and Service Management, IEEE Transactions on},
year = {2012},
volume = {9},
number = {1},
pages = {73-86},
doi = {http://dx.doi.org/10.1109/TNSM.2011.113011.100098}
}
|
||||||
| Deshpande, S. and Thottan, M. and Sikdar, B. | An online scheme for the isolation of BGP misconfiguration errors | 2008 | Network and Service Management, IEEE Transactions on Vol. 5(2), pp. 78 -90 |
bgp , anomaly detection , misconfiguration | bgp , anomaly detection , misconfiguration | DOI |
| Abstract: Being the primary interdomain routing protocol, border gateway protocol (BGP) is the singular means of path establishment across the Internet. Therefore, misconfiguration errors in BGP routers result in failure to establish paths which in turn can cause several networks to become unreachable. In this paper, we first analyze data from recent BGP tables to show that misconfiguration errors occur very frequently in the Internet today. We then show theoretically and using real-world events the impact of these errors on routing stability. A scheme for real-time isolation of large-scale BGP misconfiguration events is then proposed in this paper. Our methodology is based on statistical techniques and is evaluated using data from past wellknown misconfiguration events. We show the effectiveness of our method as compared to the current state-of-the-art. | ||||||
BibTeX:
@article{4694133,
author = {Deshpande, S. and Thottan, M. and Sikdar, B.},
title = {An online scheme for the isolation of BGP misconfiguration errors},
journal = {Network and Service Management, IEEE Transactions on},
year = {2008},
volume = {5},
number = {2},
pages = {78 -90},
doi = {http://dx.doi.org/10.1109/TNSM.2008.021101}
}
|
||||||
| Dharmaraja, S. and Jindal, V. and Varshney, U. | Reliability and Survivability Analysis for UMTS Networks: An Analytical Approach | 2008 | Network and Service Management, IEEE Transactions on Vol. 5(3), pp. 132 -142 |
reliability, survivability, markov chain, reliability block diagram, hierarchical modeling, umts networks | 3g mobile communication , markov processes , cellular radio , fault tolerance , telecommunication network reliability | DOI |
| Abstract: Reliability and survivability are the two important attributes of cellular networks. In the existing literature, these measures were studied through the simulation. In this paper, we construct an analytical model to determine reliability and survivability attributes of third generation and beyond Universal Mobile Telecommunication Systems (UMTS) networks. Hierarchical architecture of UMTS networks is modeled using stochastic models such as Markov chains, semi-Markov process, reliability block diagrams and Markov reward models to obtain these attributes. The model can be tailored to evaluate the reliability and survivability attributes of other beyond third generation cellular networks such as All-IP UMTS networks and CDMA2000. Numerical results illustrate the applicability of the proposed analytical model. It is observed that incorporating fault tolerance increases the network reliability and survivability. The results are useful for reliable topological design of UMTS networks. In addition, it can help the guarantee of network connectivity after any failure, without over dimensioning the networks. Moreover, it might have some impact from the point of view of the design and evaluation of UMTS infrastructures. | ||||||
BibTeX:
@article{4805130,
author = {Dharmaraja, S. and Jindal, V. and Varshney, U.},
title = {Reliability and Survivability Analysis for UMTS Networks: An Analytical Approach},
journal = {Network and Service Management, IEEE Transactions on},
year = {2008},
volume = {5},
number = {3},
pages = {132 -142},
doi = {http://dx.doi.org/10.1109/TNSM.2009.031101}
}
|
||||||
| Diao, Yixin and Eskesen, Frank and Froehlich, Steven and Hellerstein, Joseph L. and Keller, Alexander and Spainhower, Lisa F. and Surendra, Maheswaran | Service level management: A dynamic discovery and optimization approach | 2004 | Network and Service Management, IEEE Transactions on Vol. 1(2), pp. 83 -91 |
dbms instrumentation , online optimization , common information model (cim) , service level management | DOI | |
| Abstract: Optimizing configuration parameters for achieving service level objectives is time-consuming and skills-intensive. This paper proposes a generic approach to automating this task. By generic, we mean that the approach is relatively independent of the target system for which the optimization is done. Our approach uses online adjustment of configuration parameters to discover the system's performance characteristics. Doing so creates two challenges: (1) handling interdependencies between configuration parameters and (2) minimizing the deleterious effects on production workload while the optimization is underway. Our approach addresses (1) by including in the architecture a rule-based component that handles interdependencies between configuration parameters. For (2), we use a feedback mechanism for online optimization that searches the parameter space in a way that generally avoids poor performance at intermediate steps. Our studies of a DB2 Universal Database Server under an e-commerce workload indicate that our approach is effective in practice. | ||||||
BibTeX:
@article{4798293,
author = {Diao, Yixin and Eskesen, Frank and Froehlich, Steven and Hellerstein, Joseph L. and Keller, Alexander and Spainhower, Lisa F. and Surendra, Maheswaran},
title = {Service level management: A dynamic discovery and optimization approach},
journal = {Network and Service Management, IEEE Transactions on},
year = {2004},
volume = {1},
number = {2},
pages = {83 -91},
doi = {http://dx.doi.org/10.1109/TNSM.2004.4798293}
}
|
||||||
| Dimitriou, S. and Tsioliaridou, A. and Tsaoussidis, V. | Introducing size-oriented dropping policies as QoS-supportive functions | 2010 | Network and Service Management, IEEE Transactions on Vol. 7(1), pp. 14 -27 |
active queue management, fairness, service differentiation | internet , bandwidth allocation , data communication , differentiation , probability , quality of service , queueing theory , telecommunication traffic | DOI |
| Abstract: The continuous increase of Internet users worldwide, as well as the extensive need to support real-time traffic and bulk data transfers simultaneously, has directed research towards service differentiation schemes. These schemes either propose techniques that provide users with the necessary quality guarantees or follow a "better-than-best-effort" approach to satisfy broadly the varying needs of different applications. We depart from our new service principle called Less Impact Better Service (LIBS) and propose a novel service differentiation method, namely size-oriented dropping policies, which uses packet size to categorize time-sensitive from delay-tolerant flows and prioritize packet dropping probability, accordingly. Unlike existing proposals, the distinction of flows is dynamic and the notion of packet size is abstract and comparative; a packet size is judged as a unit within a dynamic sample space, that is, current queue occupancy. We evaluate size-oriented dropping policies both analytically and experimentally; we observe a significant increase on the perceived quality of real-time applications. Delaysensitive flows increase their bandwidth share, to reach a state of system fairness, regulating the dominant behavior of bulk-data flows. | ||||||
BibTeX:
@article{5412870,
author = {Dimitriou, S. and Tsioliaridou, A. and Tsaoussidis, V.},
title = {Introducing size-oriented dropping policies as QoS-supportive functions},
journal = {Network and Service Management, IEEE Transactions on},
year = {2010},
volume = {7},
number = {1},
pages = {14 -27},
doi = {http://dx.doi.org/10.1109/TNSM.2010.I9P0313}
}
|
||||||
| Eramo, V. and Listanti, M. and Cianfrani, A. | Design and evaluation of a new multi-path incremental routing algorithm on software routers | 2008 | Network and Service Management, IEEE Transactions on Vol. 5(4), pp. 188 -203 |
dijkstra algorithm, multi-path dynamic shortest path, open source code, quagga routing software, ospf | web services , public domain software , routing protocols | DOI |
| Abstract: In this paper we analyze intra-domain routing protocols improvements to support new features required by realtime services. In particular we introduce OSPF fast convergence and highlight the advantage of using a dynamic algorithm instead of the Dijkstra one to compute the shortest paths. Then we propose a new multi-path dynamic algorithm which uses multipath information to make a fast determination about the new shortest paths when a link failure occurs, reducing this way the network re-convergence time. To evaluate the proposed algorithm performance we have implemented it in the OSPF code of the Quagga open-source routing software. We compare our own algorithm with three different dynamic algorithms, like the one implemented in Cisco routers and the two others, well known in literature, proposed by Narvaez and Ramalingam-Reps. We show how, by exploiting multi-path information, our algorithm performs, in many case studies, better than the above algorithms, especially in a link failure scenario. | ||||||
BibTeX:
@article{5010443,
author = {Eramo, V. and Listanti, M. and Cianfrani, A.},
title = {Design and evaluation of a new multi-path incremental routing algorithm on software routers},
journal = {Network and Service Management, IEEE Transactions on},
year = {2008},
volume = {5},
number = {4},
pages = {188 -203},
doi = {http://dx.doi.org/10.1109/TNSM.2009.041101}
}
|
||||||
| Erjongmanee, S. and Ji, C. | Large-Scale Network-Service Disruption: Dependencies and External Factors | 2011 | Network and Service Management, IEEE Transactions on Vol. 8(4), pp. 375 - 386 |
internet application , heterogeneous databases , human information processing | DOI | |
| Abstract: Large-scale service disruptions in communication have been observed in the past but are not well-understood. The goal of this work is to gain a better understanding of disruptions in communication services in response to large-scale external disturbances such as hurricanes. In particular, Hurricane Ike is drawn as a case study, and heterogeneous data is obtained from networks, storm, and system administrators. Using the data, we first study network-wide disruptions and dependences among different unreachable subnets. Our findings show that 120 out of 230 subnets in our data set were unreachable, among which 88 subnets became unreachable dependently at a time scale of seconds or less than three minutes. We then study dependencies between communication service-disruptions and external factors such as weather and power. Unreachable subnets are found to be weakly correlated with the storm. Power outages and lack of spare power are reported to be certain causes of communication disruptions. New research issues emerge for information acquisition across communication and power infrastructures as well as weather, and information sharing among organizations. | ||||||
BibTeX:
@article{6070520,
author = {Erjongmanee, S. and Ji, C.},
title = {Large-Scale Network-Service Disruption: Dependencies and External Factors},
journal = {Network and Service Management, IEEE Transactions on},
year = {2011},
volume = {8},
number = {4},
pages = {375 - 386},
doi = {http://dx.doi.org/10.1109/TNSM.2011.110311.110106}
}
|
||||||
| Fang, Shuo and Foh, Chuan Heng and Aung, Khin Mi Mi | Differentiated Congestion Management of Data Traffic for Data Center Ethernet | 2011 | Network and Service Management, IEEE Transactions on Vol. 8(4), pp. 322 -333 |
ethernet congestion management , computer network performance , storage area networks | DOI | |
| Abstract: This paper aims at designing a congestion and priority solution for Ethernet congestion management. Following the popular approach that uses a cooperation of an Additive Increase and Multiplicative Decrease (AIMD) based rate limiter and Explicit Congestion Notification (ECN) active queue management to combat congestions in Ethernet, the proposal considers differentiated AIMD settings for rate limiters to achieve congestion control differentiation for traffic of different priorities. We illustrate that while the operations of AIMD and ECN are independent, by using different AIMD settings, we can achieve differentiated control of bandwidth utilization. We develop a control theoretic analytical model to study the effectiveness of our proposed method. Moreover, we implement our proposed method in OMNET++ simulator to conduct simulation experiments. Our analytical and simulation results both indicate the effectiveness of bandwidth ratio differentiation. | ||||||
BibTeX:
@article{6092404,
author = {Fang, Shuo and Foh, Chuan Heng and Aung, Khin Mi Mi},
title = {Differentiated Congestion Management of Data Traffic for Data Center Ethernet},
journal = {Network and Service Management, IEEE Transactions on},
year = {2011},
volume = {8},
number = {4},
pages = {322 -333},
doi = {http://dx.doi.org/10.1109/TNSM.2011.110911.100076}
}
|
||||||
| Francois, P. and Bonaventure, O. and Decraene, B. and Coste, P.-A. | Avoiding Disruptions During Maintenance Operations on BGP Sessions | 2007 | Network and Service Management, IEEE Transactions on Vol. 4(3), pp. 1 -11 |
costs , frequency , internet , lab-on-a-chip , manuals , performance evaluation , routing , scheduling , telecommunication network topology , virtual private networks | internet , routing protocols | DOI |
| Abstract: This paper presents a solution aimed at avoiding losses of connectivity when an eBGP peering link is shut down by an operator for a maintenance. Currently, shutting down an eBGP session can lead to transient losses of connectivity even though alternate path are available at the borders of the network. This is very unfortunate as ISPs face more and more stringent service level agreements, and maintenance operations are predictable operations, so that there is time to adapt to the change and preserve the respect of the service level agreement. | ||||||
BibTeX:
@article{4489643,
author = {Francois, P. and Bonaventure, O. and Decraene, B. and Coste, P.-A.},
title = {Avoiding Disruptions During Maintenance Operations on BGP Sessions},
journal = {Network and Service Management, IEEE Transactions on},
year = {2007},
volume = {4},
number = {3},
pages = {1 -11},
doi = {http://dx.doi.org/10.1109/TNSM.2007.021102}
}
|
||||||
| Franke, U. | Optimal IT Service Availability: Shorter Outages, or Fewer? | 2012 | Network and Service Management, IEEE Transactions on Vol. 9(1), pp. 22-33 |
sla management , service level agreements , availability , fault management , optimization techniques , policy-based management | DOI | |
| Abstract: High enterprise IT service availability is a key success factor throughout many industries. While understanding of the economic importance of availability management is becoming more widespread, the implications for management of Service Level Agreements (SLAs) and thinking about availability risk management are just beginning to unfold. This paper offers a framework within which to think about availability management, highlighting the importance of variance of outage costs. The importance of variance is demonstrated using simulations on existing data sets of revenue data. An important implication is that when outage costs are proportional to outage duration, more but shorter outages should be preferred to fewer but longer, in order to minimize variance. Furthermore, two archetypal cases where the cost of an outage depends non-linearly on its duration are considered. An optimal outage length is derived, and some guidance is also given for its application when the variance of hourly downtime costs is considered. The paper is concluded with a discussion about the feasibility of the method, its practitioner relevance and its implications for SLA management. | ||||||
BibTeX:
@article{6092407,
author = {Franke, U.},
title = {Optimal IT Service Availability: Shorter Outages, or Fewer?},
journal = {Network and Service Management, IEEE Transactions on},
year = {2012},
volume = {9},
number = {1},
pages = {22-33},
doi = {http://dx.doi.org/10.1109/TNSM.2011.110811.110122}
}
|
||||||
| Franç andois, J. and Abdelnur, H. and State, R. and Festor, O. | Machine Learning Techniques for Passive Network Inventory | 2010 | Network and Service Management, IEEE Transactions on Vol. 7(4), pp. 244 -257 |
fingerprinting , svm , inventory management , syntactic tree | fingerprint identification , learning (artificial intelligence) , pattern classification , security of data , signalling protocols , support vector machines | DOI |
| Abstract: Being able to fingerprint devices and services, i.e., remotely identify running code, is a powerful service for both security assessment and inventory management. This paper describes two novel fingerprinting techniques supported by isomorphic based distances which are adapted for measuring the similarity between two syntactic trees. The first method leverages the support vector machines paradigm and requires a learning stage. The second method operates in an unsupervised manner thanks to a new classification algorithm derived from the ROCK and QROCK algorithms. It provides an efficient and accurate classification. We highlight the use of such classification techniques for identifying the remote running applications. The approaches are validated through extensive experimentations on SIP (Session Initiation Protocol) for evaluating the impact of the different parameters and identifying the best configuration before applying the techniques to network traces collected by a real operator. | ||||||
BibTeX:
@article{5668980,
author = {Franç andois, J. and Abdelnur, H. and State, R. and Festor, O.},
title = {Machine Learning Techniques for Passive Network Inventory},
journal = {Network and Service Management, IEEE Transactions on},
year = {2010},
volume = {7},
number = {4},
pages = {244 -257},
doi = {http://dx.doi.org/10.1109/TNSM.2010.1012.0352}
}
|
||||||
| Freire, E.P. and Ziviani, A. and Salles, R.M. | Detecting VoIP calls hidden in web traffic | 2008 | Network and Service Management, IEEE Transactions on Vol. 5(4), pp. 204 -214 |
network anomaly detection, skype, p2p voip systems, http traffic | internet telephony , peer-to-peer computing , telecommunication traffic , transport protocols | DOI |
| Abstract: Peer-to-peer (P2P) voice over IP (VoIP) applications (e.g. Skype or Google Talk) commonly use Web TCP ports (80 or 443) as a fallback mechanism to delude restrictive firewalls. This strategy renders this kind of traffic quite difficult to be detected by network managers. To deal with this issue, we propose and evaluate a method to detect VoIP calls hidden in Web traffic. We validate our proposal considering both Skype and Google Talk generated traffic by using real-world experimental data gathered at a commercial Internet Service Provider (ISP) and an academic institution. Our experimental results demonstrate that our proposed method achieves a performance of around 90% detection rate of VoIP calls hidden in Web traffic with a false positive rate of only 2%, whereas a 100% detection rate is achieved with a false positive rate limited to only 5%. We also evaluate the feasibility of applying our proposal in real-time detection scenarios. | ||||||
BibTeX:
@article{5010444,
author = {Freire, E.P. and Ziviani, A. and Salles, R.M.},
title = {Detecting VoIP calls hidden in web traffic},
journal = {Network and Service Management, IEEE Transactions on},
year = {2008},
volume = {5},
number = {4},
pages = {204 -214},
doi = {http://dx.doi.org/10.1109/TNSM.2009.041102}
}
|
||||||
| Jing Fu and Sjodin, P. and Karlsson, G. | Loop-free updates of forwarding tables | 2008 | Network and Service Management, IEEE Transactions on Vol. 5(1), pp. 22 -35 |
computer science , computerized monitoring , condition monitoring , degradation , fault diagnosis , ip networks , information technology , management information systems , scalability , web and internet services | internet , computer network management , computer network reliability , fault diagnosis | DOI |
| Abstract: When the forwarding paths in an IP network change due to a link failure or a link weight modification, the forwarding tables in the routers may need to be updated. Each of these updates may cause transient loops if they are not performed in an appropriate order. In this paper, we propose an order to update the forwarding tables that avoids transient loops for non-urgent changes. The order is obtained by studying the changes in the forwarding tables, therefore it can be used in networks running any routing protocols, and for any type of forwarding path changes. After presenting the order, we prove that it is correct, and present an efficient algorithm to compute the order. Thereafter, we present several algorithms for performing forwarding table updates in accordance with the order. We also discuss how the update algorithms can be applied to both networks with centralized control and decentralized routing protocols. Finally, we study the update algorithms' performance on several network topologies and with varying parameter settings and for several types of forwarding path changes. | ||||||
BibTeX:
@article{4570773,
author = {Jing Fu and Sjodin, P. and Karlsson, G.},
title = {Loop-free updates of forwarding tables},
journal = {Network and Service Management, IEEE Transactions on},
year = {2008},
volume = {5},
number = {1},
pages = {22 -35},
doi = {http://dx.doi.org/10.1109/TNSM.2008.080103}
}
|
||||||
| Fung, Carol J and Zhang, Jie and Aib, Issam and Boutaba, Raouf | Dirichlet-Based Trust Management for Effective Collaborative Intrusion Detection Networks | 2011 | Network and Service Management, IEEE Transactions on Vol. 8(2), pp. 79 -91 |
collaborative intrusion detection system , admission control , computer security , security management , trust management | computer network security , groupware , peer-to-peer computing | DOI |
| Abstract: The accuracy of detecting intrusions within a Collaborative Intrusion Detection Network (CIDN) depends on the efficiency of collaboration between peer Intrusion Detection Systems (IDSes) as well as the security itself of the CIDN. In this paper, we propose Dirichlet-based trust management to measure the level of trust among IDSes according to their mutual experience. An acquaintance management algorithm is also proposed to allow each IDS to manage its acquaintances according to their trustworthiness. Our approach achieves strong scalability properties and is robust against common insider threats, resulting in an effective CIDN. We evaluate our approach based on a simulated CIDN, demonstrating its improved robustness, efficiency and scalability for collaborative intrusion detection in comparison with other existing models. | ||||||
BibTeX:
@article{5871350,
author = {Fung, Carol J and Zhang, Jie and Aib, Issam and Boutaba, Raouf},
title = {Dirichlet-Based Trust Management for Effective Collaborative Intrusion Detection Networks},
journal = {Network and Service Management, IEEE Transactions on},
year = {2011},
volume = {8},
number = {2},
pages = {79 -91},
doi = {http://dx.doi.org/10.1109/TNSM.2011.050311.100028}
}
|
||||||
| Garcia-Dorado, J. and Finamore, A. and Mellia, M. and Meo, M. and Munafo, M. | Characterization of ISP Traffic: Trends, User Habits, and Access Technology Impact | 2012 | Network and Service Management, IEEE Transactions on Vol. 9(Early Access) |
isp traffic , network monitoring , traffic analyzer | DOI | |
| Abstract: In the recent years, the research community has increased its focus on network monitoring which is seen as a key tool to understand the Internet and the Internet users. Several studies have presented a deep characterization of a particular application, or a particular network, considering the point of view of either the ISP, or the Internet user. In this paper, we take a different perspective. We focus on three European countries where we have been collecting traffic for more than a year and a half through 5 vantage points with different access technologies. This humongous amount of information allows us not only to provide precise, multiple, and quantitative measurements of "What the user do with the Internet" in each country but also to identify common/uncommon patterns and habits across different countries and nations. Considering different time scales, we start presenting the trend of application popularity; then we focus our attention to a one-month long period, and further drill into a typical daily characterization of users activity. Results depict an evolving scenario due to the consolidation of new services as Video Streaming and File Hosting and to the adoption of new P2P technologies. Despite the heterogeneity of the users, some common tendencies emerge that can be leveraged by the ISPs to improve their service. | ||||||
BibTeX:
@article{6158423,
author = {Garcia-Dorado, J. and Finamore, A. and Mellia, M. and Meo, M. and Munafo, M.},
title = {Characterization of ISP Traffic: Trends, User Habits, and Access Technology Impact},
journal = {Network and Service Management, IEEE Transactions on},
year = {2012},
volume = {9},
number = {Early Access},
doi = {http://dx.doi.org/10.1109/TNSM.2012.022412.110184}
}
|
||||||
| Garroppo, R.G. and Giordano, S. and Niccolini, S. and Spagna, S. | A Prediction-Based Overload Control Algorithm for SIP Servers | 2011 | Network and Service Management, IEEE Transactions on Vol. 8(1), pp. 39 -51 |
dynamic load estimation , overload control , prediction , queueing management , session initiation protocol | 3g mobile communication , feedback , multimedia communication , network servers , prediction theory , queueing theory , signalling protocols , telecommunication congestion control , telecommunication traffic , telecontrol | DOI |
| Abstract: Overload is a challenging problem for a SIP server because the built-in overload control mechanism based on generating rejection messages could not prevent the server from collapsing due to congestion. In this scenario, the paper presents an overload mechanism combining a local and a remote solution. The local part of the overload control mechanism is based on the appropriate queueing structure and buffer management of the SIP proxy. The remote overload control mechanism is based on feedback reports provided by the SIP proxy to the upstream neighbors. These reports permit the traffic regulation necessary to avoid the critical condition of overload. The main paper contributions are the design of key components of a remote control mechanism, the proposal of a new approach for dynamic load estimation, and the use of a prediction technique in the remote control loop. | ||||||
BibTeX:
@article{5699971,
author = {Garroppo, R.G. and Giordano, S. and Niccolini, S. and Spagna, S.},
title = {A Prediction-Based Overload Control Algorithm for SIP Servers},
journal = {Network and Service Management, IEEE Transactions on},
year = {2011},
volume = {8},
number = {1},
pages = {39 -51},
doi = {http://dx.doi.org/10.1109/TNSM.2011.011211.1000010}
}
|
||||||
| Gencay, E. and Sinz, C. and Kuchlin, W. and Schafer, T. | SANchk: SQL-based SAN configuration checking | 2008 | Network and Service Management, IEEE Transactions on Vol. 5(2), pp. 91 -104 |
decision support systems , knowledge based systems , network fault diagnosis , query languages , relational databases , storage area networks | java , sql , xml , formal specification , relational databases , storage area networks | DOI |
| Abstract: Storage Area Networks (SANs) connect groups of storage devices to servers over fast interconnects. An important challenge lies in managing the complexity of the resulting massive SAN configurations. Policy-based validation using new logical frameworks has been proposed earlier as a solution to this configuration problem. SANchk offers a new solution that uses standard technologies such as SQL, XML, and Java, to implement a rule-based configuration checker. SANchk works as a light-weight extension to the relational databases of storage management systems; current support includes IBM's TPC and the open source Aperi storage manager. Some five dozen best practices rules for SAN configuration are implemented in SANchk, many of them with configurable parameters. Empirical results with several commercial SANs show that the approach is viable in practice. | ||||||
BibTeX:
@article{4694134,
author = {Gencay, E. and Sinz, C. and Kuchlin, W. and Schafer, T.},
title = {SANchk: SQL-based SAN configuration checking},
journal = {Network and Service Management, IEEE Transactions on},
year = {2008},
volume = {5},
number = {2},
pages = {91 -104},
doi = {http://dx.doi.org/10.1109/TNSM.2008.021102}
}
|
||||||
| Grieco, Luigi Alfredo and Barakat, Chadi and Marzulli, Michele | Spectral Models for Bitrate Measurement from Packet Sampled Traffic | 2011 | Network and Service Management, IEEE Transactions on Vol. 8(2), pp. 141 -152 |
packet sampling , internet measurements , spectral models | internet , sampling methods , spectral analysis , telecommunication traffic | DOI |
| Abstract: In network measurement systems, packet sampling techniques are usually adopted to reduce the overall amount of data to collect and process. Being based on a subset of packets, they introduce estimation errors that have to be properly counteracted by using a fine tuning of the sampling strategy and sophisticated inversion methods. This problem has been deeply investigated in the literature with particular attention to the statistical properties of packet sampling and to the recovery of the original network measurements. Herein, we propose a novel approach to predict the energy of the sampling error in the real time estimation of traffic bitrate, based on spectral analysis in the frequency domain. We start by demonstrating that the error introduced by packet sampling can be modeled as an aliasing effect in the frequency domain. Then, we derive closed-form expressions for the Signal-to-Noise Ratio (SNR) to predict the distortion of traffic bitrate estimates over time. The accuracy of the proposed SNR metric is validated by means of real packet traces. Furthermore, a comparison with respect to an analogous SNR expression derived using classic stochastic tools is proposed, showing that the frequency domain approach grants for a higher accuracy when traffic rate measurements are carried out at fine time granularity. | ||||||
BibTeX:
@article{5871354,
author = {Grieco, Luigi Alfredo and Barakat, Chadi and Marzulli, Michele},
title = {Spectral Models for Bitrate Measurement from Packet Sampled Traffic},
journal = {Network and Service Management, IEEE Transactions on},
year = {2011},
volume = {8},
number = {2},
pages = {141 -152},
doi = {http://dx.doi.org/10.1109/TNSM.2011.050311.100035}
}
|
||||||
| Griffin, Donna and Pesch, Dirk | Service provision for next generation mobile communication systems - the Telecommunication Service Exchange | 2006 | Network and Service Management, IEEE Transactions on Vol. 3(2), pp. 2 -12 |
agents , auctions , qos , sip , telecommunication service exchange (tse) , umts | DOI | |
| Abstract: The Telecommunication Service Exchange is a communication service platform based on a digital marketplace concept that enables customers to purchase telecommunication services. Customers are able buy product through this platform just as in a supermarket without being compelled to buy services from a particular producer or service provider. To enable this type of service provision, the current subscription model in telecommunications needs to be modified allowing customers to purchase telecommunication services on a per call basis. Using SIP, Electronic-Marketplaces and Agents, this paper outlines the architecture to achieve this as well as the possible benefits that this presents for both service providers and customers. An evaluation of the performance of the platform is also provided. | ||||||
BibTeX:
@article{4798309,
author = {Griffin, Donna and Pesch, Dirk},
title = {Service provision for next generation mobile communication systems - the Telecommunication Service Exchange},
journal = {Network and Service Management, IEEE Transactions on},
year = {2006},
volume = {3},
number = {2},
pages = {2 -12},
doi = {http://dx.doi.org/10.1109/TNSM.2006.4798309}
}
|
||||||
| Wenjun Gu and Dutta, N. and Chellappan, S. and Xiaole Bai | Providing End-to-End Secure Communications in Wireless Sensor Networks | 2011 | Network and Service Management, IEEE Transactions on Vol. 8(3), pp. 205 -218 |
sensor networks , key management , security | protocols , telecommunication security , wireless sensor networks | DOI |
| Abstract: In many Wireless Sensor Networks (WSNs), providing end to end secure communications between sensors and the sink is important for secure network management. While there have been many works devoted to hop by hop secure communications, the issue of end to end secure communications is largely ignored. In this paper, we design an end to end secure communication protocol in randomly deployed WSNs. Specifically, our protocol is based on a methodology called differentiated key pre-distribution. The core idea is to distribute different number of keys to different sensors to enhance the resilience of certain links. This feature is leveraged during routing, where nodes route through those links with higher resilience. Using rigorous theoretical analysis, we derive an expression for the quality of end to end secure communications, and use it to determine optimum protocol parameters. Extensive performance evaluation illustrates that our solutions can provide highly secure communications between sensor nodes and the sink in randomly deployed WSNs. We also provide detailed discussion on a potential attack (i.e. biased node capturing attack) to our solutions, and propose several countermeasures to this attack. | ||||||
BibTeX:
@article{5970247,
author = {Wenjun Gu and Dutta, N. and Chellappan, S. and Xiaole Bai},
title = {Providing End-to-End Secure Communications in Wireless Sensor Networks},
journal = {Network and Service Management, IEEE Transactions on},
year = {2011},
volume = {8},
number = {3},
pages = {205 -218},
doi = {http://dx.doi.org/10.1109/TNSM.2011.072611.100080}
}
|
||||||
| Hasan and Stiller, B. | SLO Auditing Task Analysis, Decomposition, and Specification | 2011 | Network and Service Management, IEEE Transactions on Vol. 8(1), pp. 15 -25 |
audit task decomposition , qos monitoring , dynamic configuration , service level objective auditing | internet , quality of service , task analysis | DOI |
| Abstract: Service Level Objectives (SLOs) - the core of a Service Level Agreement (SLA) - reflect major Quality-of-Service (QoS) requirements of customers on a service for a given price. SLOs need to be updated, if those requirements change. This leads to an update of the SLO auditing implementation. However, in many existing implementations, efforts are required to adapt to SLO changes, and even more efforts are needed for dynamic adaptations. Thus, a new SLO auditing design is essential to be able to reduce such efforts to the bare minimum. This is especially essential, if the service landscape and relevant QoS parameters are changing frequently. Thus, to meet this core functional requirement of an automated auditing, a generic auditing framework, applicable to any SLO, is presented in this paper, where the analysis of a general audit task, the identification of its sequence of subtasks (functional decomposition), and the development of a respective audit specification for each subtask has been performed. A use case and examples are presented to describe and apply the concept in detail. An SLO auditing application, which was prototyped, is not restricted to a certain set of QoS parameters, but it is dynamically reconfigurable and extensible according to changing demands. The work shows that it has become quite easy to instantiate an auditing application for new SLOs. Additionally, third parties would be able to offer SLO auditing services to a service provider separately. | ||||||
BibTeX:
@article{5741010,
author = {Hasan and Stiller, B.},
title = {SLO Auditing Task Analysis, Decomposition, and Specification},
journal = {Network and Service Management, IEEE Transactions on},
year = {2011},
volume = {8},
number = {1},
pages = {15 -25},
doi = {http://dx.doi.org/10.1109/TNSM.2011.032311.100312}
}
|
||||||
| Hashim, F. and Munasinghe, K.S. and Jamalipour, A. | Biologically Inspired Anomaly Detection and Security Control Frameworks for Complex Heterogeneous Networks | 2010 | Network and Service Management, IEEE Transactions on Vol. 7(4), pp. 268 -281 |
heterogeneous network security , biologically inspired security , danger theory , epidemiology , human immune system | complex networks , computer network security , invasive software , protocols | DOI |
| Abstract: The demand for anytime, anywhere, anyhow communications in future generation networks necessitates a paradigm shift from independent network services into a more harmonized system. This vision can be accomplished by integrating the existing and emerging access networks via a common Internet Protocol (IP) based platform. Nevertheless, owing to the inter-worked infrastructure, a malicious security threat in such a heterogeneous network is no more confined to its originating network domain, but can easily be propagated to other access networks. To address these security concerns, this paper proposes a biologically inspired security framework that governs the cooperation among network entities to identify security attacks, to perform security updates, and to inhibit attacks propagation in the heterogeneous network. The proposed framework incorporates two principal security components, in the form of anomaly detection framework and security control framework. Several plausible principles from two fields of biology, in particular the human immune system (HIS) and epidemiology have been adopted into the proposed security framework. Performance evaluation demonstrates the efficiency of the proposed biologically inspired security framework in detecting malicious anomalies such as denial-of-service (DoS), distributed DoS (DDoS), and worms, as well as restricting their propagations in the heterogeneous network. | ||||||
BibTeX:
@article{5668982,
author = {Hashim, F. and Munasinghe, K.S. and Jamalipour, A.},
title = {Biologically Inspired Anomaly Detection and Security Control Frameworks for Complex Heterogeneous Networks},
journal = {Network and Service Management, IEEE Transactions on},
year = {2010},
volume = {7},
number = {4},
pages = {268 -281},
doi = {http://dx.doi.org/10.1109/TNSM.2010.1012.0360}
}
|
||||||
| Hellerstein, J. and Singhal, S. and Qian Wang | Research challenges in control engineering of computing systems | 2009 | Network and Service Management, IEEE Transactions on Vol. 6(4), pp. 206 -211 |
control theory , computing systems | closed loop systems , control engineering , control theory , software engineering | DOI |
| Abstract: A wide variety of software systems employ closed loops (feedback) to achieve service level objectives and to optimize resource usage. Control theory provides a systematic approach to constructing closed loop systems, and is widely used in disciplines such as mechanical and electrical engineering. This paper describes recent advances in applying control theory to computing systems, and identifies research challenges to address so that control engineering can be widely used by software practitioners. | ||||||
BibTeX:
@article{5374029,
author = {Hellerstein, J. and Singhal, S. and Qian Wang},
title = {Research challenges in control engineering of computing systems},
journal = {Network and Service Management, IEEE Transactions on},
year = {2009},
volume = {6},
number = {4},
pages = {206 -211},
doi = {http://dx.doi.org/10.1109/TNSM.2009.04.090401}
}
|
||||||
| Kin-Hon Ho and Pavlou, G. and Ning Wang and Howarth, M. | Joint optimization of intra- and inter-autonomous system traffic engineering | 2009 | Network and Service Management, IEEE Transactions on Vol. 6(2), pp. 64 -79 |
joint optimization, intra-as traffic engineering, inter-as traffic engineering | optimisation , traffic engineering computing | DOI |
| Abstract: Traffic Engineering (TE) involves network configuration in order to achieve optimal IP network performance. The existing literature considers intra- and inter-AS (Autonomous System) TE independently. However, if these two aspects are considered separately, the overall network performance may not be truly optimized. This is due to the interaction between intra and inter-AS TE, where a good solution of inter-AS TE may not be good for intra-AS TE. To remedy this situation, we propose a joint optimization of intra- and inter-AS TE in order to improve the overall network performance by simultaneously finding the best egress points for inter-AS traffic and the best routing scheme for intra-AS traffic. Three strategies are presented to attack the problem, sequential, nested and integrated optimization. Our evaluation shows that, in comparison to sequential and nested optimization, integrated optimization can significantly improve overall network performance by being able to accommodate approximately 30%-60% more traffic demand. | ||||||
BibTeX:
@article{5374828,
author = {Kin-Hon Ho and Pavlou, G. and Ning Wang and Howarth, M.},
title = {Joint optimization of intra- and inter-autonomous system traffic engineering},
journal = {Network and Service Management, IEEE Transactions on},
year = {2009},
volume = {6},
number = {2},
pages = {64 -79},
doi = {http://dx.doi.org/10.1109/TNSM.2009.090601}
}
|
||||||
| Anpeng Huang and Siyu Liu and Linzhen Xie and Zhangyuan Chen and Mukherjee, B. | Self-Healing Optical Access Networks (SHOAN) Operated by Optical Switching Technologies | 2011 | Network and Service Management, IEEE Transactions on Vol. 8(3), pp. 234 -244 |
optical access network , low cost , reliable services , self-healing , survivability | broadband networks , light transmission , optical fibre subscriber loops , optical switches | DOI |
| Abstract: An optical access network should offer low-cost reliable services to its end users. To address this problem, an optimal solution is needed which can turn an optical access architecture into a self-healing system. Hence, we propose the Self-Healing Optical Access Network (SHOAN), in which two or more optical access architectures are partners of each other, and they are interconnected by elementary optical crossbar switches into a simple mesh network. In SHOAN, the crossbar switches can keep each access architecture as an independent and closed system for only serving its own end users in normal state. But the crossbars become open in fault scenarios. Whenever a failure occurs in the network, the fault can be monitored and affected services can be recovered by the partner of the access architecture that is affected. Such an interconnected optical access network can withstand failures in its transmission paths, and recover network services in a self-healing way. Compared to existing solutions (e.g., dual-home architecture), illustrative examples demonstrate that SHOAN has many desirable properties: (1) it is robust because risks are disjointed, (2) it is reliable because service recovery is given top priority, and (3) it has low cost because redundant backup components are not necessary since the partner's resources act as backup resources. Analysis results show that SHOAN can minimize disruption duration and network cost for broadband access services. | ||||||
BibTeX:
@article{6009143,
author = {Anpeng Huang and Siyu Liu and Linzhen Xie and Zhangyuan Chen and Mukherjee, B.},
title = {Self-Healing Optical Access Networks (SHOAN) Operated by Optical Switching Technologies},
journal = {Network and Service Management, IEEE Transactions on},
year = {2011},
volume = {8},
number = {3},
pages = {234 -244},
doi = {http://dx.doi.org/10.1109/TNSM.2011.080311.100065}
}
|
||||||
| Huang, G. and Chang, C. and Chuah, C. and Lin, B. | Measurement-Aware Monitor Placement and Routing: A Joint Optimization Approach for Network-Wide Measurements | 2012 | Network and Service Management, IEEE Transactions on Vol. 9(1), pp. 48-59 |
traffic measurement , routing , traffic engineering | DOI | |
| Abstract: Network-wide traffic measurement is important for various network management tasks, ranging from traffic accounting, traffic engineering, network troubleshooting to security. Previous research in this area has focused on either deriving better monitor placement strategies for fixed routing, or strategically routing traffic sub-populations over existing deployed monitors to maximize the measurement gain. However, neither of them alone suffices in real scenarios, since not only the number of deployed monitors is limited, but also the traffic characteristics and measurement objectives are constantly changing. This paper presents an MMPR (Measurement-aware Monitor Placement and Routing) framework that jointly optimizes monitor placement and dynamic routing strategy to achieve maximum measurement utility. The main challenge in solving MMPR is to decouple the relevant decision variables and adhere to the intra-domain traffic engineering constraints. We formulate it as an MILP (Mixed Integer Linear Programming) problem and propose several heuristic algorithms to approximate the optimal solution and reduce the computation complexity. Through experiments using real traces and topologies (Abilene , AS6461 , and GEANT ), we show that our heuristic solutions can achieve measurement gains that are quite close to the optimal solutions, while reducing the computation times by a factor of 23X in Abilene (small), 246X in AS6461 (medium), and 233X in GEANT (large), respectively. | ||||||
BibTeX:
@article{6128762,
author = {Huang, G. and Chang, C. and Chuah, C. and Lin, B.},
title = {Measurement-Aware Monitor Placement and Routing: A Joint Optimization Approach for Network-Wide Measurements},
journal = {Network and Service Management, IEEE Transactions on},
year = {2012},
volume = {9},
number = {1},
pages = {48-59},
doi = {http://dx.doi.org/10.1109/TNSM.2012.010912.110128}
}
|
||||||
| Hwang, JeeHyun and Xie, Tao and Chen, Fei and Liu, Alex X. | Systematic Structural Testing of Firewall Policies | 2012 | Network and Service Management, IEEE Transactions on Vol. 9(1), pp. 1 -11 |
firewall policy , fault detection , structural coverage , test packet generation , validation | DOI | |
| Abstract: Firewalls are the mainstay of enterprise security and the most widely adopted technology for protecting private networks. As the quality of protection provided by a firewall directly depends on the quality of its policy (i.e., configuration), ensuring the correctness of firewall policies is important and yet difficult. To help ensure the correctness, we propose a systematic structural testing approach for firewall policies. We define structural coverage (based on coverage criteria of rules, predicates, and clauses) on the firewall policy under test. To achieve high structural coverage effectively, we have developed four automated packet generation techniques: the random packet generation, the one based on local constraint solving (considering individual rules locally in a policy), the one based on global constraint solving (considering multiple rules globally in a policy), and the one based on boundary values. We have conducted an experiment on a set of real policies and a set of faulty policies to detect faults with generated packet sets. Generally, our experimental results show that a packet set with higher structural coverage has higher fault-detection capability (i.e., detecting more injected faults). Our experimental results show that a reduced packet set (maintaining the same level of structural coverage with the corresponding original packet set) maintains similar fault-detection capability with the original set. | ||||||
BibTeX:
@article{6138839,
author = {Hwang, JeeHyun and Xie, Tao and Chen, Fei and Liu, Alex X.},
title = {Systematic Structural Testing of Firewall Policies},
journal = {Network and Service Management, IEEE Transactions on},
year = {2012},
volume = {9},
number = {1},
pages = {1 -11},
doi = {http://dx.doi.org/10.1109/TNSM.2012.012012.100092}
}
|
||||||
| Jesi, G.P. and Montresor, A. and Babaoglu, O. | Proximity-Aware Superpeer Overlay Topologies | 2007 | Network and Service Management, IEEE Transactions on Vol. 4(2), pp. 74 -83 |
communication system control , delay , insects , network topology , peer to peer computing , physics computing , protocols , telecommunication traffic , telephony , traffic control | peer-to-peer computing , protocols , telecommunication network topology | DOI |
| Abstract: The concept of superpeer has been introduced to improve the performance of popular P2P applications. A superpeer is a "powerful" node that acts as a server for a set of clients, and as an equal with respect to other superpeers. By exploiting heterogeneity, the superpeer paradigm can lead to improved efficiency, without compromising the decentralized nature of P2P networks. The main issues in constructing superpeer-based overlays are the selection of superpeers and the association between superpeers and clients. Generally, superpeers are either run voluntarily (without an explicit selection process), or chosen among the "best" nodes in the network, for example those with the most abundant resources, such as bandwidth or storage. In several contexts, however, shared resources are not the only factor; latency between clients and superpeers may play an important role, for example in online games and IP-Telephony applications. This paper presents SG-2, a novel protocol for building and maintaining proximity-aware superpeer topologies. SG-2 uses a gossip-based protocol to spread messages to nearby nodes and a biology-inspired task allocation mechanism to promote the "best" nodes to superpeer status. The paper includes extensive simulation experiments to prove the efficiency, scalability and robustness of SG-2. | ||||||
BibTeX:
@article{4383309,
author = {Jesi, G.P. and Montresor, A. and Babaoglu, O.},
title = {Proximity-Aware Superpeer Overlay Topologies},
journal = {Network and Service Management, IEEE Transactions on},
year = {2007},
volume = {4},
number = {2},
pages = {74 -83},
doi = {http://dx.doi.org/10.1109/TNSM.2007.070904}
}
|
||||||
| Jiang, Miao and Munawar, Mohammad A. and Reidemeister, Thomas and Ward, Paul A.S. | System Monitoring with Metric-Correlation Models | 2011 | Network and Service Management, IEEE Transactions on Vol. 8(4), pp. 348 -360 |
system monitoring , fault detection , heteroscedasticity , metric-correlation models , multi-variable correlations , recursive least squares | DOI | |
| Abstract: Modern software systems expose management metrics to help track their health. Recently, it was demonstrated that correlations among these metrics allow errors to be detected and their causes localized. Prior research shows that linear models can capture many of these correlations. However, our research shows that several factors may prevent linear models from accurately describing correlations, even if the underlying relationship is linear. Common phenomena we have observed include relationships that evolve, relationships with missing variables, and heterogeneous residual variance of the correlated metrics. Usually these phenomena can be discovered by testing for heteroscedasticity of the underlying linear models. Such behaviour violates the assumptions of simple linear regression, which thus fail to describe system dynamics correctly. In this paper we address the above challenges by employing efficient variants of Ordinary Least Squares regression models. In addition, we automate the process of error detection by introducing the Wilcoxon Rank-Sum test after proper correlations modeling. We validate our models using a realistic Java-Enterprise-Edition application. Using fault-injection experiments we show that our improved models capture system behavior accurately. | ||||||
BibTeX:
@article{6102277,
author = {Jiang, Miao and Munawar, Mohammad A. and Reidemeister, Thomas and Ward, Paul A.S.},
title = {System Monitoring with Metric-Correlation Models},
journal = {Network and Service Management, IEEE Transactions on},
year = {2011},
volume = {8},
number = {4},
pages = {348 -360},
doi = {http://dx.doi.org/10.1109/TNSM.2011.120811.100033}
}
|
||||||
| Jordan, S. | Traffic Management and Net Neutrality in Wireless Networks | 2011 | Network and Service Management, IEEE Transactions on Vol. 8(4), pp. 297 - 309 |
open wireless architecture , computer network management , law , public policy , telecommunication services | DOI | |
| Abstract: Many wireless ISPs limit the applications that may be used on wireless devices. In the United States, Congress is debating whether wireless network subscribers should have the right to use applications of their choice. We examine whether wireless ISPs should be able to limit applications. We address how wired and wireless networks differ with respect to traffic management, and conclude that wireless networks often require stronger traffic management than wired networks at and below the network layer. We propose dual goals of providing a level playing field between applications offered by ISPs and those offered by competing application providers and guaranteeing wireless ISPs the ability to reasonably manage wireless network resources. We consider three scenarios for how applications may be restricted on wireless networks, and find that none achieves both goals. We review United States communications law, and conclude that ISPs should be prohibited from giving themselves an unfair competitive edge by blocking applications or by denying QoS to competing application providers. We propose a set of regulations based on network architecture and communication law that limits an ISP's ability to restrict applications by requiring an open interface between network and transport layers. We illustrate how ISPs may deploy QoS within such a regulatory framework, and how this proposed policy can achieve our goals. | ||||||
BibTeX:
@article{6070517,
author = {Jordan, S.},
title = {Traffic Management and Net Neutrality in Wireless Networks},
journal = {Network and Service Management, IEEE Transactions on},
year = {2011},
volume = {8},
number = {4},
pages = {297 - 309},
doi = {http://dx.doi.org/10.1109/TNSM.2011.110311.100093}
}
|
||||||
| Jurca, D. and Stadler, R. | H-GAP: estimating histograms of local variables with accuracy objectives for distributed real-time monitoring | 2010 | Network and Service Management, IEEE Transactions on Vol. 7(2), pp. 83 -95 |
real-time monitoring, distributed aggregation, adaptive protocols. | computerised monitoring , optimisation , protocols , trees (mathematics) | DOI |
| Abstract: We present H-GAP, a protocol for continuous monitoring, which provides a management station with the value distribution of local variables across the network. The protocol estimates the histogram of local state variables for a given accuracy and with minimal overhead. H-GAP is decentralized and asynchronous to achieve robustness and scalability, and it executes on an overlay interconnecting management processes in network devices. On this overlay, the protocol maintains a spanning tree and updates the histogram through incremental aggregation. The protocol is tunable in the sense that it allows controlling, at runtime, the trade-off between protocol overhead and an accuracy objective. This functionality is realized through dynamic configuration of local filters that control the flow of updates towards the management station. The paper includes an analysis of the problem of histogram aggregation over aggregation trees, a formulation of the global optimization problem, and a distributed solution containing heuristic, tree-based algorithms. Using SUM as an example, we show how general aggregation functions over local variables can be efficiently computed with H-GAP. We evaluate our protocol through simulation using real traces. The results demonstrate the controllability of H-GAP in a selection of scenarios and its efficiency in large-scale networks. | ||||||
BibTeX:
@article{5471039,
author = {Jurca, D. and Stadler, R.},
title = {H-GAP: estimating histograms of local variables with accuracy objectives for distributed real-time monitoring},
journal = {Network and Service Management, IEEE Transactions on},
year = {2010},
volume = {7},
number = {2},
pages = {83 -95},
doi = {http://dx.doi.org/10.1109/TNSM.2010.06.I8P0292}
}
|
||||||
| Kamiyama, Noriaki | Efficient Network Modification to Improve QoS Stability at Failures | 2011 | Network and Service Management, IEEE Transactions on Vol. 8(2), pp. 153 -164 |
qos stability , link capacity , network topology , single link failure | internet , investment , quality of service , stability , telecommunication links , telecommunication network planning , telecommunication traffic | DOI |
| Abstract: When a link or node fails, flows are detoured around the failed portion, so the hop count of flows and the link load could change dramatically as a result of the failure. As real-time traffic such as video or voice increases on the Internet, ISPs are required to provide stable quality as well as connectivity at failures. For ISPs, how to effectively improve the stability of these qualities at failures with the minimum investment cost is an important issue, and they need to effectively select a limited number of locations to add link facilities. In this paper, efficient design algorithms to select the locations for adding link facilities are proposed and their effectiveness is evaluated using the actual backbone networks of 36 commercial ISPs. | ||||||
BibTeX:
@article{5871355,
author = {Kamiyama, Noriaki},
title = {Efficient Network Modification to Improve QoS Stability at Failures},
journal = {Network and Service Management, IEEE Transactions on},
year = {2011},
volume = {8},
number = {2},
pages = {153 -164},
doi = {http://dx.doi.org/10.1109/TNSM.2011.020411.00017}
}
|
||||||
| Kamoun, F. | RFID system management: state-of-the art and open research issues | 2009 | Network and Service Management, IEEE Transactions on Vol. 6(3), pp. 190 -205 |
radio frequency identification, rfid network management, reader management. | radiofrequency identification , telecommunication network management | DOI |
| Abstract: Radiofrequency identification (RFID) is an enabling technology that can provide organizations with unprecedented improved visibility and traceability of items throughout their journey in the value chain. As RFID deployments are scaling-up from pilot projects and proof-of-concept trials towards fully-fledged enterprise applications, RFID system management challenges will escalate. This paper takes an in-depth look at the management aspects of RFID systems. The current state-of-the art of RFID systems management is exposed, whereby various approaches are discussed under five functional areas, namely configuration, fault, performance, accounting and security management. The paper also highlights some future trends and open research areas that can potentially trigger further interests and investigations in this important topic. | ||||||
BibTeX:
@article{5374839,
author = {Kamoun, F.},
title = {RFID system management: state-of-the art and open research issues},
journal = {Network and Service Management, IEEE Transactions on},
year = {2009},
volume = {6},
number = {3},
pages = {190 -205},
doi = {http://dx.doi.org/10.1109/TNSM.2009.03.090305}
}
|
||||||
| Katib, I. and Medhi, D. | IP/MPLS-over-OTN-over-DWDM Multilayer Networks: An Integrated Three-Layer Capacity Optimization Model, a Heuristic, and a Study | 2012 | Network and Service Management, IEEE Transactions on Vol. 9(Early Access) |
dwdm , ip/mpls , otn , multilayer network , network planning and optimization , routing | DOI | |
| Abstract: Multilayer network design has received significant attention in current literature. Despite this, the explicit modeling of IP/MPLS over OTN over DWDM in which the OTN layer is specifically considered has not been addressed before. This architecture has been identified as promising that bridges integration and interaction between the IP and optical layers. In this paper, we present an integrated capacity optimization model for network planning of such multilayer networks that consider the OTN layer as a distinct layer with its unique technological sublayer constraints. We develop a heuristic algorithm to solve this model for large networks. Finally, we provide a detailed numeric study that considers various cost parameter values of each layer in the network. We analyze the impact of each layer's cost parameter values on neighboring layers and overall network cost. | ||||||
BibTeX:
@article{6192354,
author = {Katib, I. and Medhi, D.},
title = {IP/MPLS-over-OTN-over-DWDM Multilayer Networks: An Integrated Three-Layer Capacity Optimization Model, a Heuristic, and a Study},
journal = {Network and Service Management, IEEE Transactions on},
year = {2012},
volume = {9},
number = {Early Access},
doi = {http://dx.doi.org/10.1109/TNSM.2012.12.110124}
}
|
||||||
| Keller, Alexander and Benke, Oliver and Debusmann, Markus and Koppel, Andreas and Kreger, Heather and Maier, Andreas and Schopmeyer, Karl | The CIM Metrics Model: Introducing flexible data collection and aggregation for performance management in CIM | 2004 | Network and Service Management, IEEE Transactions on Vol. 1(2), pp. 59 -71 |
computer architecture , computer integrated manufacturing , computer network management , counting circuits , distributed computing , environmental management , measurement , remote monitoring , resource management , runtime | DOI | |
| Abstract: We describe new extensions to the CIM Metrics Model, termed BaseMetrics Submodel, whose scope is to define schema extensions capable of specifying and subsequently instantiating new performance measurement data at the runtime of a system. The model has been developed by the Metric Extensions Working Group of the Distributed Management Task Force (DMTF) in which the authors actively participate. The BaseMetrics submodel has been adopted by the CIM Technical Committee and is part of the CIM schema. In addition, we present an extension to the BaseMetrics submodel that allows the definition and aggregation of arbitrary performance data at runtime to address the requirements of service level agreements and workload management systems. Two examples illustrate the applicability of the model to real-life data collection and aggregation scenarios in distributed computing environments. | ||||||
BibTeX:
@article{4798291,
author = {Keller, Alexander and Benke, Oliver and Debusmann, Markus and Koppel, Andreas and Kreger, Heather and Maier, Andreas and Schopmeyer, Karl},
title = {The CIM Metrics Model: Introducing flexible data collection and aggregation for performance management in CIM},
journal = {Network and Service Management, IEEE Transactions on},
year = {2004},
volume = {1},
number = {2},
pages = {59 -71},
doi = {http://dx.doi.org/10.1109/TNSM.2004.4798291}
}
|
||||||
| Keller, A. and Brown, A.B. and Hellerstein, J.L. | A Configuration Complexity Model and Its Application to a Change Management System | 2007 | Network and Service Management, IEEE Transactions on Vol. 4(1), pp. 13 -27 |
algorithm design and analysis , application software , automation , automobile manufacture , computer network management , costs , databases , humans , middleware , web server | java , management of change , middleware | DOI |
| Abstract: The complexity of configuring computing systems is a major impediment to the adoption of new information technology (IT) products and greatly increases the cost of IT services. This paper develops a model of configuration complexity and demonstrates its value for a change management system. The model represents systems as a set of nested containers with configuration controls. From this representation, we derive various metrics that indicate configuration complexity, including execution complexity, parameter complexity, and memory complexity. We apply this model to a J2EE-based enterprise application and its associated middleware stack to assess the complexity of the manual configuration process for this application. We then show how an automated change management system can greatly reduce configuration complexity. | ||||||
BibTeX:
@article{4275031,
author = {Keller, A. and Brown, A.B. and Hellerstein, J.L.},
title = {A Configuration Complexity Model and Its Application to a Change Management System},
journal = {Network and Service Management, IEEE Transactions on},
year = {2007},
volume = {4},
number = {1},
pages = {13 -27},
doi = {http://dx.doi.org/10.1109/TNSM.2007.030102}
}
|
||||||
| Keller, A. and Diao, Y. and Eskesen, F. and Froehlich, S. and Hellerstein, J.l. and Surendra, M. and Spainhower, L.F. | Generic On-Line Discovery of Quantitative Models | 2004 | Network and Service Management, IEEE Transactions on Vol. 1(1), pp. 39 -48 |
computer integrated manufacturing , databases , delay , knowledge management , measurement , monitoring , neural networks , predictive models , prototypes , technology management | DOI | |
| Abstract: Quantitative models are needed for a variety of management tasks, including identification of critical variables to use for health monitoring, anticipating service-level violations by using predictive models, and ongoing optimization of configurations. Unfortunately, constructing quantitative models requires specialized skills that are in short supply. Even worse, rapid changes in provider configurations and the evolution of business demands mean that quantitative models must be updated on an ongoing basis. This paper describes an architecture and algorithms for online discovery of quantitative models without prior knowledge of the managed elements. The architecture makes use of an element schema that describes managed elements using the Common Information Model (CIM). Algorithms are presented for selecting a subset of the element metrics to use as explanatory variables in a quantitative model and for constructing the quantitative model itself. We further describe a prototype system based onthis architecture that incorporates these algorithms. We apply the prototype to online estimation of response times for DB2 Universal Database under a TPC-W workload. Of the approximately 500 metrics available from the DB2 performance monitor, our system chooses three to construct a model that explains 72 percent of the variability of response time. | ||||||
BibTeX:
@article{4623693,
author = {Keller, A. and Diao, Y. and Eskesen, F. and Froehlich, S. and Hellerstein, J.l. and Surendra, M. and Spainhower, L.F.},
title = {Generic On-Line Discovery of Quantitative Models},
journal = {Network and Service Management, IEEE Transactions on},
year = {2004},
volume = {1},
number = {1},
pages = {39 -48},
doi = {http://dx.doi.org/10.1109/TNSM.2004.4623693}
}
|
||||||
| Kettig, Oliver and Kolbe, Hans-Joerg | Monitoring the Impact of P2P Users on a Broadband Operator's Network over Time | 2011 | Network and Service Management, IEEE Transactions on Vol. 8(2), pp. 116 -127 |
communication systems , broadband , networks , peer-to-peer (p2p) | broadband networks , data privacy , peer-to-peer computing , telecommunication traffic | DOI |
| Abstract: Since their emergence peer-to-peer (P2P) applications have been generating a considerable fraction of the overall transferred bandwidth in broadband networks. Residential broadband service has been moving from one geared towards technology enthusiasts and early adopters to a commodity for a large fraction of households. Thus, the question whether P2P is still the dominant application in terms of bandwidth usage becomes highly relevant for broadband operators. In this work we present an adaption to a previously published method for classifying broadband users into a P2P- and a non-P2P group based on the amount of communication partners ("peers") they have in a dedicated timeframe. Based on this classification, we derive their impact on network characteristics like the number of active users and their aggregate bandwidth. Privacy is assured by anonymization of the data and by not taking into account the packet payloads. We apply our method to real operational data collected 2007 and 2010, respectively, from a major German DSL provider's access link which transported all traffic each user generates and receives. In 2010 the fraction of P2P users clearly decreased compared to previous years. Nevertheless we find that P2P users are still large contributors to the total amount of traffic seen especially in upstream direction. However in 2010 the impact from P2P on the bandwidth peaks in the busy hours has clearly decreased while other applications have a growing impact, leading to an increased bandwidth usage per subscriber in the peak hours. Further analysis also reveals that the P2P users' traffic still does not exhibit strong locality. We compare our findings to those available in the literature and propose areas for future work on network monitoring, P2P applications, and network design. | ||||||
BibTeX:
@article{5871353,
author = {Kettig, Oliver and Kolbe, Hans-Joerg},
title = {Monitoring the Impact of P2P Users on a Broadband Operator's Network over Time},
journal = {Network and Service Management, IEEE Transactions on},
year = {2011},
volume = {8},
number = {2},
pages = {116 -127},
doi = {http://dx.doi.org/10.1109/TNSM.2011.100056}
}
|
||||||
| Kind, A. and Stoecklin, M.P. and Dimitropoulos, X. | Histogram-based traffic anomaly detection | 2009 | Network and Service Management, IEEE Transactions on Vol. 6(2), pp. 110 -121 |
computer network security, monitoring, clustering methods | computer network security , pattern clustering , probability , telecommunication traffic | DOI |
| Abstract: Identifying network anomalies is essential in enterprise and provider networks for diagnosing events, like attacks or failures, that severely impact performance, security, and Service Level Agreements (SLAs). Feature-based anomaly detection models (ab)normal network traffic behavior by analyzing different packet header features, like IP addresses and port numbers. In this work, we describe a new approach to feature-based anomaly detection that constructs histograms of different traffic features, models histogram patterns, and identifies deviations from the created models. We assess the strengths and weaknesses of many design options, like the utility of different features, the construction of feature histograms, the modeling and clustering algorithms, and the detection of deviations. Compared to previous feature-based anomaly detection approaches, our work differs by constructing detailed histogram models, rather than using coarse entropy-based distribution approximations. We evaluate histogram-based anomaly detection and compare it to previous approaches using collected network traffic traces. Our results demonstrate the effectiveness of our technique in identifying a wide range of anomalies. The assessed technical details are generic and, therefore, we expect that the derived insights will be useful for similar future research efforts. | ||||||
BibTeX:
@article{5374831,
author = {Kind, A. and Stoecklin, M.P. and Dimitropoulos, X.},
title = {Histogram-based traffic anomaly detection},
journal = {Network and Service Management, IEEE Transactions on},
year = {2009},
volume = {6},
number = {2},
pages = {110 -121},
doi = {http://dx.doi.org/10.1109/TNSM.2009.090604}
}
|
||||||
| Kjaer, M.A. and Kihl, M. and Robertsson, A. | Resource allocation and disturbance rejection in web servers using SLAs and virtualized servers | 2009 | Network and Service Management, IEEE Transactions on Vol. 6(4), pp. 226 -239 |
web server , disturbance rejection , feed-forward , online estimation , prediction , resource management , response-time control , virtualization | discrete event simulation , feedforward , file servers , parameter estimation , resource allocation , telecommunication control | DOI |
| Abstract: Resource management in IT-enterprises gain more and more attention due to high operation costs. For instance, web sites are subject to very changing traffic-loads over the year, over the day, or even over the minute. Online adaption to the changing environment is one way to reduce losses in the operation. Control systems based on feedback provide methods for such adaption, but is in nature slow, since changes in the environment has to propagate through the system before being compensated. Therefore, feed-forward systems can be introduced that has shown to improve the transient performance. However, earlier proposed feed-forward systems have been based on offline estimation. In this article we show that off-line estimations can be problematic in online applications. Therefore, we propose a method where parameters are estimated online, and thus also adapts to the changing environment. We compare our solution to two other control strategies proposed in the literature, which are based on off-line estimation of certain parameters. We evaluate the controllers with both discrete-event simulations and experiments in our testbed. The investigations show the strength of our proposed control system. | ||||||
BibTeX:
@article{5374031,
author = {Kjaer, M.A. and Kihl, M. and Robertsson, A.},
title = {Resource allocation and disturbance rejection in web servers using SLAs and virtualized servers},
journal = {Network and Service Management, IEEE Transactions on},
year = {2009},
volume = {6},
number = {4},
pages = {226 -239},
doi = {http://dx.doi.org/10.1109/TNSM.2009.04.090403}
}
|
||||||
| Kristiansson, Johan and Parnes, Peter | An application-layer approach to seamless mobile multimedia communication | 2006 | Network and Service Management, IEEE Transactions on Vol. 3(1), pp. 33 -42 |
mobility management , soft-handover , ubiquitous multimedia | DOI | |
| Abstract: Providing seamless IP mobility support is one of the most challenging problems towards a world of mobile and ubiquitous multimedia communication. | ||||||
BibTeX:
@article{4798305,
author = {Kristiansson, Johan and Parnes, Peter},
title = {An application-layer approach to seamless mobile multimedia communication},
journal = {Network and Service Management, IEEE Transactions on},
year = {2006},
volume = {3},
number = {1},
pages = {33 -42},
doi = {http://dx.doi.org/10.1109/TNSM.2006.4798305}
}
|
||||||
| Kulkarni, P. G. and McClean, S. I. and Parr, G. P. and Black, M. M. | Lightweight proactive queue management | 2006 | Network and Service Management, IEEE Transactions on Vol. 3(2), pp. 1 -11 |
proactive management , adaptive learning , performance management , recursive least squares , self management | DOI | |
| Abstract: The quest for better resource control has been the driving force behind Active Queue Management (AQM) research. Random Early Detection (RED), the defacto standard and its variants have been proposed as simple solutions to the AQM problem. These approaches, however, are known to suffer from problems like parameter sensitivity and inability to capture input traffic load fluctuations accurately, thereby resulting in instability. This paper presents a proactive queue management algorithm called PAQMAN that captures input traffic load fluctuations accurately and regulates the queue size around the desirable level. PAQMAN draws from the predictability in the underlying traffic by employing the Recursive Least Squares (RLS) algorithm to forecast the average queue size over the next prediction interval using the average queue size information of the past intervals. The packet drop probability is then computed as a function of this predicted average queue size. The performance of PAQMAN has been evaluated and compared against existing AQM schemes through ns-2 simulations that encompass varying network conditions for networks comprising of single as well as multiple bottleneck links. Simulation results demonstrate that PAQMAN maintains a relatively low queue size, while at the same time achieving high link utilization and low packet loss. Moreover, the computational overhead of PAQMAN is negligible (lightweight) which further justifies its use. | ||||||
BibTeX:
@article{4798310,
author = {Kulkarni, P. G. and McClean, S. I. and Parr, G. P. and Black, M. M.},
title = {Lightweight proactive queue management},
journal = {Network and Service Management, IEEE Transactions on},
year = {2006},
volume = {3},
number = {2},
pages = {1 -11},
doi = {http://dx.doi.org/10.1109/TNSM.2006.4798310}
}
|
||||||
| Kusic, D. and Kandasamy, N. and Guofei Jiang | Combined Power and Performance Management of Virtualized Computing Environments Serving Session-Based Workloads | 2011 | Network and Service Management, IEEE Transactions on Vol. 8(3), pp. 245 -258 |
power management , predictive control , resource provisioning , virtualization technologies | internet , approximation theory , large-scale systems , predictive control , virtual machines , virtualisation | DOI |
| Abstract: This paper develops an online resource provisioning framework for combined power and performance management in a virtualized computing environment serving session-based workloads. We pose this management problem as one of sequential optimization under uncertainty and solve it using limited lookahead control (LLC), a form of model-predictive control. The approach accounts for the switching costs incurred when provisioning virtual machines and explicitly encodes the risk of provisioning resources in an uncertain and dynamic operating environment. We experimentally validate the control framework on a server cluster supporting three online services. When managed using LLC, our cluster setup saves, on average, 41% in power-consumption costs over a twenty-four hour period when compared to a system operating without dynamic control. Finally, we use trace-based simulations to analyze LLC performance on server clusters larger than our testbed and show how concepts from approximation theory can be used to further reduce the computational burden of controlling large systems. | ||||||
BibTeX:
@article{5970245,
author = {Kusic, D. and Kandasamy, N. and Guofei Jiang},
title = {Combined Power and Performance Management of Virtualized Computing Environments Serving Session-Based Workloads},
journal = {Network and Service Management, IEEE Transactions on},
year = {2011},
volume = {8},
number = {3},
pages = {245 -258},
doi = {http://dx.doi.org/10.1109/TNSM.2011.0726.100045}
}
|
||||||
| Kin-Wah Kwong and Gue´ andrin, R. and Shaikh, A. and Shu Tao | Balancing performance, robustness and flexibility in routing systems | 2010 | Network and Service Management, IEEE Transactions on Vol. 7(3), pp. 186 -199 |
routing, optimization, robustness, multi-topology | telecommunication network routing , telecommunication network topology , telecommunication traffic | DOI |
| Abstract: Modern networks face the challenging task of handling increasingly diverse traffic that is displaying a growing intolerance to disruptions. This has given rise to many initiatives, and in this paper we focus on multiple topology routing as the primary vehicle for meeting those demands. Specifically, we seek routing solutions capable of not just accommodating different performance goals, but also preserving them in the presence of disruptions. The main challenge is computational, i.e., to identify among the enormous number of possible routing solutions the one that yields the best compromise between performance and robustness. This is where our principal contribution lies, as we expand the definition of critical links - a key concept in improving the efficiency of routing computation - and develop a precise methodology to efficiently converge on those solutions. Using this new methodology, we demonstrate that one can compute routing solutions that are both flexible in accommodating different performance requirements and robust in maintaining them in the presence of failures and traffic fluctuations. | ||||||
BibTeX:
@article{5560573,
author = {Kin-Wah Kwong and Gue´ andrin, R. and Shaikh, A. and Shu Tao},
title = {Balancing performance, robustness and flexibility in routing systems},
journal = {Network and Service Management, IEEE Transactions on},
year = {2010},
volume = {7},
number = {3},
pages = {186 -199},
doi = {http://dx.doi.org/10.1109/TNSM.2010.1009.I9P0355}
}
|
||||||
| Lahmadi, A. and Festor, O. | A Framework for Automated Exploit Prevention from Known Vulnerabilities in Voice over IP Services | 2012 | Network and Service Management, IEEE Transactions on Vol. 9(Early Access) |
exploit prevention systems , security , session initiation protocol , voice over ip , vulnerability management | DOI | |
| Abstract: We propose a prevention system for SIP-based networks which adopts a rule-based approach to build prevention specifications on SIP protocol activities that stop attacks exploiting an existing vulnerability before reaching their targets. Our approach innovates from existing solutions by making use of the contextual information of a vulnerability targeted by an attack to apply the prevention specification. Manually coding these prevention specifications is tedious and error-prone. Our method automatically infers prevention specifications by analyzing captured SIP exploit traffic. The detection engine uses an efficient method based on event graphs to match protocol activities against available prevention specifications. We describe the different components of our approach and show through an extended performance study of the implemented system its applicability to enterprise level VoIP protection. | ||||||
BibTeX:
@article{6138261,
author = {Lahmadi, A. and Festor, O.},
title = {A Framework for Automated Exploit Prevention from Known Vulnerabilities in Voice over IP Services},
journal = {Network and Service Management, IEEE Transactions on},
year = {2012},
volume = {9},
number = {Early Access},
doi = {http://dx.doi.org/10.1109/TNSM.2012.011812.110125}
}
|
||||||
| Lau, W. and Jha, S. | Failure-Oriented Path Restoration Algorithm for Survivable Networks | 2004 | Network and Service Management, IEEE Transactions on Vol. 1(1), pp. 11 -20 |
approximation algorithms , availability , bandwidth , heuristic algorithms , multiprotocol label switching , polynomials , protection , routing , telecommunication traffic , virtual private networks | DOI | |
| Abstract: In this article, a new polynomial-time approximation algorithm called Service Path Local Optimization (SPLO) is proposed for the online restoration problem. SPLO is shown to perform competitively with existing offline heuristics algorithm in terms of spare capacity. SPLO is designed for online computation where only one request is computed at any one time, and the decision making does not depend on future requests. The polynomial-time and online nature of the algorithm makes SPLO suitable for use in real-time on-demand path request applications. SPLO can be combined with a non-polynomial post-processing component that re-optimizes the backup paths. Significant reductions in spare capacity requirements are achievable at the expense of higher computation time. Further, the potential for SPLO as an algorithm in traffic engineering applications is investigated by looking at the performance impact when source-destination-based traffic aggregation is applied. We also introduce a new concept called path intermix where the service path¿s allocated bandwidth can be used by the backup paths protecting that particular service path. | ||||||
BibTeX:
@article{4623690,
author = {Lau, W. and Jha, S.},
title = {Failure-Oriented Path Restoration Algorithm for Survivable Networks},
journal = {Network and Service Management, IEEE Transactions on},
year = {2004},
volume = {1},
number = {1},
pages = {11 -20},
doi = {http://dx.doi.org/10.1109/TNSM.2004.4623690}
}
|
||||||
| Sihyung Lee and Hyong Kim | Correlation, visualization, and usability analysis of routing policy configurations | 2010 | Network and Service Management, IEEE Transactions on Vol. 7(1), pp. 28 -41 |
network management, network configuration modeling, usability analysis, correlation, visualization | computer networks , correlation methods , telecommunication network routing | DOI |
| Abstract: Network configurations implement a set of policies that control a network's behavior. Therefore, correct understanding of the configurations is vital to ensure that the network operates according to the intended policies. However, the current practice of manually reading a large number of configuration commands, which are written in low-level languages and distributed in multiple devices, is inefficient and significantly increases management costs and operator errors. We propose a system that helps decode network configurations by interpreting low-level fragmented configurations and then presenting their high-level intended policies. In particular, the proposed system is applicable to inter-domain routing policies, one of the most complex aspects of network configurations. We implement our system and evaluate its effectiveness through a set of user studies involving 44 participants. These studies examine the participants¿ comprehension of routing policies presented with our system as compared to those presented with existing configuration languages. The studies show that our system improves both accuracy, from 70% to nearly 100%, as well as time-to-task-completion, from 30 minutes to 10 minutes. We believe that our system provides a basis for a clean separation of policy intent from its implementation so that policies can be better designed and understood. We also discuss the weaknesses in usability of current network configurations and argue that all aspects of future management systems need to be designed to address these usability issues. | ||||||
BibTeX:
@article{5412871,
author = {Sihyung Lee and Hyong Kim},
title = {Correlation, visualization, and usability analysis of routing policy configurations},
journal = {Network and Service Management, IEEE Transactions on},
year = {2010},
volume = {7},
number = {1},
pages = {28 -41},
doi = {http://dx.doi.org/10.1109/TNSM.2010.I9P0315}
}
|
||||||
| Hong Li and Mason, L. and Rabbat, M. | Distributed adaptive diverse routing for voice-over-IP in service overlay networks | 2009 | Network and Service Management, IEEE Transactions on Vol. 6(3), pp. 175 -189 |
diverse routing, reinforcement learning, voice-over-ip, overlay networks. | internet telephony , adaptive systems , failure analysis , telecommunication links , telecommunication network routing | DOI |
| Abstract: This paper proposes a novel mechanism to discover delay-optimal diverse paths using distributed learning automata for Voice-over-IP (VoIP) routing in service overlay networks. In addition, a novel link failure detection method is proposed for detecting and recovering from link failures to reduce the number of dropped voice sessions. The main contributions of this paper are a decentralized, scalable method for minimizing delay on both a primary and secondary path between all pairs of overlay nodes, while at the same time maintaining the link disjointness between the primary and the secondary optimal paths. Simulations of a 50-node model of AT amp;T's backbone network show that the proposed method improves the quality of voice calls from unsatisfactory to satisfactory, as measured by the R-factor. With the proposed link failure detection mechanism, the time to recover from a link failure is considerably reduced. | ||||||
BibTeX:
@article{5374838,
author = {Hong Li and Mason, L. and Rabbat, M.},
title = {Distributed adaptive diverse routing for voice-over-IP in service overlay networks},
journal = {Network and Service Management, IEEE Transactions on},
year = {2009},
volume = {6},
number = {3},
pages = {175 -189},
doi = {http://dx.doi.org/10.1109/TNSM.2009.03.090304}
}
|
||||||
| Ma Lingjun and Pui-Sze Tsang and King-Shan Lui | Improving file distribution performance by grouping in peer-to-peer networks | 2009 | Network and Service Management, IEEE Transactions on Vol. 6(3), pp. 149 -162 |
peer-to-peer, grouping, file distribution. | client-server systems , file organisation , peer-to-peer computing , protocols , scheduling | DOI |
| Abstract: It has been shown that the peer-to-peer paradigm is more efficient than the traditional client-server model for file sharing among a large number of users. Given a group of leechers who wants to download a single file and a group of seeds who possesses the whole file, the minimum time needed for distributing the file to all users can be calculated based on their bandwidth availabilities. A scheduling algorithm has been developed so that every leecher can obtain the file within this minimum time. Unfortunately, this mechanism is not optimal with regard to the average download time among the peers. In this paper, we study how to reduce the average download time without prolonging the time needed for all leechers to obtain the file from a theoretical perspective. Based on the bandwidth capacities, the seeds and leechers are divided into different groups. We identify the necessary conditions for grouping to bring about benefits. We also study the impact on performance when leechers leave the system before the downloading process is complete. To evaluate our mechanism, we conduct extensive simulations and compare the performance with a BitTorrentlike file sharing algorithm. The results show that our grouping protocol successfully reduces the average download time over a wide range of system configurations. | ||||||
BibTeX:
@article{5374836,
author = {Ma Lingjun and Pui-Sze Tsang and King-Shan Lui},
title = {Improving file distribution performance by grouping in peer-to-peer networks},
journal = {Network and Service Management, IEEE Transactions on},
year = {2009},
volume = {6},
number = {3},
pages = {149 -162},
doi = {http://dx.doi.org/10.1109/TNSM.2009.03.090302}
}
|
||||||
| Xue Liu and Jin Heo and Lui Sha and Xiaoyun Zhu | Queueing-Model-Based Adaptive Control of Multi-Tiered Web Applications | 2008 | Network and Service Management, IEEE Transactions on Vol. 5(3), pp. 157 -167 |
e-commerce, web applications, dynamic resource allocations | internet , adaptive control , electronic commerce , online front-ends , queueing theory | DOI |
| Abstract: Web applications have been increasingly deployed on the Internet. How to effectively allocate system resources to meet the Service Level Objectives (SLOs) is a challenging problem for Web application providers. In this article, we propose a scheme for automated performance control of Web applications via dynamic resource allocations. The scheme uses a queueing model predictor and an online adaptive feedback loop that enforces admission control of the incoming requests to ensure the desired response time target is met. The proposed Queueing-Model-Based Adaptive Control approach combines both the modeling power of queueing theory and the self-tuning power of adaptive control. Therefore, it can handle both modeling inaccuracies and load disturbances in a better way. To evaluate the proposed approach, we built a multi-tiered Web application testbed with open-source components widely adopted in industry. Experimental studies conducted on the testbed demonstrated the effectiveness of the proposed scheme. | ||||||
BibTeX:
@article{4805132,
author = {Xue Liu and Jin Heo and Lui Sha and Xiaoyun Zhu},
title = {Queueing-Model-Based Adaptive Control of Multi-Tiered Web Applications},
journal = {Network and Service Management, IEEE Transactions on},
year = {2008},
volume = {5},
number = {3},
pages = {157 -167},
doi = {http://dx.doi.org/10.1109/TNSM.2009.031103}
}
|
||||||
| Hongbin Luo and Hongke Zhang and Yajuan Qin and Leung, V.C.M. | An Approach for Building Scalable Proxy Mobile IPv6 Domains | 2011 | Network and Service Management, IEEE Transactions on Vol. 8(3), pp. 176 -189 |
mobility management , proxy mobile ipv6 (pmipv6) , distributed hash table , robustness , scalability | ip networks , delays , mobility management (mobile radio) | DOI |
| Abstract: As a promising network-based mobility management method that does not require active participation of mobile nodes (MNs), Proxy Mobile IPv6 (PMIPv6) is attracting considerable attention among the telecommunication and Internet communities. It remains an open issue how to build a scalable PMIPv6 domain that is able to support a large number of MNs while keeping handover delays low. In this paper, we propose an approach for building Scalable And Robust PMIPv6 (SARP) domains. We propose that every mobility access gateway (MAG) in a SARP domain also functions as a local mobility anchor (LMA), and is organized into a virtual ring with all other MAGs. Consistent hashing is used to efficiently distribute the mapping between each MN and its LMA to all MAGs. A MAG finds an MN's LMA by sending a query message to the virtual ring. Our analysis verifies the robustness and scalability of SARP. We also propose two handover procedures for SARP and show that they achieve low handover delays. | ||||||
BibTeX:
@article{5962387,
author = {Hongbin Luo and Hongke Zhang and Yajuan Qin and Leung, V.C.M.},
title = {An Approach for Building Scalable Proxy Mobile IPv6 Domains},
journal = {Network and Service Management, IEEE Transactions on},
year = {2011},
volume = {8},
number = {3},
pages = {176 -189},
doi = {http://dx.doi.org/10.1109/TNSM.2011.071511.20100063}
}
|
||||||
| Jing Luo and Ying Li and Pershing, J. and Lei Xie and Ying Chen | A methodology for analyzing availability weak points in SOA deployment frameworks | 2009 | Network and Service Management, IEEE Transactions on Vol. 6(1), pp. 31 -44 |
availability, soa, workflow analysis, deployment optimization. | business data processing , software architecture , workflow management software | DOI |
| Abstract: The fundamental characteristics of SOA, loose coupling and on-demand integration, enable organizations to seek more flexibility and responsiveness from their business IT systems. However, this brings challenges to assure QoS, especially availability, which should be considered in an integrated way in an SOA environment. Traditionally, availability is measured for each IT resource, but within SOA environments, rather than being considered individually, availability should be analyzed from an end-to-end view from both business and IT perspectives. In this paper, to address the availability problem of SOA, we propose a methodology that analyzes availability weak points in SOA deployment frameworks, leveraging workflow definitions that specify availability requirements at business level. This methodology includes an effective way to calculate high availability enhancement recommendations for a given SOA deployment topology with near-minimum cost, while meeting the business-level availability requirements. A prototype has been implemented as an extension to IBM's SOA deployment framework. Its efficiency and performance are analyzed here. | ||||||
BibTeX:
@article{5331279,
author = {Jing Luo and Ying Li and Pershing, J. and Lei Xie and Ying Chen},
title = {A methodology for analyzing availability weak points in SOA deployment frameworks},
journal = {Network and Service Management, IEEE Transactions on},
year = {2009},
volume = {6},
number = {1},
pages = {31 -44},
doi = {http://dx.doi.org/10.1109/TNSM.2009.090303}
}
|
||||||
| Macedo, D. and Dos Santos, A. and Nogueira, J.M.S. and Pujolle, G. | A distributed information repository for autonomic context-aware MANETs | 2009 | Network and Service Management, IEEE Transactions on Vol. 6(1), pp. 45 -55 |
ad hoc networks, autonomic management, context awareness, cross-layering | ad hoc networks , middleware , mobile computing , peer-to-peer computing , protocols | DOI |
| Abstract: Due to the emergence of multimedia context-rich applications and services over wireless networks, networking protocols and services are becoming more and more integrated, thus relying on context and application information to support their operation. Further, wireless protocols and services now employ information from several network layers and the environment, breaking the layering paradigm. In order to cope with this increasing reliance on information, we have proposed MANIP, a middleware for MANETs that instantiates a new networking plane. The Information Plane (InP) is a distributed entity to store and disseminate information concerning the network, its services and the environment, orchestrating the collaboration among cross-layer protocols, autonomic management solutions and context-aware services. We use MANIP to support the autonomic reconfiguration of a P2P network over MANETs. Simulation results show that the MANIP-enabled solutions reduce the response time and increase the number of solved P2P queries when compared to classic, cross-layer implementations of the same protocols. | ||||||
BibTeX:
@article{5331280,
author = {Macedo, D. and Dos Santos, A. and Nogueira, J.M.S. and Pujolle, G.},
title = {A distributed information repository for autonomic context-aware MANETs},
journal = {Network and Service Management, IEEE Transactions on},
year = {2009},
volume = {6},
number = {1},
pages = {45 -55},
doi = {http://dx.doi.org/10.1109/TNSM.2009.090304}
}
|
||||||
| Malatras, A. and Pavlou, G. and Sivavakeesar, S. | A Programmable Framework for the Deployment of Services and Protocols in Mobile Ad Hoc Networks | 2007 | Network and Service Management, IEEE Transactions on Vol. 4(3), pp. 12 -24 |
ad hoc networks , analytical models , context-aware services , mobile ad hoc networks , network topology , quality of service , routing protocols , software safety , wireless application protocol , wireless networks | ad hoc networks , mobile radio , protocols | DOI |
| Abstract: Mobile ad hoc networks (MANETs) are characterized by their heterogeneity and the diverse capabilities of their nodes given that almost any device with a wireless network interface can join such a network. In such an environment it is difficult to dynamically deploy services and protocols without a common understanding among the participating nodes and their capabilities. A deployment/provisioning framework must cope with the high-level of device heterogeneity, degree of mobility, and should also take into account the potentially limited device resources. This paper presents a context-based programmable framework for dynamic service/protocol deployment that allows the nodes of a mobile ad hoc network to download and safely activate required service/protocol software dynamically. Downloading and activation can be triggered through preconditions evaluated according to available contextual information. This strategy leads to the alignment of the nodes' capabilities so that common services and protocols can be deployed even if they are not available at every node. In addition, dynamic context-driven deployment may lead to a degree of network self-optimization. We present the programmable framework and functionality and evaluate its various aspects through testbed experimentation, simulation and analytical modeling. The results demonstrate good performance with respect to the supported functionality. | ||||||
BibTeX:
@article{4489644,
author = {Malatras, A. and Pavlou, G. and Sivavakeesar, S.},
title = {A Programmable Framework for the Deployment of Services and Protocols in Mobile Ad Hoc Networks},
journal = {Network and Service Management, IEEE Transactions on},
year = {2007},
volume = {4},
number = {3},
pages = {12 -24},
doi = {http://dx.doi.org/10.1109/tnsm.2007.021108}
}
|
||||||
| Marchetto, G. and Ciminiera, L. and Manzillo, M.P. and Risso, F. and Torrero, L. | Locating Equivalent Servants over P2P Networks | 2011 | Network and Service Management, IEEE Transactions on Vol. 8(1), pp. 65 -78 |
distributed services , equivalent servants , peer-to-peer overlays , scale-free topology | internet , peer-to-peer computing , telecommunication network topology | DOI |
| Abstract: While peer-to-peer networks are mainly used to locate unique resources across the Internet, new interesting deployment scenarios are emerging. Particularly, some applications (e.g., VoIP) are proposing the creation of overlays for the localization of services based on equivalent servants (e.g., voice relays). This paper explores the possible overlay architectures that can be adopted to provide such services, showing how an unstructured solution based on a scale-free overlay topology is an effective option to deploy in this context. Consequently, we propose EQUATOR (EQUivalent servAnt locaTOR), an unstructured overlay implementing the above mentioned operating principles, based on an overlay construction algorithm that well approximates an ideal scale-free construction model. We present both analytical and simulation results which support our overlay topology selection and validate the proposed architecture. | ||||||
BibTeX:
@article{5702354,
author = {Marchetto, G. and Ciminiera, L. and Manzillo, M.P. and Risso, F. and Torrero, L.},
title = {Locating Equivalent Servants over P2P Networks},
journal = {Network and Service Management, IEEE Transactions on},
year = {2011},
volume = {8},
number = {1},
pages = {65 -78},
doi = {http://dx.doi.org/10.1109/TNSM.2011.012111.00013}
}
|
||||||
| Mi, N. and Casale, G. and Smirni, E. | ASIdE: Using Autocorrelation-Based Size Estimation for Scheduling Bursty Workloads | 2012 | Network and Service Management, IEEE Transactions on Vol. 9(Early Access) |
fcfs scheduling , sjf scheduling , temporal dependence , delay-based scheduling , no-knowledge scheduling | DOI | |
| Abstract: Temporal dependence in workloads creates peak congestion that can make service unavailable and reduce system performance. To improve system performability under conditions of temporal dependence, a server should quickly process bursts of requests that may need large service demands. In this paper, we propose and evaluate ASIdE, an Autocorrelation-based SIze Estimation, that selectively delays requests which contribute to the workload temporal dependence. ASIdE implicitly approximates the shortest job first (SJF) scheduling policy but without any prior knowledge of job service times. Extensive experiments show that (1) ASIdE achieves good service time estimates from the temporal dependence structure of the workload to implicitly approximate the behavior of SJF; and (2) ASIdE successfully counteracts peak congestion in the workload and improves system performability under a wide variety of settings. Specifically, we show that system capacity under ASIdE is largely increased compared to the first-come first-served (FCFS) scheduling policy and is highly-competitive with SJF. | ||||||
BibTeX:
@article{6189000,
author = {Mi, N. and Casale, G. and Smirni, E.},
title = {ASIdE: Using Autocorrelation-Based Size Estimation for Scheduling Bursty Workloads},
journal = {Network and Service Management, IEEE Transactions on},
year = {2012},
volume = {9},
number = {Early Access},
doi = {http://dx.doi.org/10.1109/TNSM.2012.041712.100073}
}
|
||||||
| Misherghi, G. and Lihua Yuan and Zhendong Su and Chen-Nee Chuah and Hao Chen | A general framework for benchmarking firewall optimization techniques | 2008 | Network and Service Management, IEEE Transactions on Vol. 5(4), pp. 227 -238 |
firewall optimization, acl optimization, firewall management, acl partitioning | authorisation , benchmark testing , computer networks , integer programming , telecommunication security , ubiquitous computing | DOI |
| Abstract: Firewalls are among the most pervasive network security mechanisms, deployed extensively from the borders of networks to end systems. The complexity of modern firewall policies has raised the computational requirements for firewall implementations, potentially limiting the throughput of networks. Administrators currently rely on ad hoc solutions to firewall optimization. To address this problem, a few automatic firewall optimization techniques have been proposed, but there has been no general approach to evaluate the optimality of these techniques. In this paper we present a general framework for rule-based firewall optimization. We give a precise formulation of firewall optimization as an integer programming problem and show that our framework produces optimal reordered rule sets that are semantically equivalent to the original rule set. Our framework considers the complex interactions among the rules in firewall configurations and relies on a novel partitioning of the packet space defined by the rules themselves. For validation, we employ this framework on real firewall rule sets for a quantitative evaluation of existing heuristic approaches. Our results indicate that the framework is general and faithfully captures performance benefits of firewall optimization heuristics. | ||||||
BibTeX:
@article{5010446,
author = {Misherghi, G. and Lihua Yuan and Zhendong Su and Chen-Nee Chuah and Hao Chen},
title = {A general framework for benchmarking firewall optimization techniques},
journal = {Network and Service Management, IEEE Transactions on},
year = {2008},
volume = {5},
number = {4},
pages = {227 -238},
doi = {http://dx.doi.org/10.1109/TNSM.2009.041104}
}
|
||||||
| Misra, S. and Rohith Mohan, S.V. and Choudhuri, R. | A probabilistic approach to minimize the conjunctive costs of node replacement and performance loss in the management of wireless sensor networks | 2010 | Network and Service Management, IEEE Transactions on Vol. 7(2), pp. 107 -117 |
wireless sensor networks, markov decision processes, maintenance. | markov processes , telecommunication network management , wireless sensor networks | DOI |
| Abstract: In this paper, we consider a sensor network with either node replacement or battery replacement as the maintenance operation. We address the problem of how the failed nodes are to be replaced, in order to obtain a desirable tradeoff between maintenance cost and network performance, in the management of the network. Since node replacement and battery replacement are analytically identical, we solve this problem only for the network, where the maintenance operation is node replacement. We do this by converting performance loss into cost terms and minimizing the summation of node replacement costs and performance loss costs. We use Markov decision processes (MDP) to develop a probabilistic approach in order to estimate the longrun cost of the network. For this we use statistical data based on the past behaviour of the network. We also propose an algorithm to determine the optimal node-replacement policy. The longrun node replacement cost and the longrun performance loss cost of the simulated network are found to be theoretically consistent. | ||||||
BibTeX:
@article{5471041,
author = {Misra, S. and Rohith Mohan, S.V. and Choudhuri, R.},
title = {A probabilistic approach to minimize the conjunctive costs of node replacement and performance loss in the management of wireless sensor networks},
journal = {Network and Service Management, IEEE Transactions on},
year = {2010},
volume = {7},
number = {2},
pages = {107 -117},
doi = {http://dx.doi.org/10.1109/TNSM.2010.06.I9P0319}
}
|
||||||
| Morales, R. and Monnet, S. and Gupta, I. and Antoniu, G. | MOve: Design and Evaluation of a Malleable Overlay for Group-Based Applications | 2007 | Network and Service Management, IEEE Transactions on Vol. 4(2), pp. 107 -116 |
collaboration , collaborative work , communication system control , engineering profession , fault tolerance , internet , large-scale systems , peer to peer computing , resource management , scalability | fault tolerant computing , groupware , peer-to-peer computing , resource allocation | DOI |
| Abstract: While peer-to-peer overlays allow distributed applications to scale and tolerate failures, most structured and unstructured overlays in literature today are inflexible from the application viewpoint. The application thus has no first-class control on the overlay structure. This paper proposes the concept of an application-malleable overlay, and the design of the first malleable overlay which we call MOve. MOve is targeted at group- based applications, e.g., collaborative applications. In MOve, the communication characteristics of the distributed application using the overlay can influence the overlay's structure itself, with the twin goals of (1) optimizing the application performance by adapting the overlay, while also (2) retaining the large scale and fault tolerance of the overlay approach. Besides neighbor list membership management, MOve also contains algorithms for resource discovery, update propagation, and churn-resistance. The emergent behavior of the implicit mechanisms used in MOve manifests as follows: when application communication is low, most overlay links keep their default configuration; however, as application communication characteristics become more evident, the overlay gracefully adapts itself to the application. We validate MOve using simulations with group sizes that are fixed, uniform, exponential and PlanetLab-based (slices), as well as churn traces and two sample management-based applications. | ||||||
BibTeX:
@article{4383312,
author = {Morales, R. and Monnet, S. and Gupta, I. and Antoniu, G.},
title = {MOve: Design and Evaluation of a Malleable Overlay for Group-Based Applications},
journal = {Network and Service Management, IEEE Transactions on},
year = {2007},
volume = {4},
number = {2},
pages = {107 -116},
doi = {http://dx.doi.org/10.1109/TNSM.2007.070903}
}
|
||||||
| Muntean, Gabriel-Miro and Perry, Philip and Murphy, Liam | Objective and subjective evaluation of QOAS video streaming over broadband networks | 2005 | Network and Service Management, IEEE Transactions on Vol. 2(1), pp. 19 -28 |
bandwidth , broadband communication , engineering management , ip networks , multimedia systems , multiprotocol label switching , quality of service , streaming media , telecommunication traffic , testing | DOI | |
| Abstract: This article presents objective and subjective testing results that assess the performance of the Quality-Oriented Adaptation Scheme (QOAS) when used for high quality multimedia streaming over local broadband IP networks. Results of objective tests using a QOAS simulation model show very efficient adaptation in terms of end-user perceived quality, loss rate, and bandwidth utilization, compared to existing adaptive streaming schemes such as LDA+, and TFRCP. Subjective tests confirm these results by showing high end-user perceived quality of the QOAS under various network conditions. | ||||||
BibTeX:
@article{4798298,
author = {Muntean, Gabriel-Miro and Perry, Philip and Murphy, Liam},
title = {Objective and subjective evaluation of QOAS video streaming over broadband networks},
journal = {Network and Service Management, IEEE Transactions on},
year = {2005},
volume = {2},
number = {1},
pages = {19 -28},
doi = {http://dx.doi.org/10.1109/TNSM.2005.4798298}
}
|
||||||
| Nayak, T. and Neogi, A. and Kothari, R. | Visualization and Analysis of System Monitoring Data using Multi-resolution Context Information | 2008 | Network and Service Management, IEEE Transactions on Vol. 5(3), pp. 168 -177 |
systems management, self-organizing feature map, visualization | data analysis , data visualisation | DOI |
| Abstract: Projection of high dimensional data into a lower dimensional subspace is required for human understanding of the health of an IT infrastructure. Over the past several years, there have been a large number of dimensionality reduction techniques that have been proposed. Their direct application for visualizing system monitoring data is challenged by two factors. First, system monitoring data does not lie in a metric space. Second, system monitoring data is intrinsically iquestmulti-resolutioniquest in that an event may lead to cascaded events (a server going down impacts one or more applications running on the server; a network outage may impact several network dependent components). Lower dimensional representations which do not take into account the intrinsic multi-resolution nature of the monitoring data are thus limited in their utility and challenge human comprehension. In this paper, we exploit the multi-resolution nature of the monitoring data and a 1-of-n representation of event data to construct navigable multi-resolution topology preserving views for visualizing system monitoring data. We also demonstrate the efficacy of the proposed approach using data from a real data center. | ||||||
BibTeX:
@article{4805133,
author = {Nayak, T. and Neogi, A. and Kothari, R.},
title = {Visualization and Analysis of System Monitoring Data using Multi-resolution Context Information},
journal = {Network and Service Management, IEEE Transactions on},
year = {2008},
volume = {5},
number = {3},
pages = {168 -177},
doi = {http://dx.doi.org/10.1109/TNSM.2009.031104}
}
|
||||||
| Nogueira, M. and Silva, H. and Santos, A. and Pujolle, G. | A Security Management Architecture for Supporting Routing Services on WANETs | 2012 | Network and Service Management, IEEE Transactions on Vol. 9(Early Access) |
security management , routing , survivability , wireless ad hoc networks | DOI | |
| Abstract: Due to the raising dependence of people on critical applications and wireless networks, high level of reliability, security and availability is claimed to assure secure and reliable service operation. Wireless ad hoc networks (WANETs) experience serious security issues even when solutions employ preventive or reactive security mechanisms. In order to support both network operations and security requirements of critical applications, we present SAMNAR, a Survivable Ad hoc and Mesh Network ARchitecture. Its goal lies in managing adaptively preventive, reactive and tolerant security mechanisms to provide essential services even under attacks, intrusions or failures. We use SAMNAR to design a path selection scheme for WANET routing. The evaluation of this path selection scheme considers scenarios using urban mesh network mobility with urban propagation models, and also random way point mobility with two-ray ground propagation models. Results show the survivability achieved on routing service under different conditions and attacks. | ||||||
BibTeX:
@article{6138265,
author = {Nogueira, M. and Silva, H. and Santos, A. and Pujolle, G.},
title = {A Security Management Architecture for Supporting Routing Services on WANETs},
journal = {Network and Service Management, IEEE Transactions on},
year = {2012},
volume = {9},
number = {Early Access},
doi = {http://dx.doi.org/10.1109/TNSM.2012.011812.100071}
}
|
||||||
| Oida, K. | Detecting suspended video streams through variance-time analysis | 2009 | Network and Service Management, IEEE Transactions on Vol. 6(1), pp. 56 -63 |
suspension detection, video stream, variancetime-plot, internet traffic analysis | internet , telecommunication traffic , time series , video streaming | DOI |
| Abstract: To detect suspended video streams, an algorithm is proposed which analyzes traffic data to sense changes in variances. The objective of the algorithm is to help restart suspended streams as quickly as possible in cooperation with network administrators, mechanisms to change routes, etc. The algorithm handles traffic data of a number of streams all together to detect one or more suspended streams without using the information on the number of streams and on each stream's data rate. It works with the same parameter values for both LAN and WAN traffic streams, even if their packet interarrival-time distributions are different. Experiments with 41 live TV streams showed that suspension is detectable when the traffic rate decrease caused by the suspension is 1.6%. | ||||||
BibTeX:
@article{5331281,
author = {Oida, K.},
title = {Detecting suspended video streams through variance-time analysis},
journal = {Network and Service Management, IEEE Transactions on},
year = {2009},
volume = {6},
number = {1},
pages = {56 -63},
doi = {http://dx.doi.org/10.1109/TNSM.2009.090305}
}
|
||||||
| Pezaros, D.P. and Hoerdt, M. and Hutchison, D. | Low-Overhead End-to-End Performance Measurement for Next Generation Networks | 2011 | Network and Service Management, IEEE Transactions on Vol. 8(1), pp. 1 -14 |
computer instrumentation , computer networks , computer performance , network measurement , next generation networking | ip networks , internet , computer network performance evaluation , telecommunication traffic | DOI |
| Abstract: Internet performance measurement is commonly perceived as a high-cost control-plane activity and until now it has tended to be implemented on top of the network's forwarding operation. Consequently, measurement mechanisms have often had to trade relevance and accuracy over non-intrusiveness and cost effectiveness. In this paper, we present the software implementation of an in-line measurement mechanism that uses native structures of the Internet Protocol version 6 (IPv6) stack to piggyback measurement information on data-carrying traffic as this is routed between two points in the network. We carefully examine the overhead associated with both the measurement process and the measurement data, and we demonstrate that direct two-point measurement has minimal impact on throughput and on system processing load. The results of this paper show that adequately engineered measurement mechanisms that exploit selective processing do not compromise the network's forwarding efficiency, and can be deployed in an always-on manner to reveal the true performance of network traffic over small timescales. | ||||||
BibTeX:
@article{5741009,
author = {Pezaros, D.P. and Hoerdt, M. and Hutchison, D.},
title = {Low-Overhead End-to-End Performance Measurement for Next Generation Networks},
journal = {Network and Service Management, IEEE Transactions on},
year = {2011},
volume = {8},
number = {1},
pages = {1 -14},
doi = {http://dx.doi.org/10.1109/TNSM.2011.032311.090369}
}
|
||||||
| Polito, S.G. and Zaghloul, S. and Chamania, M. and Jukan, A. | Inter-Domain Path Provisioning with Security Features: Architecture and Signaling Performance | 2011 | Network and Service Management, IEEE Transactions on Vol. 8(3), pp. 219 -233 |
aaa , diameter , pce , rsvp , connection-oriented networks , inter-domain routing , peering agreements | authorisation , computer network security | DOI |
| Abstract: Significant research and standardization efforts are underway to enable automated computation and reservation of connection-oriented paths (circuits) across multiple domains. In the absence of a secure authentication and authorization mechanism, however, carriers continue to provision connections manually, which leads to large setup delays and increases possibility of configuration errors. Carriers also lack mechanisms to meter connection quality during the service lifetime and typically do not exchange accounting information for established connections for auditing and billing purposes. In this paper, we address the challenge for automatic multi-domain path provisioning with authentication, authorization and accounting (AAA) capabilities in carrier-grade transport networks. The designed solution secures computation and reservation for path provisioning and also leverages a standard accounting model which incorporates the accounting signaling for an inter-domain connection. In order to evaluate the impact of the proposed framework on signaling performance, we also provide an analytical framework scalable to large inter-domain network scenarios. We verify the analysis using event-driven simulations and then use this analytical model to quantify the feasibility of our model in terms of signaling load and signaling delay for a wide range of network scenarios. | ||||||
BibTeX:
@article{6009142,
author = {Polito, S.G. and Zaghloul, S. and Chamania, M. and Jukan, A.},
title = {Inter-Domain Path Provisioning with Security Features: Architecture and Signaling Performance},
journal = {Network and Service Management, IEEE Transactions on},
year = {2011},
volume = {8},
number = {3},
pages = {219 -233},
doi = {http://dx.doi.org/10.1109/TCOMM.2011.072611.100047}
}
|
||||||
| Pongthawornkamol, T. and Gupta, I. | AVCast: New Approaches for Implementing Generic Availability-Dependent Reliability Predicates for Multicast Receivers | 2007 | Network and Service Management, IEEE Transactions on Vol. 4(2), pp. 117 -126 |
algorithm design and analysis , availability , large-scale systems , monitoring , multicast algorithms , multicast protocols , peer to peer computing , publish-subscribe , streaming media , switches | message passing , multicast communication , protocols , radio receivers , reliability | DOI |
| Abstract: Today's large-scale distributed systems consist of collections of nodes, each of which has its own availability characteristics - a phenomenon sometimes called churn. This availability variation across nodes is often a hindrance to achieving reliability and performance for distributed applications such as multicast. This paper looks into utilizing and leveraging availability information in order to implement arbitrary predicates that specify availability-dependent message reliability for multicast receivers. An application (e.g., a publish-subscribe system) may want to scale the multicast message reliability at each receiver according to that receiver's availability (in terms of the fraction of time that receiver is online) - different options are that the reliability is independent of the availability, proportional to it, or an arbitrary function of it, etc. We propose several gossip- based algorithms to support an arbitrary class of such predicates. These techniques rely on each node's availability being monitored in a distributed manner by a small group of other nodes in such a way that the monitoring load is evenly distributed in the system. Our techniques are light-weight, scalable, and are space- and time- efficient. We analyze our algorithms and evaluate them experimentally by injecting availability traces collected from real peer-to-peer systems. | ||||||
BibTeX:
@article{4383313,
author = {Pongthawornkamol, T. and Gupta, I.},
title = {AVCast: New Approaches for Implementing Generic Availability-Dependent Reliability Predicates for Multicast Receivers},
journal = {Network and Service Management, IEEE Transactions on},
year = {2007},
volume = {4},
number = {2},
pages = {117 -126},
doi = {http://dx.doi.org/10.1109/TNSM.2007.070902}
}
|
||||||
| Pras, Aiko and Drevers, Thomas and van de Meent, Remco and Quartel, Dick | Comparing the performance of SNMP and Web services-based management | 2004 | Network and Service Management, IEEE Transactions on Vol. 1(2), pp. 72 -82 |
ber , cpu time , snmp , web services , xml , bandwidth usage , compression , iftable , memory consumption , performance , round trip delay | DOI | |
| Abstract: This paper compares the performance of Web services based network monitoring to traditional, SNMP based, monitoring. The study focuses on the ifTable, and investigates performance as function of the number of retrieved objects. The following aspects are examined: bandwidth usage, CPU time, memory consumption and round trip delay. For our study several prototypes of Web services based agents were implemented; these prototypes can retrieve single ifTable elements, ifTable rows, ifTable columns or the entire ifTable. This paper presents a generic formula to calculate SNMP's bandwidth requirements; the bandwidth consumption of our prototypes was compared to that formula. The CPU time, memory consumption and round trip delay of our prototypes was compared to Net-SNMP, as well as several other SNMP agents. Our measurements show that SNMP is more efficient in cases where only a single object is retrieved; for larger number of objects Web services may be more efficient. Our study also shows that, if performance is the issue, the choice between BER (SNMP) or XML (Web services) encoding is generally not the determining factor; other choices can have stronger impact on performance. | ||||||
BibTeX:
@article{4798292,
author = {Pras, Aiko and Drevers, Thomas and van de Meent, Remco and Quartel, Dick},
title = {Comparing the performance of SNMP and Web services-based management},
journal = {Network and Service Management, IEEE Transactions on},
year = {2004},
volume = {1},
number = {2},
pages = {72 -82},
doi = {http://dx.doi.org/10.1109/TNSM.2004.4798292}
}
|
||||||
| Prieto, A.G. and Stadler, R. | A-GAP: An Adaptive Protocol for Continuous Network Monitoring with Accuracy Objectives | 2007 | Network and Service Management, IEEE Transactions on Vol. 4(1), pp. 2 -12 |
computer networks , counting circuits , estimation error , filters , monitoring , network topology , protocols , robustness , scalability , stochastic processes | error statistics , estimation theory , protocols , stochastic processes , telecommunication network management , telecommunication network reliability , trees (mathematics) | DOI |
| Abstract: We present A-GAP, a novel protocol for continuous monitoring of network state variables, which aims at achieving a given monitoring accuracy with minimal overhead. Network state variables are computed from device counters using aggregation functions, such as SUM, AVERAGE and MAX. The accuracy objective is expressed as the average estimation error. 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 and two different types of topologies of up to 650 nodes. The results show that we can effectively control the trade-off between accuracy and protocol overhead, and that the overhead can be reduced by almost two orders of magnitude when allowing for small errors. The protocol quickly adapts to a node failure and exhibits short spikes in the estimation error. Lastly, it can provide an accurate estimate of the error distribution in real-time. | ||||||
BibTeX:
@article{4275030,
author = {Prieto, A.G. and Stadler, R.},
title = {A-GAP: An Adaptive Protocol for Continuous Network Monitoring with Accuracy Objectives},
journal = {Network and Service Management, IEEE Transactions on},
year = {2007},
volume = {4},
number = {1},
pages = {2 -12},
doi = {http://dx.doi.org/10.1109/TNSM.2007.030101}
}
|
||||||
| Haiyang Qian and Dispensa, S. and Medhi, D. | Balancing Request Denial Probability and Latency in an Agent-Based VPN Architecture | 2010 | Network and Service Management, IEEE Transactions on Vol. 7(4), pp. 282 -295 |
poisson and non-poisson arrival , request denial probability , agent-based vpn , finite and infinite population models , latency | bandwidth allocation , internetworking , multi-agent systems , network servers , probability , telecommunication traffic , virtual private networks | DOI |
| Abstract: Agent-based virtual private networks architecture (ABVA) refers to the environment where a third-party provider runs and administers remote access virtual private network (VPN) service for organizations that do not want to maintain their own in-house VPN servers. In this paper, we consider the problem of optimally connecting users of an organization to VPN server locations in an ABVA environment so that request denial probability and latency are balanced. A user request needs a certain bandwidth between the user and the VPN server. The VPN server may deny requests when the bandwidth is insufficient (capacity limitation). At the same time, the latency perceived by a user from its current location to a VPN server is an important consideration. We present a number of schemes regarding how VPN servers are to be selected and the number of servers to be tried so that request denial probability is minimized without unduly affecting latency. These schemes are studied on a number of different topologies. For our study, we consider Poisson and non-Poisson arrival of requests under both finite and infinite population models to understand the impact on the entire system. We found that the arrival processes have a significant and consistent impact on the request denial probability and the impact on the latency is dependent on the traffic load in the infinite model. In the finite model, arrival processes have an inconsistent impact to the request denial probability. As to the latency in the finite model, arrivals that have a squared co-efficient of variation less than one is consistently largest, followed by the Poisson case, then the case that the squared co-efficient of variation is more than one. Finally, a strength of this work is the comparison of infinite and finite models; we found that a mismatch between the infinite and the finite model is dependent both on the number of users in the system and the load. | ||||||
BibTeX:
@article{5668983,
author = {Haiyang Qian and Dispensa, S. and Medhi, D.},
title = {Balancing Request Denial Probability and Latency in an Agent-Based VPN Architecture},
journal = {Network and Service Management, IEEE Transactions on},
year = {2010},
volume = {7},
number = {4},
pages = {282 -295},
doi = {http://dx.doi.org/10.1109/TNSM.2010.1012.100103}
}
|
||||||
| Racz, P. and Stiller, B. | IP flow accounting application for diameter | 2008 | Network and Service Management, IEEE Transactions on Vol. 5(4), pp. 239 -246 |
flow accounting, diameter, ipfix | ip networks , authorisation , message authentication , open systems , protocols | DOI |
| Abstract: Flow accounting in IP networks is used by network operators for various purposes, such as network management, traffic management, or traffic analysis. In order to integrate flow accounting into an Authentication, Authorization, and Accounting (AAA) infrastructure, this work designs and evaluates an accounting extension to the Diameter protocol - termed Diameter IP Flow Accounting (IPFA) application - in support of the efficient transfer of IP flow records. The new Diameter IPFA application has been implemented as a prototype and its evaluation shows that it achieves a better performance for the transfer of IP flow records than the traditional Diameter accounting approach. | ||||||
BibTeX:
@article{5010447,
author = {Racz, P. and Stiller, B.},
title = {IP flow accounting application for diameter},
journal = {Network and Service Management, IEEE Transactions on},
year = {2008},
volume = {5},
number = {4},
pages = {239 -246},
doi = {http://dx.doi.org/10.1109/TNSM.2009.041105}
}
|
||||||
| Rao, Sudarshan | Operational Fault Detection in cellular wireless base-stations | 2006 | Network and Service Management, IEEE Transactions on Vol. 3(2), pp. 1 -11 |
statistical fault detection , base-stations , cellular , learning , static and adaptive thresholds , training , wireless | DOI | |
| Abstract: The goal of this work is to improve availability of operational base-stations in a wireless mobile network through non-intrusive fault detection methods. Since revenue is generated only when actual customer calls are processed, we develop a scheme to minimize revenue loss by monitoring real-time mobile user call processing activity. The mobile user call load profile experienced by a base-station displays a highly non-stationary temporal behavior with time-of-day, day-of-the-week and time-of-year variations. In addition, the geographic location also impacts the traffic profile, making each base-station have its own unique traffic patterns. A hierarchical base-station fault monitoring and detection scheme has been implemented in an IS-95 CDMA Cellular network that can detect faults at - base station level, sector level, carrier level, and channel level. A statistical hypothesis test framework, based on a combination of parametric, semi-parametric and non-parametric test statistics are defined for determining faults. The fault or alarm thresholds are determined by learning expected deviations during a training phase. Additionally, fault thresholds have to adapt to spatial and temporal mobile traffic patterns that slowly changes with seasonal traffic drifts over time and increasing penetration of mobile user density. Feedback mechanisms are provided for threshold adaptation and self-management, which includes automatic recovery actions and software reconfiguration. We call this method, Operational Fault Detection (OFD). We describe the operation of a few select features from a large family of OFD features in Base Stations; summarize the algorithms, their performance and comment on future work. | ||||||
BibTeX:
@article{4798311,
author = {Rao, Sudarshan},
title = {Operational Fault Detection in cellular wireless base-stations},
journal = {Network and Service Management, IEEE Transactions on},
year = {2006},
volume = {3},
number = {2},
pages = {1 -11},
doi = {http://dx.doi.org/10.1109/TNSM.2006.4798311}
}
|
||||||
| Reali, G. and Monacelli, L. | Definition and performance evaluation of a fault localization technique for an NGN IMS network | 2009 | Network and Service Management, IEEE Transactions on Vol. 6(2), pp. 122 -136 |
codebook, fault localization, network management, performance analysis | internet telephony , computer network management , fault location , multimedia communication , optimisation | DOI |
| Abstract: Fault Localization (FL) is a critical task for operators in the context of e-TOM (enhanced Telecom Operations Map) assurance process, in order to reduce network maintenance costs and improve availability, reliability, and performance of network services. This paper investigates, in a practical perspective, the use of a well known FL technique, named codebook technique, for the IMS control layer of a real Next Generation Network, deploying wireline VoIP and advanced communication services. Moreover, we propose some heuristics to generate optimal codebooks, i.e. to find the minimum set of symptoms (alarms) to be monitored in order to obtain the desired level of robustness to spurious or missing alarms and modelling errors in the root cause detection, and we evaluate their performance through extensive simulations. Finally, we provide a list of some practical Key Performance Indicators, the value of which is compared against specific thresholds. When a threshold is exceeded, an alarm is generated and used by the FL processing. | ||||||
BibTeX:
@article{5374832,
author = {Reali, G. and Monacelli, L.},
title = {Definition and performance evaluation of a fault localization technique for an NGN IMS network},
journal = {Network and Service Management, IEEE Transactions on},
year = {2009},
volume = {6},
number = {2},
pages = {122 -136},
doi = {http://dx.doi.org/10.1109/TNSM.2009.090605}
}
|
||||||
| Ricciato, F. and Hasenleithner, E. and Romirer-Maierhofer, P. | Traffic analysis at short time-scales: an empirical case study from a 3G cellular network | 2008 | Network and Service Management, IEEE Transactions on Vol. 5(1), pp. 11 -21 |
aggregates , availability , cellular networks , delay effects , ip networks , land mobile radio cellular systems , microscopy , pattern analysis , statistics , telecommunication traffic | 3g mobile communication , cellular radio , statistical analysis , synchronisation , telecommunication network reliability , telecommunication traffic | DOI |
| Abstract: The availability of synchronized packet-level traces captured at different links allows the extraction of one-way delays for the network section in between. Delay statistics can be used as quality indicators to validate the health of the network and to detect global performance drifts and/or localized problems. Since packet delays depend not only on the network status but also on the arriving traffic rate, the delay analysis must be coupled with the analysis of the traffic patterns at short time scales. In this work we report on the traffic and delay patterns observed at short timescales in a 3G cellular mobile network. We show that the aggregate traffic rate exhibits large impulses and investigate on their causes. Specifically, we find that high- rate sequential scanners represent a common source of traffic impulses, and identify the potential consequences of such traffic onto the underlying network. This case-study demonstrates that the microscopic analysis of delay and traffic patterns at short time-scales can contribute effectively to the task of troubleshooting IP networks. This is particularly important in the context of 3G cellular networks given their complexity and relatively recent deployment. | ||||||
BibTeX:
@article{4570772,
author = {Ricciato, F. and Hasenleithner, E. and Romirer-Maierhofer, P.},
title = {Traffic analysis at short time-scales: an empirical case study from a 3G cellular network},
journal = {Network and Service Management, IEEE Transactions on},
year = {2008},
volume = {5},
number = {1},
pages = {11 -21},
doi = {http://dx.doi.org/10.1109/TNSM.2008.080102}
}
|
||||||
| Rooney, Sean and Bauer, Daniel and Scotton, Paolo | Techniques for integrating sensors into the enterprise network | 2006 | Network and Service Management, IEEE Transactions on Vol. 3(1), pp. 43 -52 |
asynchronous messaging , power efficient protocols , scalability , sensor systems | DOI | |
| Abstract: Cheap programmable sensor devices are becoming commercially available. They offer the possibility of transforming existing enterprise applications and enabling entirely new ones. The merging of sensor networks into the enterprise network poses some distinct problems. In particular, information from theses devices must be obtained in a way which minimizes their energy use and must be aggregated and filtered before being sent to the application server to prevent it from being overwhelmed. We describe a range of complementary techniques for integrating sensors into an enterprise network. These comprise new architectural entities within the enterprise network #x2014; edge server #x2014; new means of sharing information within the enterprise network #x2014; messaging binning #x2014; and new protocols for extracting information from the sensor network #x2014; Messo. | ||||||
BibTeX:
@article{4798306,
author = {Rooney, Sean and Bauer, Daniel and Scotton, Paolo},
title = {Techniques for integrating sensors into the enterprise network},
journal = {Network and Service Management, IEEE Transactions on},
year = {2006},
volume = {3},
number = {1},
pages = {43 -52},
doi = {http://dx.doi.org/10.1109/TNSM.2006.4798306}
}
|
||||||
| Roychoudhuri, Lopamudra and Al-Shaer, Ehab S. | Real-time packet loss prediction based on end-to-end delay variation | 2005 | Network and Service Management, IEEE Transactions on Vol. 2(1), pp. 29 -38 |
delay-loss correlation , loss prediction | DOI | |
| Abstract: The effect of packet loss on the quality of real-time audio is significant. Nevertheless, Internet measurement experiments continue to show a considerable variation of packet loss, which makes audio error recovery and concealment challenging. We propose a novel framework to predict packet loss and congestion, based on measurements of end-to-end delay variation and trend, enabling proactive error recovery and congestion avoidance. Our preliminary simulation and experimentation results with various sites on the Internet show the effectiveness and the accuracy of the Loss Predictor technique. | ||||||
BibTeX:
@article{4798299,
author = {Roychoudhuri, Lopamudra and Al-Shaer, Ehab S.},
title = {Real-time packet loss prediction based on end-to-end delay variation},
journal = {Network and Service Management, IEEE Transactions on},
year = {2005},
volume = {2},
number = {1},
pages = {29 -38},
doi = {http://dx.doi.org/10.1109/TNSM.2005.4798299}
}
|
||||||
| Saad, M. and Leon-Garcia, A. and Wei Yu | Optimal Network Rate Allocation under End-to-End Quality-of-Service Requirements | 2007 | Network and Service Management, IEEE Transactions on Vol. 4(3), pp. 40 -49 |
asynchronous transfer mode , bandwidth , communication system traffic control , delay , partitioning algorithms , processor scheduling , quality of service , streaming media , traffic control , utility programs | computer networks , quality of service , radio networks | DOI |
| Abstract: We address the problem of allocating transmission rates to a set of network sessions with end-to-end bandwidth and delay requirements. We give a unified convex programming formulation that captures both average and probabilistic delay requirements. Moreover, we present a distributed algorithm and establish its convergence to the global optimum of the overall rate allocation problem. In our algorithm, session sources selfishly update their rates as to maximize their individual benefit (utility minus bandwidth cost), the network partitions end-to-end delay requirements into local per-link delays, and the links adjust their prices to coordinate the sources' and network's decisions, respectively. This algorithm relies on a network utility maximization (NUM) approach, and can be viewed as a generalization of TCP and active queue management (AQM) algorithms to handle end-to-end QoS. We extend our results to deterministic delay requirements when nodes employ Packet-level Generalized Processor Sharing (PGPS) schedulers. | ||||||
BibTeX:
@article{4489645,
author = {Saad, M. and Leon-Garcia, A. and Wei Yu},
title = {Optimal Network Rate Allocation under End-to-End Quality-of-Service Requirements},
journal = {Network and Service Management, IEEE Transactions on},
year = {2007},
volume = {4},
number = {3},
pages = {40 -49},
doi = {http://dx.doi.org/10.1109/TNSM.2007.021101}
}
|
||||||
| Salah, K. and Elbadawi, K. and Boutaba, R. | Performance Modeling and Analysis of Network Firewalls | 2012 | Network and Service Management, IEEE Transactions on Vol. 9(1), pp. 12-21 |
network firewalls , performance analysis , performance modeling , queueing systems | DOI | |
| Abstract: Network firewalls act as the first line of defense against unwanted and malicious traffic targeting Internet servers. Predicting the overall firewall performance is crucial to network security engineers and designers in assessing the effectiveness and resiliency of network firewalls against DDoS (Distributed Denial of Service) attacks as those commonly launched by today's Botnets. In this paper, we present an analytical queueing model based on the embedded Markov chain to study and analyze the performance of rule-based firewalls when subjected to normal traffic flows as well as DoS attack flows targeting different rule positions. We derive equations for key features and performance measures of engineering and design significance. These features and measures include throughput, packet loss, packet delay, and firewall's CPU utilization. In addition, we verify and validate our analytical model using simulation and real experimental measurements. | ||||||
BibTeX:
@article{6112159,
author = {Salah, K. and Elbadawi, K. and Boutaba, R.},
title = {Performance Modeling and Analysis of Network Firewalls},
journal = {Network and Service Management, IEEE Transactions on},
year = {2012},
volume = {9},
number = {1},
pages = {12-21},
doi = {http://dx.doi.org/10.1109/TNSM.2011.122011.110151}
}
|
||||||
| Samaan, N. and Karmouch, A. | Network anomaly diagnosis via statistical analysis and evidential reasoning | 2008 | Network and Service Management, IEEE Transactions on Vol. 5(2), pp. 65 -77 |
anomaly detection , dempster-shafer theory , network management | computer network management , inference mechanisms , security of data , statistical analysis , telecommunication security | DOI |
| Abstract: This paper investigates the efficiency of diagnosing network anomalies using concepts of statistical analysis and evidential reasoning. A bi-cycle of auto-regression is first applied to model increments in the values of network monitoring variables to accurately detect network anomalies. To classify the rootcause of the detected anomalies, concepts of evidential reasoning of Dempster-Shafer theory are employed; the root-cause of a network failure is inferred by gathering pieces of evidence concerning different groups of candidate failures obtained from a training set of detected anomalies and their corresponding root-causes. These groups are then refined to infer the exact cause of failure when evidence accumulates using the Dempster rule of combinations. To handle cases of imbalanced training sets, two new approaches for assigning belief values to different anomaly classes are also proposed. Performance analysis and results demonstrate the accuracy of the proposed scheme in detecting anomalies using real data. | ||||||
BibTeX:
@article{4694132,
author = {Samaan, N. and Karmouch, A.},
title = {Network anomaly diagnosis via statistical analysis and evidential reasoning},
journal = {Network and Service Management, IEEE Transactions on},
year = {2008},
volume = {5},
number = {2},
pages = {65 -77},
doi = {http://dx.doi.org/10.1109/TNSM.2008.021103}
}
|
||||||
| Samimi, F.A. and McKinley, P.K. and Sadjadi, S.M. and Chiping Tang and Shapiro, J.K. and Zhinan Zhou | Service Clouds: Distributed Infrastructure for Adaptive Communication Services | 2007 | Network and Service Management, IEEE Transactions on Vol. 4(2), pp. 84 -95 |
adaptive systems , cloud computing , computer architecture , computer networks , middleware , mobile computing , prototypes , quality of service , testing , web and internet services | computer architecture , middleware , mobile computing , telecommunication services | DOI |
| Abstract: This paper describes service clouds, a distributed infrastructure designed to facilitate rapid prototyping and deployment of adaptive communication services. The infrastructure combines adaptive middleware functionality with an overlay network substrate in order to support dynamic instantiation and reconfiguration of services. The service clouds architecture includes a collection of low-level facilities that can be invoked directly by applications or used to compose more complex services. After describing the service clouds architecture, we present results of experimental case studies conducted on the PlanetLab Internet testbed alone and a mobile computing testbed. | ||||||
BibTeX:
@article{4383310,
author = {Samimi, F.A. and McKinley, P.K. and Sadjadi, S.M. and Chiping Tang and Shapiro, J.K. and Zhinan Zhou},
title = {Service Clouds: Distributed Infrastructure for Adaptive Communication Services},
journal = {Network and Service Management, IEEE Transactions on},
year = {2007},
volume = {4},
number = {2},
pages = {84 -95},
doi = {http://dx.doi.org/10.1109/TNSM.2007.070901}
}
|
||||||
| Santos, F. and da Costa Cordeiro, W. and Gaspary, L. and Barcellos, M. | Funnel: Choking Polluters in BitTorrent File Sharing Communities | 2011 | Network and Service Management, IEEE Transactions on Vol. 8(4), pp. 310 - 321 |
bittorrent , peer-to-peer , experimental evaluation , pollution | DOI | |
| Abstract: BitTorrent-based file sharing communities are very popular nowadays. Anecdotal evidence hints that such communities are exposed to content pollution attacks (i.e., publication of "false" files, viruses, or other malware), requiring a moderation effort from their administrators. The size of such a cumbersome task increases with content publishing rate. To tackle this problem, we propose a generic pollution control strategy and instantiate it as a mechanism for BitTorrent communities. The strategy follows a conservative approach: it regards newly published content as polluted, and allows the dissemination rate to increase according to the proportion of positive feedback issued about the content. In contrast to related approaches, the strategy and mechanism avoid the problem of pollution dissemination at the initial stages of a swarm, when insufficient feedback is available to form a reputation about the content. To evaluate the proposed solution, we conducted a set of experiments using a popular BitTorrent agent and an implementation of our mechanism. Results indicate that the proposed approach mitigates the dissemination of polluted content in BitTorrent, imposing a low overhead in the distribution of non-polluted ones. | ||||||
BibTeX:
@article{6070519,
author = {Santos, F. and da Costa Cordeiro, W. and Gaspary, L. and Barcellos, M.},
title = {Funnel: Choking Polluters in BitTorrent File Sharing Communities},
journal = {Network and Service Management, IEEE Transactions on},
year = {2011},
volume = {8},
number = {4},
pages = {310 - 321},
doi = {http://dx.doi.org/10.1109/TNSM.2011.110311.110104}
}
|
||||||
| Sauve, J. and Queiroz, M. and Moura, A. and Bartolini, C. and Hickey, M. | Prioritizing Information Technology Service Investments under Uncertainty | 2011 | Network and Service Management, IEEE Transactions on Vol. 8(3), pp. 259 -273 |
investments in it services , aleatory uncertainty , decision making under uncertainty , epistemic uncertainty , risk management , service portfolio management | information technology , investment | DOI |
| Abstract: We explore the challenge of selecting the best among a set of alternative IT investments. Solving this problem is important since the difference between alternative investment options may be drastic in terms of business results, both positive and negative. The resulting model takes as input a set of investment alternatives and a parameterized description of IT services, and provides as output a Preference Index for each alternative. The solution takes into account such characteristics as epistemic and aleatory uncertainty as well as the decision maker's attitude toward risk. Through a case study and a sensitivity analysis, we conclude that the model is useful in practice and robust; we also describe its domain of validity. | ||||||
BibTeX:
@article{5970246,
author = {Sauve, J. and Queiroz, M. and Moura, A. and Bartolini, C. and Hickey, M.},
title = {Prioritizing Information Technology Service Investments under Uncertainty},
journal = {Network and Service Management, IEEE Transactions on},
year = {2011},
volume = {8},
number = {3},
pages = {259 -273},
doi = {http://dx.doi.org/10.1109/TNSM.2011.072611.100077}
}
|
||||||
| Sauve, J. and Santos, R. and Reboucas, R. and Moura, A. and Bartolini, C. | Change Priority Determination in IT Service Management Based on Risk Exposure | 2008 | Network and Service Management, IEEE Transactions on Vol. 5(3), pp. 178 -187 |
change management, risk, change prioritization, it service management, business-driven it management | business data processing , management of change , risk analysis | DOI |
| Abstract: In the Change Management process within IT Service Management, some activities need to evaluate the risk exposure associated with changes to be made to the infrastructure and services. The paper presents a method to evaluate risk exposure associated with a change. Further, we show how to use the risk exposure metric to automatically assign priorities to changes. The formal model developed for this purpose captures the business perspective by using financial metrics in the evaluation of risk. Thus the method is an example of Business-Driven IT Management. A case study, performed in conjunction with a large IT service provider, is reported and provides good results when compared to decisions made by human managers. | ||||||
BibTeX:
@article{4805134,
author = {Sauve, J. and Santos, R. and Reboucas, R. and Moura, A. and Bartolini, C.},
title = {Change Priority Determination in IT Service Management Based on Risk Exposure},
journal = {Network and Service Management, IEEE Transactions on},
year = {2008},
volume = {5},
number = {3},
pages = {178 -187},
doi = {http://dx.doi.org/10.1109/TNSM.2009.031105}
}
|
||||||
| Scho¨ andnwa¨ andlder, J. and Marinov, V. | On the Impact of Security Protocols on the Performance of SNMP | 2011 | Network and Service Management, IEEE Transactions on Vol. 8(1), pp. 52 -64 |
snmp , network management , security protocol | computer network management , computer network security , network interfaces , transport protocols , user interfaces | DOI |
| Abstract: Since the early 1990s, there have been several attempts to secure the Simple Network Management Protocol (SNMP). The third version of the protocol, published as full standard in 2002, introduced the User-based Security Model (USM), which comes with its own user and key-management infrastructure. Since then, network operators have reported that deploying another user and key management infrastructure to secure SNMP is expensive and a reason to not deploy SNMPv3. This paper describes how existing security protocols operating above the transport layer and below application protocols can be used to secure SNMP. These protocols can take advantage of already deployed key management infrastructures that are used for other network management interfaces and hence their use can reduce the operational costs associated with securing SNMP. Our main contribution is a detailed performance analysis of a prototype implementation, comparing the performance of SNMPv3 over SSH, TLS, and DTLS with other versions of SNMP. We also discuss the differences between the various options to secure SNMP and provide guidelines for choosing solutions to implement or deploy. | ||||||
BibTeX:
@article{5702353,
author = {Scho¨ andnwa¨ andlder, J. and Marinov, V.},
title = {On the Impact of Security Protocols on the Performance of SNMP},
journal = {Network and Service Management, IEEE Transactions on},
year = {2011},
volume = {8},
number = {1},
pages = {52 -64},
doi = {http://dx.doi.org/10.1109/TNSM.2011.012111.00011}
}
|
||||||
| Schuetz, S. and Zimmermann, K. and Nunzi, G. and Schmid, S. and Brunner, M. | Autonomic and Decentralized Management of Wireless Access Networks | 2007 | Network and Service Management, IEEE Transactions on Vol. 4(2), pp. 96 -106 |
base stations , centralized control , communication system control , computer network management , computer networks , control systems , environmental management , radio spectrum management , wireless lan , wireless networks | radio access networks , telecommunication network management | DOI |
| Abstract: In this article, we apply autonomic and distributed management principles to wireless access networks. Most interesting is the application of autonomic properties and behaviors including adaptive, aware, and automatic operation in a decentralized setting. In particular, we present a generic and autonomic management architecture for decentralized management of wireless access networks, such as GERAN/UTRAN, E-UTRAN, WiMAX or WLAN. For evaluation purposes, we apply this architecture to the management of a Wireless LAN network, and we evaluate the architecture and some of the autonomic management functions through simulations, a prototype implementation and the setup of a real-world testbed for experimentation with the proposed management approach. | ||||||
BibTeX:
@article{4383311,
author = {Schuetz, S. and Zimmermann, K. and Nunzi, G. and Schmid, S. and Brunner, M.},
title = {Autonomic and Decentralized Management of Wireless Access Networks},
journal = {Network and Service Management, IEEE Transactions on},
year = {2007},
volume = {4},
number = {2},
pages = {96 -106},
doi = {http://dx.doi.org/10.1109/TNSM.2007.070905}
}
|
||||||
| Secci, S. and Ma, H. and Helvik, B. and Rougier, J. | Resilient Inter-Carrier Traffic Engineering for Internet Peering Interconnections | 2011 | Network and Service Management, IEEE Transactions on Vol. 8(4), pp. 274 - 284 |
bgp , internet reliability , routing resiliency , game theory , inter-domain routing , multipath routing , peering management | DOI | |
| Abstract: We present a novel resilient routing policy for controlling the routing across peering links between Internet carriers. Our policy is aimed at offering more dependability and better performance to the routing decision with respect to the current practice (e.g., hot-potato routing). Our work relies on a non-cooperative game framework, called Peering Equilibrium MultiPath (PEMP), that has been recently proposed. PEMP allows two carrier providers to coordinate a multipath route selection for critical flows across peering links, while preserving their respective interests and independence. In this paper, we propose a resilient PEMP execution policy accounting for the occurrence of potential impairments (traffic matrix variations, intra-AS and peering link failures) that may occur in both peering networks. We mathematically define how to produce robust equilibrium sets and describe how to appropriately react to unexpected network impairments that might take place. The results from extensive simulations show that, under a realistic failure scenario, our policy adaptively prevents from peering link congestions and excessive route deviations after failures. | ||||||
BibTeX:
@article{6070522,
author = {Secci, S. and Ma, H. and Helvik, B. and Rougier, J.},
title = {Resilient Inter-Carrier Traffic Engineering for Internet Peering Interconnections},
journal = {Network and Service Management, IEEE Transactions on},
year = {2011},
volume = {8},
number = {4},
pages = {274 - 284},
doi = {http://dx.doi.org/10.1109/TNSM.2011.110311.100064}
}
|
||||||
| Setzer, T. and Bhattacharya, K. and Ludwig, H. | Change scheduling based on business impact analysis of change-related risk | 2010 | Network and Service Management, IEEE Transactions on Vol. 7(1), pp. 58 -71 |
business impact analysis, change management, change scheduling, risk management, service networks, service transition management | business data processing , financial management , management of change , probability , risk management , scheduling | DOI |
| Abstract: In today's enterprises, the alignment of IT service infrastructures to continuously changing business requirements is a key cost driver, all the more so as most severe service disruptions can be attributed to the introduction of changes into the IT service infrastructure. Change management is a disciplined process for introducing required changes with minimum business impact. Considering the number of business processes in an enterprise and the complexity of the dependency network of processes to invoked services, one of the most pressing problems in change management is the risk-aware prioritization and scheduling of vast numbers of service changes. In this paper we introduce a model for estimating the business impact of operational risk resulting from changes. We determine the business impact based on the number and types of business process instances affected by a change-related outage and quantify the business impact in terms of financial loss. The model takes into account the network of dependencies between processes and services, probabilistic change-related downtime, uncertainty in business process demand, and various infrastructural characteristics. Based on the analytical model, we derive decision models aimed at scheduling single or multiple correlated changes with the lowest expected business impact. The models are evaluated using simulations based on industry data. | ||||||
BibTeX:
@article{5412873,
author = {Setzer, T. and Bhattacharya, K. and Ludwig, H.},
title = {Change scheduling based on business impact analysis of change-related risk},
journal = {Network and Service Management, IEEE Transactions on},
year = {2010},
volume = {7},
number = {1},
pages = {58 -71},
doi = {http://dx.doi.org/10.1109/TNSM.2010.I9P0305}
}
|
||||||
| Shayani, D. and Machuca, C.M. and Jager, M. | A techno-economic approach to telecommunications: the case of service migration | 2010 | Network and Service Management, IEEE Transactions on Vol. 7(2), pp. 96 -106 |
business intelligence; employee allocation; next generation networking; operational expenditures; service migration; techno-economic analysis. | competitive intelligence , economics , telecommunication network management , telecommunication services | DOI |
| Abstract: The evolution of telecommunications technology has always challenged the industry to cope with the rapid pace of innovation and demand. The actual panorama offers a view of network operators constantly pushed to minimize their expenses while keeping profitability. Due to that, a keen interest on applying business intelligence methods has appeared an approach that encompasses the particularities of technology, thus named techno-economic analysis. Based on this framework, this work proposes a novel approach to modeling and studying a particular process, the service migration between platforms. The need for migration of telecommunication platforms stems from the constant technological progress and has become a focus of savings and new business opportunities. The proposed service migration model uses the hill climbing solution to find the best scenario for a given number of involved employees. The paper presents a collection of case studies, which cover the most important aspects of the migration process and suggest how network operators can increase their benefits. Additionally, the network dismantling the very end of a network lifecycle is also analyzed and simulated. Our approach aims at a deeper look into the operation of a telecommunications company, identifies the main cost drivers and extracts recommendations to an improved network management. | ||||||
BibTeX:
@article{5471040,
author = {Shayani, D. and Machuca, C.M. and Jager, M.},
title = {A techno-economic approach to telecommunications: the case of service migration},
journal = {Network and Service Management, IEEE Transactions on},
year = {2010},
volume = {7},
number = {2},
pages = {96 -106},
doi = {http://dx.doi.org/10.1109/TNSM.2010.06.I8P0297}
}
|
||||||
| Sperotto, A. and Mandjes, M. and Sadre, R. and de Boer, P. and Pras, A. | Autonomic Parameter Tuning of Anomaly-Based IDSs: an SSH Case Study | 2012 | Network and Service Management, IEEE Transactions on Vol. 9(Early Access) |
autonomic , anomalies , intrusion detection , network management , parameter optimization | DOI | |
| Abstract: Anomaly-based intrusion detection systems classify network traffic instances by comparing them with a model of the normal network behavior. To be effective, such systems are expected to precisely detect intrusions (high true positive rate) while limiting the number of false alarms (low false positive rate). However, there exists a natural trade-off between detecting all anomalies (at the expense of raising alarms too often), and missing anomalies (but not issuing any false alarms). The parameters of a detection system play a central role in this trade-off, since they determine how responsive the system is to an intrusion attempt. Despite the importance of properly tuning the system parameters, the literature has put little emphasis on the topic, and the task of adjusting such parameters is usually left to the expertise of the system manager or expert IT personnel. In this paper, we present an autonomic approach for tuning the parameters of anomaly-based intrusion detection systems in case of SSH traffic. We propose a procedure that aims to automatically tune the system parameters and, by doing so, to optimize the system performance. We validate our approach by testing it on a flow-based probabilistic detection system for the detection of SSH attacks. | ||||||
BibTeX:
@article{6172597,
author = {Sperotto, A. and Mandjes, M. and Sadre, R. and de Boer, P. and Pras, A.},
title = {Autonomic Parameter Tuning of Anomaly-Based IDSs: an SSH Case Study},
journal = {Network and Service Management, IEEE Transactions on},
year = {2012},
volume = {9},
number = {Early Access},
doi = {http://dx.doi.org/10.1109/TNSM.2012.031512.110146}
}
|
||||||
| Srivastava, Shekhar and Agrawal, Gaurav and Pioro, Michal and Medhi, Deep | Determining link weight system under various objectives for OSPF networks using a Lagrangian relaxation-based approach | 2005 | Network and Service Management, IEEE Transactions on Vol. 2(1), pp. 9 -18 |
ospf networks , link weight system , optimal routing , traffic engineering | DOI | |
| Abstract: An important traffic engineering problem for OSPF networks is the determination of optimal link weights. Certainly, this depends on the traffic engineering objective. Regardless, often a variety of performance measures may be of interest to a network provider due to their impact on the network. In this paper, we consider different objectives and discuss how they impact the determination of the link weights and different performance measures. In particular, we propose a composite objective function; furthermore, we present a Lagrangian relaxation-based dual approach to determine the link weight system. We then consider different performance measures and discuss the effectiveness of different objectives through computational studies of a variety of network topologies. We find that our proposed composite objective function with Lagrangian relaxation-based dual approach is very effective in meeting different performance measures and is computationally very fast. | ||||||
BibTeX:
@article{4798297,
author = {Srivastava, Shekhar and Agrawal, Gaurav and Pioro, Michal and Medhi, Deep},
title = {Determining link weight system under various objectives for OSPF networks using a Lagrangian relaxation-based approach},
journal = {Network and Service Management, IEEE Transactions on},
year = {2005},
volume = {2},
number = {1},
pages = {9 -18},
doi = {http://dx.doi.org/10.1109/TNSM.2005.4798297}
}
|
||||||
| Stanic, S. and Subramaniam, S. and Sahin, G. and Choi, H. and Choi, H.-A. | Active monitoring and alarm management for fault localization in transparent all-optical networks | 2010 | Network and Service Management, IEEE Transactions on Vol. 7(2), pp. 118 -131 |
transparent optical networks, fault detection, fault localization, monitoring, alarm processing. | alarm systems , fault location , integer programming , linear programming , monitoring | DOI |
| Abstract: Achieving accurate and efficient fault localization in large transparent all-optical networks (TONs) is an important and challenging problem due to unique fault-propagation, time constraints, and scalability requirements. In this paper, we introduce a novel technique for optimizing the speed of fault-localization through the selection of an active set of monitors for centralized and hierarchically-distributed management. The proposed technique is capable of providing multiple levels of fault-localization-granularity, from individual discrete optical components to the entire monitoring domains. We formulate and prove the NP-completeness of the optimal monitor activation problem and present its Integer Linear Program (ILP) formulation. Furthermore, we propose a novel heuristic whose solution quality is verified by comparing it with an ILP. Extensive simulation results provide supporting analysis and comparisons of achievable alarm-vector reduction, localization coverage, and time complexity, for flat and hierarchically distributed monitoring approaches. The impact of network connectivity on fault localization complexity in randomly generated topologies is also studied. Results demonstrate the effectiveness of the proposed technique in efficient and scalable monitoring of transparent optical networks. | ||||||
BibTeX:
@article{5471042,
author = {Stanic, S. and Subramaniam, S. and Sahin, G. and Choi, H. and Choi, H.-A.},
title = {Active monitoring and alarm management for fault localization in transparent all-optical networks},
journal = {Network and Service Management, IEEE Transactions on},
year = {2010},
volume = {7},
number = {2},
pages = {118 -131},
doi = {http://dx.doi.org/10.1109/TNSM.2010.06.I9P0343}
}
|
||||||
| Szilagyi, P. and Novaczki, S. | An Automatic Detection and Diagnosis Framework for Mobile Communication Systems | 2012 | Network and Service Management, IEEE Transactions on Vol. 9(Early Access) |
fault management , key performance indicator , network management automation , root cause analysis , self-healing | DOI | |
| Abstract: As the complexity of commercial cellular networks grows, there is an increasing need for automated methods detecting and diagnosing cells not only in complete outage but with degraded performance as well. Root cause analysis of the detected anomalies can be tedious and currently carried out mostly manually if at all; in most practical cases, operators simply reset problematic cells. In this paper, a novel integrated detection and diagnosis framework is presented that can identify anomalies and find the most probable root cause of not only severe problems but even smaller degradations as well. Detecting an anomaly is based on monitoring radio measurements and other performance indicators and comparing them to their usual behavior captured by profiles, which are also automatically built without the need for thresholding or manual calibration. Diagnosis is based on reports of previous fault cases by identifying and learning their characteristic impact on different performance indicators. The designed framework has been evaluated with proof-of-concept simulations including artificial faults in an LTE system. Results show the feasibility of the framework for providing the correct root cause of anomalies and possibly ranking the problems by their severity. | ||||||
BibTeX:
@article{6174486,
author = {Szilagyi, P. and Novaczki, S.},
title = {An Automatic Detection and Diagnosis Framework for Mobile Communication Systems},
journal = {Network and Service Management, IEEE Transactions on},
year = {2012},
volume = {9},
number = {Early Access},
doi = {http://dx.doi.org/10.1109/TNSM.2012.031912.110155}
}
|
||||||
| Yongning Tang and Al-Shaer, E. and Boutaba, R. | Efficient fault diagnosis using incremental alarm correlation and active investigation for internet and overlay networks | 2008 | Network and Service Management, IEEE Transactions on Vol. 5(1), pp. 36 -49 |
computer science , computerized monitoring , condition monitoring , degradation , fault diagnosis , ip networks , information technology , management information systems , scalability , web and internet services | internet , computer network management , computer network reliability , fault diagnosis | DOI |
| Abstract: Fault localization is the core element in fault management. Symptom-fault map is commonly used to describe the symptom-fault causality in fault reasoning. For Internet service networks, a well-designed monitoring system can effectively correlate the observable symptoms (i.e., alarms) with the critical network faults (e.g., link failure). However, the lost and spurious symptoms can significantly degrade the performance and accuracy of a passive fault localization system. For overlay networks, due to limited underlying network accessibility, as well as the overlay scalability and dynamics, it is impractical to build a static overlay symptom-fault map. In this paper, we firstly propose a novel active integrated fault reasoning (AIR) framework to incrementally incorporate active investigation actions into the passive fault reasoning process based on an extended symptom-fault-action (SFA) model. Secondly, we propose an overlay network profile (ONP) to facilitate the dynamic creation of an overlay symptom-fault-action (called O-SFA) model, such that the AIR framework can be applied seamlessly to overlay networks (called O-AIR). As a result, the corresponding fault reasoning and action selection algorithms are elaborated. Extensive simulations and Internet experiments show that AIR and O-AIR can significantly improve both accuracy and performance in the fault reasoning for Internet and overlay service networks, especially when the ratio of the lost and spurious symptoms is high. | ||||||
BibTeX:
@article{4570776,
author = {Yongning Tang and Al-Shaer, E. and Boutaba, R.},
title = {Efficient fault diagnosis using incremental alarm correlation and active investigation for internet and overlay networks},
journal = {Network and Service Management, IEEE Transactions on},
year = {2008},
volume = {5},
number = {1},
pages = {36 -49},
doi = {http://dx.doi.org/10.1109/TNSM.2008.080104}
}
|
||||||
| Tang, Y. and Al-Shaer, E. and Joshi, K. | Reasoning under Uncertainty for Overlay Fault Diagnosis | 2012 | Network and Service Management, IEEE Transactions on Vol. 9(1), pp. 34-47 |
overlay networks , dependable networks , fault diagnosis , uncertainty reasoning | DOI | |
| Abstract: The performance and reliability of overlay services rely on the underlying overlay network's ability to effectively diagnose and recover from faults such as link failures and overlay node outages. However, overlay networks bring to fault diagnosis new challenges such as large-scale deployment, inaccessible underlay network information, dynamic symptom-fault causality relationship, and multi-layer complexity. In this paper, we develop an evidential overlay fault diagnosis framework called DigOver to tackle these challenges. Firstly, DigOver identifies a set of potential faulty components based on shared end-user observed negative symptoms. Then, each potential faulty component is evaluated to quantify its fault likelihood and the corresponding evaluation uncertainty. Finally, DigOver dynamically constructs a plausible fault graph to locate the root causes of end-user observed negative symptoms. Both simulation and Internet experiments demonstrate that DigOver can effectively and accurately diagnose overlay faults based on end-user observed negative symptoms. | ||||||
BibTeX:
@article{6122518,
author = {Tang, Y. and Al-Shaer, E. and Joshi, K.},
title = {Reasoning under Uncertainty for Overlay Fault Diagnosis},
journal = {Network and Service Management, IEEE Transactions on},
year = {2012},
volume = {9},
number = {1},
pages = {34-47},
doi = {http://dx.doi.org/10.1109/TNSM.2011.010312.110126}
}
|
||||||
| Thing, V.L.L. and Sloman, M. and Dulay, N. | Locating network domain entry and exit point/path for DDoS attack traffic | 2009 | Network and Service Management, IEEE Transactions on Vol. 6(3), pp. 163 -174 |
distributed denial of service, ip traceback. | ip networks , security of data | DOI |
| Abstract: A method to determine entry and exit points or paths of DDoS attack traffic flows into and out of network domains is proposed. We observe valid source addresses seen by routers from sampled traffic under non-attack conditions. Under attack conditions, we detect route anomalies by determining which routers have been used for unknown source addresses, to construct the attack paths. We consider deployment issues and show results from simulations to prove the feasibility of our scheme. We then implement our Traceback mechanism in C++ and more realistic experiments are conducted. The experiments show that accurate results, with high traceback speed of a few seconds, are achieved. Compared to existing techniques, our approach is non-intrusive, not requiring any changes to the Internet routers and data packets. Precise information regarding the attack is not required allowing a wide variety of DDoS attack detection techniques to be used. The victim is also relieved from the traceback task during an attack. The scheme is simple and efficient, allowing for a fast traceback, and scalable due to the distribution of processing workload. | ||||||
BibTeX:
@article{5374837,
author = {Thing, V.L.L. and Sloman, M. and Dulay, N.},
title = {Locating network domain entry and exit point/path for DDoS attack traffic},
journal = {Network and Service Management, IEEE Transactions on},
year = {2009},
volume = {6},
number = {3},
pages = {163 -174},
doi = {http://dx.doi.org/10.1109/TNSM.2009.03.090303}
}
|
||||||
| Tian, Chen and Jiang, Hongbo and Iyengar, Arun and Liu, Xue and Wu, Zuodong and Chen, Jinhua and Liu, Wenyu and Wang, Chonggang | Improving Application Placement for Cluster-Based Web Applications | 2011 | Network and Service Management, IEEE Transactions on Vol. 8(2), pp. 104 -115 |
load balancing , algorithm design , application placement , class constrained multiple-knapsack problem , cluster-based service | internet , web sites , minimax techniques , resource allocation | DOI |
| Abstract: Dynamic application placement for clustered web applications heavily influences system performance and quality of user experience. Existing approaches claim that they strive to maximize the throughput, keep resource utilization balanced across servers, and minimize the start/stop cost of application instances. However, they fail to minimize the worst case of server utilization; the load balancing performance is not optimal. What's more, some applications need to communicate with each other, which we called dependent applications; the network cost of them also should be taken into consideration. In this paper, we investigate how to minimize the resource utilization of servers in the worst case, aiming at improving load balancing among clustered servers. Our contribution is two-fold. First we propose and define a new optimization objectives: limiting the worst case of each individual server's utilization, formulated by a min-max problem. A novel framework based on binary search is proposed to detect an optimal load balancing solution. Second, we define system cost as the weighted combination of both placement change and inter-application communication cost. By maximizing the number of instances of dependent applications that reside in the same set of servers, the basic load-shifting and placement-change procedures are enhanced to minimize whole system cost. Extensive experiments have been conducted and effectively demonstrate that: 1) the proposed framework achieves a good allocation for clustered web applications. In other words, requests are evenly allocated among servers, and throughput is still maximized; 2) the total system cost maintains at a low level; 3) our algorithm has the capacity of approximating an optimal solution within polynomial time and is promising for practical implementation in real deployments. | ||||||
BibTeX:
@article{5871352,
author = {Tian, Chen and Jiang, Hongbo and Iyengar, Arun and Liu, Xue and Wu, Zuodong and Chen, Jinhua and Liu, Wenyu and Wang, Chonggang},
title = {Improving Application Placement for Cluster-Based Web Applications},
journal = {Network and Service Management, IEEE Transactions on},
year = {2011},
volume = {8},
number = {2},
pages = {104 -115},
doi = {http://dx.doi.org/10.1109/TNSM.2011.050311.100040}
}
|
||||||
| Tran, Con and Dziong, Zbigniew | Traffic Trend Estimation for Profit Oriented Capacity Adaptation in Service Overlay Networks | 2011 | Network and Service Management, IEEE Transactions on Vol. 8(4), pp. 285 -296 |
kalman filter , traffic estimation , adaptive exponential smoothing , capacity adaptation , grade of service | DOI | |
| Abstract: Service Overlay Networks (SON) can offer end to end Quality of Service by leasing bandwidth from Internet Autonomous Systems. To maximize profit, the SON can continually adapt its leased bandwidth to traffic demand dynamics based on online traffic trend estimation. In this paper, we propose novel approaches for online traffic trend estimation that fits the SON capacity adaptation. In the first approach, the smoothing parameter of the exponential smoothing (ES) model is adapted to traffic trend. Here, the trend is estimated using measured connection arrival rate autocorrelation or cumulative distribution functions. The second approach applies Kalman filter whose model is built from historical traffic data. In this case, availability of the estimation error distribution allows for better control of the network Grade of Service. Numerical study shows that the proposed autocorrelation based ES approach gives the best combined estimation response-stability performance when compared to known ES methods. The proposed Kalman filter based approach improves further the capacity adaptation performance by limiting the increase of connection blocking when traffic level is increasing. | ||||||
BibTeX:
@article{6102276,
author = {Tran, Con and Dziong, Zbigniew},
title = {Traffic Trend Estimation for Profit Oriented Capacity Adaptation in Service Overlay Networks},
journal = {Network and Service Management, IEEE Transactions on},
year = {2011},
volume = {8},
number = {4},
pages = {285 -296},
doi = {http://dx.doi.org/10.1109/TNSM.2011.110911.110116}
}
|
||||||
| Con Tran and Dziong, Z. | Service overlay network capacity adaptation for profit maximization | 2010 | Network and Service Management, IEEE Transactions on Vol. 7(2), pp. 72 -82 |
service overlay network, economics, grade of service, resource adaptation, markov decision process | internet , markov processes , optimisation , quality of service , telecommunication network routing , telecommunication traffic | DOI |
| Abstract: The considered Service Overlay Networks (SON) lease bandwidth with Quality of Service (QoS) guarantees from a multitude of Internet Autonomous Systems, through service level agreements (SLA) with Internet Service Providers (ISP). This bandwidth is used to establish SON links and deliver end-to-end QoS for real time service connections. The leased bandwidth amount influences both the admitted traffic and network cost, affecting the network profit. This gives the network operator the opportunity to optimize the profit by adapting the network resources to changing traffic and SLA costs conditions. We propose a novel approach that maximizes the network profit based on traffic measurements and SLA cost changes. The approach uses an economic model that integrates the network routing policy with the adaptation of the SON link capacities. While performing the adaptation of leased bandwidth, the connection blocking constraints are also maintained. The proposed adaptive optimization approach is based on a reward maximizing routing policy derived from the Markov Decision Process theory although it can be applied to other routing policies. Analytical models as well as simulation of a measurement based implementation of the proposed models are used to evaluate the performance of the proposed approach. | ||||||
BibTeX:
@article{5471038,
author = {Con Tran and Dziong, Z.},
title = {Service overlay network capacity adaptation for profit maximization},
journal = {Network and Service Management, IEEE Transactions on},
year = {2010},
volume = {7},
number = {2},
pages = {72 -82},
doi = {http://dx.doi.org/10.1109/TNSM.2010.06.I8P0287}
}
|
||||||
| Varga, P. and Moldovan, l. | Integration of Service-Level Monitoring with Fault Management for End-to-End Multi-Provider Ethernet Services | 2007 | Network and Service Management, IEEE Transactions on Vol. 4(1), pp. 28 -38 |
environmental management , ethernet networks , monitoring , neodymium , petri nets , prototypes , quality management , quality of service , standardization , virtual private networks | fault diagnosis , local area networks , monitoring , quality of service , telecommunication network management , telecommunication network reliability | DOI |
| Abstract: Assuring end-to-end service quality in a multi- provider Ethernet environment is a challenging task. Operation and maintenance issues have become more and more complex due to the gradual extension of the Ethernet technology from local- to wide-area networks and the increasingly frequent use of layer-2 virtual private networks. End-to-end Ethernet network management is currently under standardization, with a focus on connectivity fault management and performance management. However, none of the tools and research prototypes available to date integrate service-level monitoring with fault management functions such as event correlation or root cause analysis for interconnected Ethernet networks. In this paper, we address the issue by proposing an integrated service-level monitoring and fault management framework. Our event processing module can handle various events generated by network nodes or pollers. We also describe service-level monitoring and fault management methods that are fine-tuned for managing end-to-end multi- provider Ethernet services. | ||||||
BibTeX:
@article{4275032,
author = {Varga, P. and Moldovan, l.},
title = {Integration of Service-Level Monitoring with Fault Management for End-to-End Multi-Provider Ethernet Services},
journal = {Network and Service Management, IEEE Transactions on},
year = {2007},
volume = {4},
number = {1},
pages = {28 -38},
doi = {http://dx.doi.org/10.1109/TNSM.2007.030103}
}
|
||||||
| Velloso, P.B. and Laufer, R.P. and de O Cunha, D. and Duarte, O.C.M.B. and Pujolle, G. | Trust management in mobile ad hoc networks using a scalable maturity-based model | 2010 | Network and Service Management, IEEE Transactions on Vol. 7(3), pp. 172 -185 |
trust, ad hoc networks, security | ad hoc networks , mobility management (mobile radio) , protocols , telecommunication security | DOI |
| Abstract: In this paper, we propose a human-based model which builds a trust relationship between nodes in an ad hoc network. The trust is based on previous individual experiences and on the recommendations of others. We present the Recommendation Exchange Protocol (REP) which allows nodes to exchange recommendations about their neighbors. Our proposal does not require disseminating the trust information over the entire network. Instead, nodes only need to keep and exchange trust information about nodes within the radio range. Without the need for a global trust knowledge, our proposal scales well for large networks while still reducing the number of exchanged messages and therefore the energy consumption. In addition, we mitigate the effect of colluding attacks composed of liars in the network. A key concept we introduce is the relationship maturity, which allows nodes to improve the efficiency of the proposed model for mobile scenarios. We show the correctness of our model in a single-hop network through simulations. We also extend the analysis to mobile multihop networks, showing the benefits of the maturity relationship concept. We evaluate the impact of malicious nodes that send false recommendations to degrade the efficiency of the trust model. At last, we analyze the performance of the REP protocol and show its scalability. We show that our implementation of REP can significantly reduce the number messages. | ||||||
BibTeX:
@article{5560572,
author = {Velloso, P.B. and Laufer, R.P. and de O Cunha, D. and Duarte, O.C.M.B. and Pujolle, G.},
title = {Trust management in mobile ad hoc networks using a scalable maturity-based model},
journal = {Network and Service Management, IEEE Transactions on},
year = {2010},
volume = {7},
number = {3},
pages = {172 -185},
doi = {http://dx.doi.org/10.1109/TNSM.2010.1009.I9P0339}
}
|
||||||
| Verma, A. and Sharma, U. and Jain, R. and Dasgupta, K. | Compass: optimizing the migration cost vs. application performance tradeoff | 2008 | Network and Service Management, IEEE Transactions on Vol. 5(2), pp. 118 -131 |
migration , profit maximzation , resource allocation , store placement | middleware , resource allocation , virtual storage | DOI |
| Abstract: We investigate methodologies for placement and migration of logical data stores in virtualized storage systems leading to optimum system configuration in a dynamic workload scenario. The aim is to optimize the tradeoff between the performance or operational cost improvement resulting from changes in store placement, and the cost imposed by the involved data migration step. We propose a unified economic utility based framework in which the tradeoff can be formulated as a utility maximization problem where the utility of a configuration is defined as the difference between the benefit of a configuration and the cost of moving to the configuration. We present a storage management middleware framework and architecture Compass that allows systems designers to plug-in different placement as well as migration techniques for estimation of utilities associated with different configurations. The biggest obstacle in optimizing the placement benefit and migration cost tradeoff is the exponential number of possible configurations that one may have to evaluate. We present algorithms that explore the configuration space efficiently and compute a candidate set of configurations that optimize this cost-benefit tradeoff. Our algorithms have many desirable properties including local optimality. Comprehensive experimental studies demonstrate the efficacy of the proposed framework and exploration algorithms, as our algorithms outperform migration cost-oblivious placement strategies by up to 40% on real OLTP traces for many settings. | ||||||
BibTeX:
@article{4694136,
author = {Verma, A. and Sharma, U. and Jain, R. and Dasgupta, K.},
title = {Compass: optimizing the migration cost vs. application performance tradeoff},
journal = {Network and Service Management, IEEE Transactions on},
year = {2008},
volume = {5},
number = {2},
pages = {118 -131},
doi = {http://dx.doi.org/10.1109/TNSM.2008.021105}
}
|
||||||
| Jessie Hui Wang and Dah Ming Chiu and Lui, J.C.S. and Chang, R.K.C. | Inter-AS Inbound Traffic Engineering via ASPP | 2007 | Network and Service Management, IEEE Transactions on Vol. 4(1), pp. 62 -70 |
communication system traffic control , databases , guidelines , ip networks , internet , joining processes , peer to peer computing , protocols , routing , telecommunication traffic | internet , routing protocols , telecommunication traffic | DOI |
| Abstract: AS Path Prepending (ASPP) is a popular method for the inter-AS inbound traffic engineering, which is known to be more difficult than the outbound traffic engineering. Although the ASPP approach has been extensively practised by many ASes, it is surprising that there still lacks a systematic study of this approach and the basic understanding of its effectiveness. In this paper, we introduce the concept, applicability and potential instability problem of the ASPP approach. Some guidelines are given as the first step to study the method to avoid instability problem. Finally, we study the dynamic prepending behavior of ISPs and show a real-world pathologic case of prepending instability based on our measurement study of RouteViews data. | ||||||
BibTeX:
@article{4275035,
author = {Jessie Hui Wang and Dah Ming Chiu and Lui, J.C.S. and Chang, R.K.C.},
title = {Inter-AS Inbound Traffic Engineering via ASPP},
journal = {Network and Service Management, IEEE Transactions on},
year = {2007},
volume = {4},
number = {1},
pages = {62 -70},
doi = {http://dx.doi.org/10.1109/TNSM.2007.030106}
}
|
||||||
| Zhikui Wang and Yuan Chen and Gmach, D. and Singhal, S. and Watson, B.J. and Rivera, W. and Xiaoyun Zhu and Hyser, C.D. | AppRAISE: application-level performance management in virtualized server environments | 2009 | Network and Service Management, IEEE Transactions on Vol. 6(4), pp. 240 -254 |
performance control , performance model , resource allocation , virtualization , workload consolidation | feedback , feedforward , queueing theory , resource allocation , virtual machines | DOI |
| Abstract: Managing application-level performance for multitier applications in virtualized server environments is challenging because the applications are distributed across multiple virtual machines, and workloads are dynamic in their intensity and transaction mix resulting in time-varying resource demands. In this paper, we present AppRAISE, a system that manages performance of multi-tier applications by dynamically resizing the virtual machines hosting the applications. We extend a traditional queuing model to represent application performance in virtualized server environments, where virtual machine capacity is dynamically tuned. Using this performance model, AppRAISE predicts the performance of the applications due to workload changes, and proactively resizes the virtual machines hosting the applications to meet performance thresholds. By integrating feedforward prediction and feedback reactive control, AppRAISE provides a robust and efficient performance management solution. We tested AppRAISE using Xen virtual machines and the RUBiS benchmark application. Our empirical results show that AppRAISE can effectively allocate CPU resources to application components of multiple applications to meet end-to-end mean response time targets in the presence of variable workloads, while maintaining reasonable trade-offs between application performance, resource efficiency, and transient behavior. | ||||||
BibTeX:
@article{5374032,
author = {Zhikui Wang and Yuan Chen and Gmach, D. and Singhal, S. and Watson, B.J. and Rivera, W. and Xiaoyun Zhu and Hyser, C.D.},
title = {AppRAISE: application-level performance management in virtualized server environments},
journal = {Network and Service Management, IEEE Transactions on},
year = {2009},
volume = {6},
number = {4},
pages = {240 -254},
doi = {http://dx.doi.org/10.1109/TNSM.2009.04.090404}
}
|
||||||
| Watkins, L. and Robinson, W.H. and Beyah, R. | A Passive Solution to the Memory Resource Discovery Problem in Computational Clusters | 2010 | Network and Service Management, IEEE Transactions on Vol. 7(4), pp. 218 -230 |
cluster computing , clustering applications , memory-intensive applications , passive resource discovery | distributed processing , resource allocation | DOI |
| Abstract: Resource discovery is an important problem in distributed computing, because the throughput of the system is directly linked to its ability to quickly locate available resources. Current solutions are undesirable for discovering resources in large computational clusters because they are intrusive, chatty (i.e., have per-node overhead), or maintenance-intensive. In this paper, we present a novel method that offers the ability to non-intrusively identify resources that have available memory; this is critical for memory-intensive cluster applications such as weather forecasting and computational chemistry. The prime benefits are fourfold: (1) low message complexity, (2) scalability, (3) load balancing, and (4) low maintainability. We demonstrate the feasibility of our method with experiments using a 50-node test-bed (DETERlab). Our technique allows us to establish a correlation between memory load and the timely response of network traffic from a node. Results show that our method can accurately (92%-100%) identify nodes with available memory through analysis of existing network traffic, including network traffic that has passed through a switch (non-congested). | ||||||
BibTeX:
@article{5668978,
author = {Watkins, L. and Robinson, W.H. and Beyah, R.},
title = {A Passive Solution to the Memory Resource Discovery Problem in Computational Clusters},
journal = {Network and Service Management, IEEE Transactions on},
year = {2010},
volume = {7},
number = {4},
pages = {218 -230},
doi = {http://dx.doi.org/10.1109/TNSM.2010.1012.0326}
}
|
||||||
| Wuhib, F. and Dam, M. and Stadler, R. | A gossiping protocol for detecting global threshold crossings | 2010 | Network and Service Management, IEEE Transactions on Vol. 7(1), pp. 42 -57 |
distributed monitoring, threshold detection, gossip protocol | computerised monitoring , protocols | DOI |
| Abstract: We investigate the use of gossip protocols for the detection of network-wide threshold crossings. Our design goals are low protocol overhead, small detection delay, low probability of false positives and negatives, scalability, robustness to node failures and controllability of the trade-off between overhead and detection delay. Based on push-synopses, a gossip protocol introduced by Kempe et al., we present a protocol that indicates whether a global aggregate of static local values is above or below a given threshold. For this protocol, we prove correctness and show that it converges to a state with no overhead when the aggregate is sufficiently far from the threshold. Then, we introduce an extension we call TG-GAP, a protocol that (1) executes in a dynamic network environment where local values change and (2) implements hysteresis behavior with upper and lower thresholds. Key elements of its design are the construction of snapshots of the global aggregate for threshold detection and a mechanism for synchronizing local states, both of which are realized through the underlying gossip protocol. Simulation studies suggest that TG-GAP is efficient in that the protocol overhead is minimal when the aggregate is sufficiently far from the threshold, that its overhead and the detection delay are largely independent on the system size, and that the tradeoff between overhead and detection quality can be effectively controlled. Lastly, we perform a comparative evaluation of TG-GAP against a tree-based protocol. We conclude that, for detecting global threshold crossings in the type of scenarios investigated, the tree-based protocol incurs a significantly lower overhead and a smaller detection delay than a gossip protocol such as TG-GAP. | ||||||
BibTeX:
@article{5412872,
author = {Wuhib, F. and Dam, M. and Stadler, R.},
title = {A gossiping protocol for detecting global threshold crossings},
journal = {Network and Service Management, IEEE Transactions on},
year = {2010},
volume = {7},
number = {1},
pages = {42 -57},
doi = {http://dx.doi.org/10.1109/TNSM.2010.I9P0329}
}
|
||||||
| Wuhib, F. and Dam, M. and Stadler, R. and Clem, A. | Robust monitoring of network-wide aggregates through gossiping | 2009 | Network and Service Management, IEEE Transactions on Vol. 6(2), pp. 95 -109 |
gossip protocol, epidemic protocol, aggregation, real-time monitoring | distributed algorithms , monitoring , protocols | DOI |
| Abstract: We investigate the use of gossip protocols for continuous monitoring of network-wide aggregates under crash failures. Aggregates are computed from local management variables using functions such as SUM, MAX, or AVERAGE. For this type of aggregation, crash failures offer a particular challenge due to the problem of mass loss, namely, how to correctly account for contributions from nodes that have failed. In this paper we give a partial solution. We present G-GAP, a gossip protocol for continuous monitoring of aggregates, which is robust against failures that are discontiguous in the sense that neighboring nodes do not fail within a short period of each other. We give formal proofs of correctness and convergence, and we evaluate the protocol through simulation using real traces. The simulation results suggest that the design goals for this protocol have been met. For instance, the tradeoff between estimation accuracy and protocol overhead can be controlled, and a high estimation accuracy (below some 5% error in our measurements) is achieved by the protocol, even for large networks and frequent node failures. Further, we perform a comparative assessment of GGAP against a tree-based aggregation protocol using simulation. Surprisingly, we find that the tree-based aggregation protocol consistently outperforms the gossip protocol for comparative overhead, both in terms of accuracy and robustness. | ||||||
BibTeX:
@article{5374830,
author = {Wuhib, F. and Dam, M. and Stadler, R. and Clem, A.},
title = {Robust monitoring of network-wide aggregates through gossiping},
journal = {Network and Service Management, IEEE Transactions on},
year = {2009},
volume = {6},
number = {2},
pages = {95 -109},
doi = {http://dx.doi.org/10.1109/TNSM.2009.090603}
}
|
||||||
| Wuhib, F. and Stadler, R. and Spreitzer, M. | A Gossip Protocol for Dynamic Resource Management in Large Cloud Environments | 2012 | Network and Service Management, IEEE Transactions on Vol. 9(Early Access) |
cloud computing , distributed management , gossip protocols , resource allocations | DOI | |
| Abstract: We address the problem of dynamic resource management for a large-scale cloud environment. Our contribution includes outlining a distributed middleware architecture and presenting one of its key elements: a gossip protocol that (1) ensures fair resource allocation among sites/applications, (2) dynamically adapts the allocation to load changes and (3) scales both in the number of physical machines and sites/applications. We formalize the resource allocation problem as that of dynamically maximizing the cloud utility under CPU and memory constraints. We first present a protocol that computes an optimal solution without considering memory constraints and prove correctness and convergence properties. Then, we extend that protocol to provide an efficient heuristic solution for the complete problem, which includes minimizing the cost for adapting an allocation. The protocol continuously executes on dynamic, local input and does not require global synchronization, as other proposed gossip protocols do. We evaluate the heuristic protocol through simulation and find its performance to be well-aligned with our design goals. | ||||||
BibTeX:
@article{6172596,
author = {Wuhib, F. and Stadler, R. and Spreitzer, M.},
title = {A Gossip Protocol for Dynamic Resource Management in Large Cloud Environments},
journal = {Network and Service Management, IEEE Transactions on},
year = {2012},
volume = {9},
number = {Early Access},
doi = {http://dx.doi.org/10.1109/TNSM.2012.031512.110176}
}
|
||||||
| Wysocki, T. and Jamalipour, A. | An Economic Welfare Preserving Framework for Spot Pricing and Hedging of Spectrum Rights for Cognitive Radio | 2012 | Network and Service Management, IEEE Transactions on Vol. 9(1), pp. 87-99 |
cognitive radio , sharpe ratio , economic welfare , hedging , spectrum pricing | DOI | |
| Abstract: In a Cognitive Radio (CR) enabled network, Secondary Users (SUs) have an impact on the Quality-of-Service (QoS), and ultimately the revenue of the PU Primary User (PU) license holders. An important metric of an investor's economic welfare is the ratio of mean returns to the volatility of returns (Sharpe ratio). Numerous CR access schemes have been proposed that fail to account for the economic welfare of PUs when SUs access their spectrum. In this paper we consider the PU's spectrum license as an investment and analyze the impact of CR activity on the PU's economic welfare, in order to derive a cost of production of spectrum access rights such that the PU's economic welfare is not degraded. This creates an incentive for PUs to permit CR access in their spectrum bands, by ensuring that the characteristics of returns on the substantial investment made in spectrum licenses are preserved. However, under any instantaneous or spot pricing scheme, the risk of price volatility is introduced. We also propose a framework to alleviate the risk to SUs from a volatile CR rights spot price, by introducing the concept of forward pricing and hedging of CR rights. This reduces the variability of cash-flow associated with the purchase of CR rights, ensuring that the QoS provided by an SU network remains unaffected by a high CR access price. We also illustrate the leverage effect, where a PU will achieve a higher mean return-on-investment with SU operation, albeit with a higher variance of returns. | ||||||
BibTeX:
@article{6093760,
author = {Wysocki, T. and Jamalipour, A.},
title = {An Economic Welfare Preserving Framework for Spot Pricing and Hedging of Spectrum Rights for Cognitive Radio},
journal = {Network and Service Management, IEEE Transactions on},
year = {2012},
volume = {9},
number = {1},
pages = {87-99},
doi = {http://dx.doi.org/10.1109/TNSM.2011.110911.110053}
}
|
||||||
| Yahaya, A. and Harks, T. and Suda, T. | iREX: efficient automation architecture for the deployment of inter-domain QoS policy | 2008 | Network and Service Management, IEEE Transactions on Vol. 5(1), pp. 50 -64 |
algorithm design and analysis , analytical models , automation , communication system traffic control , ip networks , identity management systems , quality of service , resource management , service oriented architecture , web and internet services | internet , numerical analysis , quality of service | DOI |
| Abstract: The inter-domain resource exchange (iREX) architecture uses economic market mechanisms to automate the ad-hoc negotiation and deployment of end to end inter-domain quality of service policy among resource consumer and resource provider . In this paper, we explore iREX's network load distribution by comparing its performance to a lower bound for network congestion in two ways. We first present an analytical model of iREX in terms of an online algorithm and analyze its efficiency via competitive analysis. Our main result shows that the efficiency loss of iREX with respect to monetary cost is upper-bounded by a factor of 8 K/2 K+1, where K s the number of deployments, provided affine linear price functions are used. When the price functions are used to model congestion in the network, this result implies upper bounds on the efficiency loss of iREX with respect to network congestion. We then complement the analytical model with a numerical study using simulations.with optimal solutions derived from unsplittable and splittable multi-commodity flow optimization models. Our numerical results show that for nominal to high traffic loads of 40% or more, iREX deviates a maximum of about 20% from the lower bound, while the current method deviates a maximum of 300%. | ||||||
BibTeX:
@article{4570774,
author = {Yahaya, A. and Harks, T. and Suda, T.},
title = {iREX: efficient automation architecture for the deployment of inter-domain QoS policy},
journal = {Network and Service Management, IEEE Transactions on},
year = {2008},
volume = {5},
number = {1},
pages = {50 -64},
doi = {http://dx.doi.org/10.1109/TNSM.2008.080105}
}
|
||||||
| Younis, M. and Farrag, O. and Althouse, B. | TAM: A Tiered Authentication of Multicast Protocol for Ad-Hoc Networks | 2012 | Network and Service Management, IEEE Transactions on Vol. 9(1), pp. 100-113 |
multicast communications , ad-hoc networks , message authentication | DOI | |
| Abstract: Ad-hoc networks are becoming an effective tool for many mission critical applications such as troop coordination in a combat field, situational awareness, etc. These applications are characterized by the hostile environment that they serve in and by the multicast-style of communication traffic. Therefore, authenticating the source and ensuring the integrity of the message traffic become a fundamental requirement for the operation and management of the network. However, the limited computation and communication resources, the large scale deployment and the unguaranteed connectivity to trusted authorities make known solutions for wired and single-hop wireless networks inappropriate. This paper presents a new Tiered Authentication scheme for Multicast traffic (TAM) for large scale dense ad-hoc networks. TAM combines the advantages of the time asymmetry and the secret information asymmetry paradigms and exploits network clustering to reduce overhead and ensure scalability. Multicast traffic within a cluster employs a one-way hash function chain in order to authenticate the message source. Cross-cluster multicast traffic includes message authentication codes (MACs) that are based on a set of keys. Each cluster uses a unique subset of keys to look for its distinct combination of valid MACs in the message in order to authenticate the source. The simulation and analytical results demonstrate the performance advantage of TAM in terms of bandwidth overhead and delivery delay. | ||||||
BibTeX:
@article{6094287,
author = {Younis, M. and Farrag, O. and Althouse, B.},
title = {TAM: A Tiered Authentication of Multicast Protocol for Ad-Hoc Networks},
journal = {Network and Service Management, IEEE Transactions on},
year = {2012},
volume = {9},
number = {1},
pages = {100-113},
doi = {http://dx.doi.org/10.1109/TNSM.2011.113011.100139}
}
|
||||||
| Yu, F.R. and Tang, H. and Mason, P.C. and Fei Wang | A Hierarchical Identity Based Key Management Scheme in Tactical Mobile Ad Hoc Networks | 2010 | Network and Service Management, IEEE Transactions on Vol. 7(4), pp. 258 -267 |
hierarchical id-based encryption , compromising probability , network lifetime , private key generator | military communication , mobile ad hoc networks , private key cryptography , stochastic processes , telecommunication network management , telecommunication security | DOI |
| Abstract: Hierarchical key management schemes would serve well for military applications where the organization of the network is already hierarchical in nature. Most of the existing key management schemes concentrate only on network structures and key allocation algorithms, ignoring attributes of the nodes themselves. Due to the distributed and dynamic nature of MANETs, it is possible to show that there is a security benefit to be attained when the node states are considered in the process of constructing a private key generator (PKG). In this paper, we propose a distributed hierarchical key management scheme in which nodes can get their keys updated either from their parent nodes or a threshold of sibling nodes. The dynamic node selection process is formulated as a stochastic problem and the proposed scheme can select the best nodes to be used as PKGs from all available ones considering their security conditions and energy states. Simulation results show that the proposed scheme can decrease network compromising probability and increase network lifetime in tactical MANETs. | ||||||
BibTeX:
@article{5668981,
author = {Yu, F.R. and Tang, H. and Mason, P.C. and Fei Wang},
title = {A Hierarchical Identity Based Key Management Scheme in Tactical Mobile Ad Hoc Networks},
journal = {Network and Service Management, IEEE Transactions on},
year = {2010},
volume = {7},
number = {4},
pages = {258 -267},
doi = {http://dx.doi.org/10.1109/TNSM.2010.1012.0362}
}
|
||||||
| Zachariadis, G. and Barria, J.A. | Dynamic pricing and resource allocation using revenue management for multiservice networks | 2008 | Network and Service Management, IEEE Transactions on Vol. 5(4), pp. 215 -226 |
pricing, qos, resource allocation, revenue management, bandwidth on demand | dynamic programming , packet radio networks , quality of service , resource allocation , telecommunication network management | DOI |
| Abstract: In this paper we develop a novel multiple-classes-of service framework where offered prices and QoS are allowed to be actively modified by the provider, depending on the demand and the congestion of the system. We obtain a solution to the problem by using dynamic programming. These results are then extended to a network environment using a decomposition approach. The decomposition approach makes our solution scalable, since single-link solutions are used and minimal amount of information is explicitly exchanged. Assessments carried out for small networks show that the obtained income is improved between 2%-20% when compared to a static approach and to other approaches where only price or quality are allowed to be adaptive. | ||||||
BibTeX:
@article{5010445,
author = {Zachariadis, G. and Barria, J.A.},
title = {Dynamic pricing and resource allocation using revenue management for multiservice networks},
journal = {Network and Service Management, IEEE Transactions on},
year = {2008},
volume = {5},
number = {4},
pages = {215 -226},
doi = {http://dx.doi.org/10.1109/TNSM.2009.041103}
}
|
||||||
| Bo Zhang and Guohui Wang and Zhu, A.Y. and Ng, T.S.E. | Router group monitoring: making traffic trajectory error detection more efficient | 2010 | Network and Service Management, IEEE Transactions on Vol. 7(3), pp. 158 -171 |
traffic trajectory error, monitoring, sampling , detection, router group | error detection , monitoring , peripheral interfaces , telecommunication network routing , telecommunication network topology , telecommunication traffic | DOI |
| Abstract: Detecting errors in traffic trajectories (i.e., packet forwarding paths) is important to operational networks. Several different traffic monitoring algorithms such as Trajectory Sampling, PSAMP, and Fatih can be used for traffic trajectory error detection. However, a straight-forward application of these algorithms will incur the overhead of simultaneously monitoring all network interfaces in a network for the packets of interest. In this paper, we propose a novel technique called router group monitoring to improve the efficiency of trajectory error detection by only monitoring the periphery interfaces of a set of selected router groups. We analyze a large number of real network topologies and show that effective router groups with high trajectory error detection rates exist in all cases. However, for router group monitoring to be practical, those effective router groups must be identified efficiently. To this end, we develop an analytical model for quickly and accurately estimating the detection rates of different router groups. Based on this model, we propose an algorithm to select a set of router groups that can achieve complete error detection and low monitoring overhead. Finally, we show that the router group monitoring technique can significantly improve the efficiency of trajectory error detection based on Trajectory Sampling or Fatih. | ||||||
BibTeX:
@article{5560571,
author = {Bo Zhang and Guohui Wang and Zhu, A.Y. and Ng, T.S.E.},
title = {Router group monitoring: making traffic trajectory error detection more efficient},
journal = {Network and Service Management, IEEE Transactions on},
year = {2010},
volume = {7},
number = {3},
pages = {158 -171},
doi = {http://dx.doi.org/10.1109/TNSM.2010.1009.I9P03322}
}
|
||||||
| Yanmin Zhu and Sye Loong Keoh and Sloman, M. and Lupu, E.C. | A lightweight policy system for body sensor networks | 2009 | Network and Service Management, IEEE Transactions on Vol. 6(3), pp. 137 -148 |
policy-driven management, policy system, body sensor networks, adaptation, authorization, access control. | body sensor networks , health care , operating systems (computers) , telecommunication computing , telecommunication security , user interfaces | DOI |
| Abstract: Body sensor networks (BSNs) for healthcare have more stringent security and context adaptation requirements than required in large-scale sensor networks for environment monitoring. Policy-based management enables flexible adaptive behavior by supporting dynamic loading, enabling and disabling of policies without shutting down nodes. This overcomes many of the limitations of sensor operating systems, such as TinyOS, which do not support dynamic modification of code. Alternative schemes for adaptation, such as network programming, have a high communication cost and suffer from operational interruption. In addition, a policy-driven approach enables fine-grained access control through specifying authorization policies. This paper presents the design, implementation and evaluation of an efficient policy system called Finger which enables policy interpretation and enforcement on distributed sensors to support sensor level adaptation and fine-grained access control. It features support for dynamic management of policies, minimization of resources usage, high responsiveness and node autonomy. The policy system is integrated as a TinyOS component, exposing simple, well-defined interfaces which can easily be used by application developers. The system performance in terms of processing latency and resource usage is evaluated. | ||||||
BibTeX:
@article{5374835,
author = {Yanmin Zhu and Sye Loong Keoh and Sloman, M. and Lupu, E.C.},
title = {A lightweight policy system for body sensor networks},
journal = {Network and Service Management, IEEE Transactions on},
year = {2009},
volume = {6},
number = {3},
pages = {137 -148},
doi = {http://dx.doi.org/10.1109/TNSM.2009.03.090301}
}
|
||||||
| Yanfeng Zhu and Qian Ma and Bisdikian, C. and Chun Ying | User-Centric Management of Wireless LANs | 2011 | Network and Service Management, IEEE Transactions on Vol. 8(3), pp. 165 -175 |
802.11 , wireless lans , access points , network management , performance modeling | telecommunication network management , wireless lan | DOI |
| Abstract: With the ever increasing deployment density of Wireless Local Area Networks (WLANs), more and more access points (APs) are deployed within users' vicinity. The effective management of these APs to optimize the users' throughput becomes an important challenge in high-density deployment environments. In this paper, we propose a user-centric network management framework to optimize users' throughput taking into consideration both the network conditions sensed by users and their access priorities. The proposed framework is built around an information pipeline that facilitates the sharing of the information needed for optimal management of communication resources. Theoretical analysis and extensive simulations are presented on two major management activities: AP association and channel selection, and demonstrate that the proposed user-centric network management framework significantly outperforms traditional network management framework in the high-density deployment environment. | ||||||
BibTeX:
@article{5970249,
author = {Yanfeng Zhu and Qian Ma and Bisdikian, C. and Chun Ying},
title = {User-Centric Management of Wireless LANs},
journal = {Network and Service Management, IEEE Transactions on},
year = {2011},
volume = {8},
number = {3},
pages = {165 -175},
doi = {http://dx.doi.org/10.1109/TNSM.2011.072611.100031}
}
|
||||||