Gradually Reconfiguring Virtual Network Topologies Based on Estimated Traffic Matrices

Ohsita, Yuichi; Miyamura, Takashi; Arakawa, Shin’ichi; Ata, Shingo; Oki, Eiji; Shiomoto, Kohei; Murata, Masayuki

doi:10.1109/infcom.2007.311

Cited by 28 publications

(21 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The level of granularity (1), synchronization pattern of interaction (4), application concurrency specification (8) and cooperative interaction (14) are important attributes for the design self-* P2P solutions because they per-pass the decisions on how to incorporate all integration requirements into such solution. The attributes (5), (6), (7), (10), (11) and (12) have a strong relationship on the design decisions of all integration requirements except the local information one.…”

Section: Asynchronous Pattern Of Communication-information Is Transfementioning

confidence: 99%

Principles of the Self-* P2P Design

Marquezan

Granville

2012

Self-* and P2P for Network Management

View full text Add to dashboard Cite

This chapter provides the description of the conditions on the network management community that lead to the proposal of the investigation of joint use of self-* properties and P2P. Fundamental questions are proposed and used to support the proposed investigation. We also describe the features of the network environments that could benefit from a self-* P2P network management alternative and introduce the management requirements associated to these environments. Due to the fact that the literature shows different point of views related to self-* properties, autonomic computing, peer-to-peer, and cooperation, this chapter also describes the meanings of the aforementioned concepts in the context of this book as well as their relationship to the self-* P2P design. In addition, integration requirements are proposed to be followed on the joint exploration of self-* properties and P2P so that it becomes possible to design fully distributed and cooperative network management applications. A correspondence between concurrent attributes and the integration requirements is also examined in this chapter. Finally, the methodology to conduct the investigation relies on exploring case studies where self-* properties and P2P can be used together in order to improve a network management solution.

show abstract

Section: Asynchronous Pattern Of Communication-information Is Transfementioning

confidence: 99%

Principles of the Self-* P2P Design

Marquezan

Granville

2012

Self-* and P2P for Network Management

View full text Add to dashboard Cite

show abstract

“…This was known as "war dialing". The attackers had to enter the network from a known point, such as a telephone number or IP address, so that at least part of that (Ohsita et al, 2007;Zubair et al, 2010).…”

Section: Introductionmentioning

confidence: 99%

Efficient Hybrid Network (Wired and Wireless) Intrusion Detection using Statistical Data Streams and Detection of Clustered Alerts

Thangavel¹

2011

Journal of Computer Science

View full text Add to dashboard Cite

Problem statement: Wireless LAN IEEE 802.11 protocols are growing rapidly and security has always been a concern with the security of wired network. Wireless networks encountered threats from unauthorized access to network resources, installation of access points and illegal sniffing (refer as classical intrusion threats). In its current hybrid wired and wireless network attacks on the generally distinguish from normal cable intrusion attacks, selective forwarding attacks, MAC spoofing attacks. This means that the simple traditional misuse detection and anomaly detection model alone not sufficient to identify these mixed attacks on the hybrid network (wired and wireless). Approach: Our proposed work presents a hybrid cluster-based intrusion detection statistical anomaly, for detecting selective forwarding in wireless networks and intrusion into traditional wired networks. The detection was identified by changes in the statistical characteristics of data traffic on the wireless network. The clustering of data traffic based on the characteristics of alert classes and normal classes improve the performance of our hybrid intrusion detection in both wired and wireless network efficiently. The simulation was performed to evaluate the performance of wired intrusion detection systems to the proposed wireless intrusion detection on the data traffic in the area of wired and wireless hybrid network environment. Results: The proposed wireless intrusion detection system sharply detect the statistical change point detection of intrusion behavior in terms of attack rate and throughput of data traffic. The probability of intrusion attack and detection delay were measured in the simulation scenario, the result is 17% better than the current part of the exiting wired intrusion detection. Conclusion: The proposed anomaly intrusion traffic detection scheme performs better in heterogametic hybrid network (i.e., wired and wireless) compared to that of conventional homogeneous intrusion detection network models.

show abstract

“…The origin-destination (OD) traffi c matrix (TM) is one of the critical inputs for network confi guration [1,2] and management [3], traffi c engineering [4] and capacity planning. It describes the amount of traffi c that fl ows between every possible pair of ingress and egress points in a network.…”

Section: Introductionmentioning

confidence: 99%

“…The link counts Y are, for example, available from SNMP data. Thus we can compute X from equation (1). In many networks, however, the number of observed links is much less than the number of OD pairs, so the problem depicted in equation (1) becomes highly underdetermined.…”

Section: Introductionmentioning

confidence: 99%

Traffic matrix estimation based on a square root Kalman filtering algorithm

Zhou¹,

Yang²,

Yang³

et al. 2008

Int J Network Mgmt

View full text Add to dashboard Cite

SUMMARYThe traffi c matrix (TM) is one of the crucial inputs for many network management and traffi c engineering tasks. As it is usually impossible to directly measure traffi c matrices, it becomes an important research topic to infer them by modeling incorporating measurable data and additional information. Many estimation methods have been proposed so far, but most of them are not suffi ciently accurate or effi cient. Researchers are therefore making efforts to seek better estimation methods. Of the proposed methods, the Kalman Filtering method is a very effi cient and accurate method. However, the error covariance calculation components of Kalman fi ltering are diffi cult to implement in realistic network systems due to the existence of ill-conditioning problems. In this paper, we proposed a square root Kalman fi ltering traffi c matrix estimation (SRKFTME) algorithm based on matrix decomposition to improve the Kalman fi ltering method. The SRKFTME algorithm makes use of the evolution equations of forecast and analysis error covariance square roots. In this way the SRKFTME algorithm can ensure the positive defi niteness of the error covariance matrices, which can solve some ill-conditioning problems. Also, square root Kalman fi ltering will be less affected by numerical problems. Simulation and actual traffi c testing results show superior accuracy and stability of SRKFTME algorithm compared with prior Kalman fi ltering methods.

show abstract

Gradually Reconfiguring Virtual Network Topologies Based on Estimated Traffic Matrices

Cited by 28 publications

References 8 publications

Principles of the Self-* P2P Design

Principles of the Self-* P2P Design

Efficient Hybrid Network (Wired and Wireless) Intrusion Detection using Statistical Data Streams and Detection of Clustered Alerts

Traffic matrix estimation based on a square root Kalman filtering algorithm

Contact Info

Product

Resources

About