Search

This paper relates to a method for performing Stateful Packet Inspection(SPI) in real time using a session table management scheme that allows more efficient generation of session state information. SPI is an important technique to reduce false positive alerts in network intrusion detection system(NIDS). As the number of session increases, this technique requires a higher processing speed, thereby causing performance problems. However, existing software-based solutions cannot perform real-time packet inspection ensuring the wire speed. To guarantee both performance and functionality with respect to statefulness, we designed and implemented SPI-based intrusion detection module in a FPGA to help alleviating a bottleneck in network intrusion detection systems in this paper. [ABSTRACT FROM AUTHOR]

The research on the detection of zero-day network attack and the signature generation is highlighted as an issue according to the outbreak of the new network attack is faster than a prediction. In this paper, we propose a very practical method that detects the executable codes within the network packet payload. It could be used as the key function of the signature generation against the zero-day attack or the high speed anomaly detection. The proposed heuristic method in this paper could be expressed in terms of visually classifying the characteristic of the instruction pattern of executable codes. And then we generalize this by applying the discrete parameter Markov chain. Our experimental study showed that the presented scheme could find all types of executable codes in our experiments. [ABSTRACT FROM AUTHOR]

With constantly increasing complexity of active measurement methods, the issue of processing measurement results becomes important. Similarly to traditional pattern discovery, temporal patterns found in active measurement samples should be provided effective storage and means to compare to other samples. Traditional time series data mining is not applicable to temporal patterns in active measurement time series. This paper proposes a pattern discovery method based on unique features of active measurement results. The method is implemented in form of a database and is used in the paper to verify the proposed method. [ABSTRACT FROM AUTHOR]

This paper proposes an architecture of source-end DDoS protection system on IXP2400 network processor, which monitors traffic from the source network and polices traffic at the source without affecting the traffic from other network. The proposed architecture includes usual IPv4 forwarder with additional modules for source filtering, packet classification and flow control, and uses modified non-parametric CUSUM algorithm. We analyze the major shortcomings of previous approaches, and present basic performance analysis. The proposed system can handle 65,000 aggregated flows, and can operate at OC-48 line rate. [ABSTRACT FROM AUTHOR]

The necessity to split the endpoint identity and locator has been understood since sometime both from routing and security perspective. Today endpoints are identified by IP address that is location dependent and attributed by ISPs, whereas the identity neither depends on location nor on ISP. So splitting the routing and identification space is expected to make network operation such as mobility, multihoming and traffic engineering transparent for the end user. While in the operator side the use of a single space for routing and identification brings scaling issues. The operators will benefit from the split by decreased routing table size. Within IETF/IRTF solutions are being developed to separate the IP layer into Endpoint Identifier (EID) space and routing locator (RLOC) space in the form of Locator/ID Separation Protocol (LISP). In LISP the Identifier (ID) has the format of a IPv4 or IPv6 address. This architecture provides ID to locator resolution so that the packets can be routed through the Internet. This paper proposes a solution that considers an Endpoint Identifier (EID) as the combination of a domain name and a cryptographic Identifier (cryptoID). Such EIDs are hosted in a mixed DNS/Distributed Hash Table (DHT) architecture. Resolution involves a DNS and a DHT resolution. We show how the use of DNSSEC enhances the routing algorithm of the DHT resolution, and present advantages a such an architecture in term of deployment and future use of the Internet. [ABSTRACT FROM AUTHOR]

This paper describes a metamodeling strategy of Service Level Agreements for Digital Video Broadcasting services based on Service Level Agreement Language(SLAng). The purpose of the paper is to provide a detailed analysis of SLAs in this domain and provide a motivation for modeling and automating their management. We also discuss why precise and machine readable SLAs can improve the levels of automation in SLA Management thereby reducing potential violations. The meta-modeling approach based on the Model Driven Architecture(MDA) described in this paper also simplifies the integration of a SLA Management systems with other infrastructure that delivers the service to the client. [ABSTRACT FROM AUTHOR]

Location Fingerprinting (LF) is a promising location technique for many awareness applications in pervasive computing. However, as research on LF systems goes beyond basic methods there is an increasing need for better comparison of proposed LF systems. Developers of LF systems are also lacking good frameworks for understanding different options when building LF systems. This paper proposes a taxonomy to address both of these problems. The proposed taxonomy has been constructed from a literature study of 51 papers and articles about LF. For researchers the taxonomy can also be used as an aid when scoping out future research in the area of LF. [ABSTRACT FROM AUTHOR]

CE-ants (Cross Entropy ants) is a distributed, robust and adaptive swarm intelligence system for dealing with path management in communication networks. This paper focuses on strategies for adjusting the overhead generated by the CE-ants as the state of the network changes. The overhead is in terms of number of management packets (ants) generated, and the adjustments are done by controlling the generation rate of ants traversing the network. The self-tuned strategies proposed in this paper detect state changes implicitly by monitoring parameters and ant rates in the management system. Rate adaptation is done both in the network nodes and in the peering points of the virtual paths. The results are promising, and compared to fixed rate strategies the self-tuned strategies show a significant saving (70-85%) in number of packets, and has similar (even slightly better) data packet delay and service availability. The rate adaptation in network nodes provides fast restoration with short path detection times and hence also high service availability. The implicit self-tuned ant rate in the path endpoints improves the convergence time on link state events without flooding the network with management packets in steady state when these are not required. Keywords: Cross Entropy, swarm intelligence, CE-ants, network management, restoration time, service availability. [ABSTRACT FROM AUTHOR]

Distributed computing systems are continuously increasing in complexity and cost of managing, and system management tasks require significantly higher levels of autonomic management. In distributed computing, system management is changing from a conventional central administration, to autonomic computing. However, most existing research focuses on healing after a problem has already occurred. In order to solve this problem, an inference model is required to recognize operating environments and predict error occurrence. In this paper, we proposed a hybrid inference model - ID3, Fuzzy Logic, FNN and Bayesian Network - through four algorithms supporting self-healing in autonomic computing. This inference model adopts a selective healing model, according to system situations for self-diagnosing and prediction of problems using four algorithms. Therefore, correction of error prediction becomes possible. In this paper, a hybrid inference model is adopted to evaluate the proposed model in a self-healing system. In addition, inference is compared with existing research and the effectiveness is demonstrated by experiment. [ABSTRACT FROM AUTHOR]

DoS(Denial of Service) / DDoS(Distributed Denial of Service) attacks threaten Internet security nowadays. However, the current Internet protocol and backbone network do not support traceback to know attacker's real location. Many methods to defend DoS/DDoS attack have been proposed. However these kinds of methods cause network overhead because they use many packets to reconstruct an attack path. In this paper we propose effective probability marking methods and a pushback algorithm to reduce network overhead. [ABSTRACT FROM AUTHOR]

The proliferation of real-time multimedia services has triggered attempts by service providers to seek ways to reduce the cost of managing those services, while satisfying customer demands for the resources involved in the service delivery. A key issue is to avoid costly service interruptions in such real-time multimedia services. In this paper, we propose the use of the inventory control approach from the Operations Research community to remedy to this problem. We show two possible inventory control models to manage the resources involved in real-time multimedia service delivery. We also perform extensive simulations to compare the advantages and disadvantages of the two inventory control models for resource management of real-time multimedia services. [ABSTRACT FROM AUTHOR]

In this paper, we show the feasibility of real-time flow monitoring with controllable accuracy in today's IP networks. Our approach is based on Netflow and A-GAP. A-GAP is a protocol for continuous monitoring of network state variables, which are computed from device metrics using aggregation functions, such as SUM, AVERAGE and MAX. A-GAP is designed to achieve a given monitoring accuracy with minimal overhead. A-GAP is decentralized and asynchronous to achieve robustness and scalability. The protocol incrementally computes aggregation functions inside the network and, based on a stochastic model, it dynamically configures local filters that control the overhead and accuracy. We evaluate a prototype in a testbed of 16 commercial routers and provide measurements from a scenario where the protocol continuously estimates the total number of FTP flows in the network. Local flow metrics are read out from Netflow buffers and aggregated in real-time. We evaluate the prototype for the following criteria. First, the ability to effectively control the trade off between monitoring accuracy and processing overhead; second, the ability to accurately predict the distribution of the estimation error; third, the impact of a sudden change in topology on the performance of the protocol. The testbed measurements are consistent with simulation studies we performed for different topologies and network sizes, which proves the feasibility of the protocol design, and, more generally, the feasibility of effective and efficient real-time flow monitoring in large network environments. [ABSTRACT FROM AUTHOR]

This paper describes a novel method of achieving packet scheduling in several routers of network, in order to optimize the end to end delay. We use a multi-agent system to model this problem, where each agent of this system tries to optimize the local scheduling and through a communication with each other, attempts to make global coordination in order to optimize the total scheduling. The communication between agents is done by mobile agents like ants colony. A pheromone-Q learning approach is presented in this paper, which consists to applying the standard Q-learning technique adapted to our architecture with a synthetic pheromone that acts as a communication medium speeding up the learning process of cooperating agents. [ABSTRACT FROM AUTHOR]

This paper describes the testing activities for the maintenance of the NeOSS (New Operations Support System) of Korea Telecom. To ensure the successful maintenance of the NeOSS without any effect on the existing functions and performance, we performed various tests related to functionality, efficiency and others before the added and modified parts were applied to the NeOSS. In this paper, we show the maintenance process, the various tests related to it, the test phases, and the test environment for controlling the quality of the NeOSS maintenance. [ABSTRACT FROM AUTHOR]

Satellite communication environment can be divided into LOS and NLOS environments. While, terminal can get satellite signal in LOS environment, NLOS needs additional function to get the signal such as cooperation between gap filler or terrestrial network (WLAN or WIMAX). In this paper, the two way satellite communication system is based on DVB-RCS specification and terrestrial networks are based on WLAN(IEEE 802.11) or WIMAX(IEEE 802.16). This paper adopt proper algorithms to handover among satellite and wireless network for providing seamless service when moving object enter NLOS environment in collaboration area and estimate the performance of the method by simulations. [ABSTRACT FROM AUTHOR]

This paper represents a new clustering approach for wireless sensor network. It is a decentralized algorithm having the topology control information in each sensor node. A post leader selection algorithm is acted upon each of the clusters just after their formation. Experimental validation shows that the proposed scheme is an efficient approach for sensor node management. [ABSTRACT FROM AUTHOR]

In broadband networks, dynamic service change affects the management system because of the variability in time to market, transmission quality and transport system. Therefore, reusability and maintainability become the important quality factors in Network Management System (NMS). An aspect-oriented software development method is a feasible solution for the evolvability of NMS. In this paper, we propose a method to generate aspects in a standard management information model using Aspect Conversion and Metric Calculation (ACMC) algorithm. We applied it ITU-T M.3100 and evaluated it via the ratio of reduced redundancy in point of crosscutting concerns. [ABSTRACT FROM AUTHOR]

Network topology discovery for the large IP networks is a very well studied area of research. Most of the previous work focus on improving the efficiency in terms of time and completeness of network topology discovery algorithms and less attention has been given to the deployment scenarios and user centric view of network topology discovery. In this paper we propose a novel network topology discovery algorithm and a flexible architecture. The silent features of our work are loosely coupled architecture, network boundary aware architecture, discovering the transparency of dumb/incorporative elements, flexible network Visualization, and intelligent algorithm for quick response to user discovery request. To the best of our knowledge no existing solution has focused on the above mentioned requirements. After several years of research experience in developing a complete, flexible and scalable solution for network topology discovery we propose to divide it into three loosely coupled components: topology discovery algorithm, topology object generation and persistence, and topology visualization. In this paper we will present our proposed integrated complete network topology discovery solution, discuss the motivation of our proposed architecture, the efficiency and user-friendliness of our work. Our results show that the average accuracy of our algorithm is 92.4% and takes one second to discover 100 network elements. [ABSTRACT FROM AUTHOR]

Reliability of active measurement results is an omnipresent issue in all existing measurement tools. Till this day, no reference point exists that would enable to compare measurement methods in efficiency and reliability. Partially, this is due to inability to attribute any particular probability model to both probing results as well as to the traffic probes interfere with. This paper proposed to analyze spectrum of measurement results in search for a reliable reference point. It is discovered that spectrum distribution of probing results are linearly dependent to linear changes in traffic. [ABSTRACT FROM AUTHOR]

In the area of electronic commerce, the personalized goods recommendation system is a very important research issue that raises user satisfaction, and increases loyalty towards the content provider. For this, the correct analysis of user preferences is essential, and most existing researches use a purchase history or a wish list. However, due to the rapid development of information technologies, commerce has progressed from e-commerce to U(Ubiquitous)-commerce. In the ubiquitous environment, computing devices of various types, including the mobile device itself, exist in user space; in addition, a broad range of information related to user preferences is generated while using these devices. Hence, if the information is efficiently managed, a more effective recommendation strategy will be established. This paper proposes a multi-agent based U-commerce system to efficiently collect and manage diverse context information that can occur in the ubiquitous environment. Therefore, a more personalized recommendation, which is reflected by various user preferences, is possible. A prototype was implemented in order to evaluate the proposed system, then, through results, the existing recommendation method is compared and the effectiveness of the system is confirmed. [ABSTRACT FROM AUTHOR]

This paper presents a full video delivery network monitoring suite. Our monitoring tool offers a new view of a video delivery network, a view based on the quality perceived by final users. We measure, in real time and automatically, the perceived quality at the client side by means of the recently proposed PSQA technology. Moreover, we improve PSQA's efficiency and robustness for video analysis by studying the flows at the frame level, instead of the packet level previously considered in the literature. The developed monitoring suite is a completely free-software application, based on well-known technologies such as the Simple Network Management Protocol or the Round Robin Databases, which can be executed in various operating systems. In this paper we explain the tool implementation and we present some of the first experimental measurements performed with it. [ABSTRACT FROM AUTHOR]

Determining the maximum amount of traffic that can be admitted in a DiffServ network is a difficult task. Considering a realistic traffic scenario, the relationship between the traffic load and the queue length distribution of a DiffServ node is very difficult to model. This paper demonstrates how a non-liner programming (NLP) algorithm can be employed to determine the maximum load that can be accepted by a DiffServ node without deriving an analytical model. The NLP algorithm is used to "train" a parameter based admission controller (PBAC) using a specifically designed traffic profile. After training the PBAC for a specific network and specific statistical QoS guarantees, it can be used to provide these guarantees to distinct offered traffic loads. This method was evaluated in a sample scenario where (aggregated on-off) VoIP traffic and (self-similar) data traffic compete for the network resources. [ABSTRACT FROM AUTHOR]

In this paper, a new mechanism to achieve anonymity in peer-to-peer (P2P) file sharing systems is proposed. As usual, anonymity is obtained by means of connecting the source and destination peers through a set of intermediate nodes, creating a multiple-hop path. The main contribution of the paper is a distributed algorithm able to guarantee the anonymity even when a node in a path fails (voluntarily or not). The algorithm takes into account the inherent costs associated with multiple-hop communications and tries to reach a well-balanced solution between the anonymity degree and its associated costs. Some parameters are obtained analytically but the main network performances are evaluated by simulation. We quantify the costs associated with the control packets used by the distributed recovery algorithm. On the other hand, we also measure the anonymity provided by our system (benefit), using a simulation-based analysis to calculate the average entropy. [ABSTRACT FROM AUTHOR]

In the paper a performance evaluation model of mobile wireless sensor network is presented. The model is based on renewal theory. The hierarchical structure of the network holds a clusters composed of ordinary sensors. Afterwards, all clusterhead sensors belong to a backbone network which is needed for data transmission to the sink of the sensor network. Some sensors are mobile and can send their data to the clusterhead sensors. In this paper, we address one of the fundamental problems, namely performance modeling of mobile wireless sensor networks. Moreover, our model can also be used for ordinary wireless sensor networks which are static and geometrically constrained. Specific models are suggested and analysed for different communication needs. [ABSTRACT FROM AUTHOR]

In some specific applications, sensors can be deployed in a deterministic way to form regular network. This paper firstly analyzes the relationship between the probability of coverage and that of the node failure in the network with triangular topology. Then the fault tolerance performance in triangular topology network is analyzed by using the k-subnet. At last, the paper discusses the connectivity performance in triangular topology network and in grid topology network. [ABSTRACT FROM AUTHOR]

In this paper we describe a self-organising and self-managing system for a Cooperative Service Provisioning (CSP) of media transport and processing services. The term cooperative is used since we assume that CSP providers as well as users offer resources to be utilised for media delivery and processing based on an Overlay Network principle. The core building block of the proposed system is a Distributed Hash Table extended with a CSP specific indexing principle and recursive search algorithm. The task of QoS constraint verification for a requested service is distributed between participating nodes. In this paper we describe CSP based on a Content Addressable Network (CAN) [1] DHT. The resulting system is evaluated based on a theoretical analysis as well as simulations. [ABSTRACT FROM AUTHOR]

For multi-hop wireless networks using IEEE 802.11 most TCP performance degradation results from hidden, exposed terminal problems and bandwidth waste caused by exponential backoff of retransmission timer due to node's mobility, not from collisions. However, in normal DCF algorithm, a failed user increases its contention window (CW) exponentially, thus it reduces the success probability of exposed terminal nodes. That is, these problems will cause burst data transmissions frequently in a particular node which already was successful in packet transmission, because the probability of successful packet transmission rate would be increased. To solve these problems, in this paper, we propose an efficient contention window control (ECWC) scheme to increase TCP performance in wireless multi-hop network. The proposed ECWC scheme is suggested to reduce the hidden and exposed terminal problems of wireless multi-hop network. That is, the proposed scheme increases the number of backoff retransmissions to increase the successful probability rate of MAC transmission, and fixes the contention window at a predetermined value. [ABSTRACT FROM AUTHOR]

In this paper, a new QoS model is presented for end-to-end service provisioning in wireless ad hoc networks. Many previous works focus on the packet scheduling mechanism using multiple service classes implemented for traffic prioritization based service differentiation. However, this paper concentrates on a scheme for dynamically selecting a proper one among several forwarding classes that perform different service rate according to service requirements. There service requirements include low delay, high throughput, and low loss. The proposed solution is a new QoS provisioning model called Dynamic Hop Service Differentiation (DHSD). This model supports soft QoS provisioning to reduce network overhead and wireless PHB (WPHB) to achieve the end-to-end QoS required by applications. The proposed QoS model is evaluated using OPNET simulation. We show that this model outperforms both best-effort and strict priority service models in wireless ad hoc network environments. [ABSTRACT FROM AUTHOR]

The ieee 802.11 mac-protocol, often used in ad-hoc networks, has the tendency to share the capacity equally amongst the active nodes, irrespective of their loads. An inherent drawback of this fair-sharing policy is that a node that serves as a relay-node for multiple flows is likely to become a bottleneck. This paper proposes a flow-level performance model of such a bottleneck node using fluid-flow analysis. Assuming Poisson initiations of new flow transfers at the bottleneck node, we obtain insightful, robust, and explicit expressions for characteristics related to the overall flow transfer time, the buffer occupancy, and the packet delay at the bottleneck node. The analysis is enabled by a translation of the behavior of the bottleneck node and the source nodes in terms of an m/g/1 queueing model. We conclude the paper by an assessment of the impact of alternative capacity sharing amongst source nodes and the bottleneck in order to improve the performance of the bottleneck. [ABSTRACT FROM AUTHOR]

The absence of a router or a base station urges the need for better access control mechanism in the ad-hoc networks. This paper presents a localized approach for access control which implements ticket certification services through reputation mechanism. Reputation refers to, the opinion of one node as seen by other nodes. Ticket certification ensures that, only well behaving nodes (which forward and route packets of other nodes) can get the tickets and only they can access the network. The tickets are obtained from any node in the locality with high reputation instead of getting it from a centralized authority or from some k neighbors in the neighborhood. This paper gives the analysis and simulation results of the localized approach through reputation mechanism and proves that the localized access control with reputation is better than the localized approach without reputation. [ABSTRACT FROM AUTHOR]

Multipath is a sought-after mechanism to achieve reliability along the error-prone channel in wireless sensor networks. However, this technique is not energy efficient since sensor networks are subject to strict resource constraints. In this paper, we propose an energy aware method to combine multipath routing with practical network coding technique. Through this method, we can guarantee the same reliability while reduce much energy consumption by decreasing the number of paths needed to delivery data. This method only needs little metadata overhead and some small-scale linear operations. Simulations under different circumstances verify the theoretical results. The paper also discusses other advantages of network coding in multi-receiver case to illustrate our future work. [ABSTRACT FROM AUTHOR]

This paper explores the structural and behavioural similarities that exist between the chemical constitution of natural substances and WSN (Wireless Sensor Network) topology. It introduces Atomic Topology Management (AToM), which uses concepts like WSN electron, WSN nucleus, WSN photon, and WSN atom to model sensor node, base station, message and basic WSN subset consisting of one base station and several sensor nodes. We subsequently extend the modeling to explain the basic behaviours of WSNs. The paper describes naming rules for topology management and based upon this, we devise and test some basic algorithms for energy and load balancing. Keywords: Wireless Sensor Network, Topology Management, Autonomic Networking. [ABSTRACT FROM AUTHOR]

Efficient dynamic resource provisioning algorithms are necessary to the development and automation of Quality of Service (QoS) networks. The main goal of these algorithms is to offer services that satisfy the QoS requirements of individual users while guaranteeing at the same time an efficient utilization of network resources. In this paper we introduce a new service model that provides quantitative per-flow bandwidth guarantees, where users subscribe for a guaranteed rate; moreover, the network periodically individuates unused bandwidth and proposes short-term contracts where extra-bandwidth is allocated and guaranteed exclusively to users who can exploit it to transmit at a rate higher than their subscribed rate. To implement this service model we propose a dynamic provisioning architecture for intra-domain Quality of Service networks. We develop an efficient bandwidth allocation algorithm that takes explicitly into account traffic statistics to increase the users' benefit and the network revenue simultaneously. We demonstrate through simulation in realistic network scenarios that the proposed dynamic provisioning model is superior to static provisioning in providing resource allocation both in terms of total accepted load and network revenue. Keywords: Dynamic Bandwidth Allocation, Autonomic Networks, Service Model. [ABSTRACT FROM AUTHOR]

This paper proposes a three-layer cognitive architecture for pervasive and intelligent computing of personal networks. The key element of the proposed architecture is the cognitive layer, which consists of five components, namely the context cognition, the personalization cognition, the resource cognition, the network cognition, and the cognition management. In order to demonstrate the purpose of each one of the cognition component, we present a motivation example on session mobility and show that the proposed architecture enables proactive configuration and thus hides the latency of configuration. Finally, this paper identifies the research issues that need to be addressed in order to implement the cognitive architecture for personal networks. [ABSTRACT FROM AUTHOR]

Autonomic networking set a challenge for the research community to engineer systems and architectures that will increase the QoS and robustness of future network architectures. However, our experience is that so far the autonomic network research community does not have a common perception of what an autonomic network is. This paper attempts to propose a generic model for autonomic systems, along with a minimum set of required properties that would render a system compliant to this model. The paper emphasises the importance of such a common model for the credibility of the research community as well as to eliminate attempts to unnecessarily overload or blur the scope of the field. Keywords: Autonomic communication, autonomic networks, autonomic system definition. [ABSTRACT FROM AUTHOR]

This paper proposes an integrated network management framework for inter-domain outbound traffic engineering. The framework consists of three functional blocks (monitoring, optimization and implementation) to make the outbound traffic engineering adaptive to network condition changes such as inter-domain traffic demand variation, inter-domain routing changes and link failures. The objective is to keep the inter-domain link utilization balanced under any of these changes while reducing service disruptions and reconfiguration overheads. Simulation results demonstrate that the proposed framework can achieve better load balancing with less service disruptions and re-configuration overheads in comparison to alternative approaches. [ABSTRACT FROM AUTHOR]

In the case of next generation wireless networks, different users with various multi-homed personal wireless devices will aim to exploit the full potential of the choice of services and applications available over different radio access networks. In their selection of a certain radio access network consumers will consider money and delay preferences for the current application and will rely on intelligent network-selection decision strategies to aid them in their choice. This paper describes the evaluation of an intelligent utility-based strategy for network selection in a multi-access network situation for transfer of large non real-time data files. A number of scenarios are examined which compare the proposed network selection strategy against other possible strategies. Test results show how by using this network selection strategy significant benefits in terms of combined average delay and cost per file transferred as well as transfer efficiency are obtained. Keywords: Heterogeneous Wireless Networks, Multi-homed Radio Terminals, User-centric Network Selection. [ABSTRACT FROM AUTHOR]

Through the past years, several digital rights management (DRM) solutions for controlled dissemination of digital information have been developed using cryptography and other technologies. Within so many different solutions, however, interoperability problems arise, which increase the interest on integrated design and management of these technologies. Pursuing these goals, this paper presents a framework which aims at promoting interoperability among DRM systems, using a service-oriented architecture (SOA) and a high-level policy modeling approach. [ABSTRACT FROM AUTHOR]

Delivering innovative Internet services raises numerous business and technical challenges for providers. It actually requires building and managing complex, distributed architectures in order to reach the quality of service that is needed. In this paper, we argue that using edge computing in the domain of Internet services has a number of advantages. However, this approach relies on complex and hard to administrate environments. We believe that autonomic computing techniques constitute a key element for the dynamic management of edge servers. In the paper, we present an autonomic manager that meets the market needs and that has been tested in collaboration with Bull SA. [ABSTRACT FROM AUTHOR]

Many measurement studies of P2P file sharing systems suggest that the request rate for a file changes over time and the system is thus non-stationary. For this reason we study the population dynamics and the availability of a file in a BitTorrent-like file sharing system, when the arrival rate for file requests decreases exponentially. We study the system first by a deterministic fluid model and then by a more detailed Markov chain analysis that allows estimating the life time of a single chunk exactly. Simple approximation for the life time is also derived. In addition, we simulate the life time of a file consisting multiple chunks in order to verify the analytical results to be applicable also to a more complex system. [ABSTRACT FROM AUTHOR]

TCP is one of the main transmission protocols used in the Internet. It has also been recently observed that opening parallel TCP sessions might be of interest for a user in order to increase his overall average throughput. We suggest in this paper to charge users per TCP session, and we investigate the resulting game in a homogeneous context: how many sessions should each user open? Given the discrete (and even finite) space of strategies, we propose to implement a probabilistic adaptation algorithm, analyze its theoretical properties and provide numerical illustrations. [ABSTRACT FROM AUTHOR]

In this paper, we propose an open standard-based, intelligent service management platform that aims to provide a flexible and extensible platform for building intelligent home network services. To have greater flexibility and efficiency in managing home network services, we further propose an AAA proxy, a service provisioning, security agent, a sip proxy service, and others. We call this platform the IHSM (Intelligent Home Network Service Management) Platform, which consists of the ISMS (Intelligent Service Management System) and the ISMF (Intelligent Service Management Framework). [ABSTRACT FROM AUTHOR]

As the network technology has been developed, the Next Generation Internet (NGI) such as Internet2, KOREN, KREONET2 and etc has been deployed to support bandwidth of Giga bps. And, various applications such as the video conference, the tele-surgery and etc that require high bandwidth has been developed and operating on the NGI, especially KOREN and KREONET2 in Korea. When the applications are operating and happen to face some problems, various tools for traffic measurement are usually used to analyze them, and provide traffic information in each link on total flow path or other metrics such as end-to-end delay, jitter and etc in most cases. However, although with these tools most of network problems can be properly analyzed, the problem in the user's view point can not be resolved so that which part of networks and/or which ones among user's systems and nodes on the flow path cause the problems for the user's flow is not discriminated Therefore, this paper designs a end-to-end performance monitoring system for the user's flow that the user can access performance data for user's flow on the flow route, and describes the experience about deployment on KOREN. [ABSTRACT FROM AUTHOR]

In NGN, many transport-related technologies were considered. One technology discussed is ATM (Asynchronous Transfer Mode) based MPLS (Multi-protocol Label Switching) for its provisioning QOS (Quality Of Service) commitment, traffic management aspects and smooth migration to the BcN in Korea. In this paper, we present preventive congestion control mechanism that uses network signaling information for detecting and fuzzy control to a SC(Slim Chance) of LSP (Labeled Switched Path) in ATM based MPLS system. Proposed control can handle 208% call processing and more than 147% success call, than those without control. It can handle 187% BHCA (Busy Hour Call Attempts) with 100 times less use of exchange memory. Keywords: Congestion, MPLS, BcN, NGN. [ABSTRACT FROM AUTHOR]

Many research works address detection and identification of network anomalies using traffic analysis. This paper considers large topologies, such as those of an ISP, with traffic analysis performed on multiple links simultan-eously. This is made possible by using a combination of simple online traffic parameters and specific data from headers of selective packets. Even though large networks may have many network links and a lot of traffic, the analysis is simplified with the usage of Principal Component Analysis (PCA) subspace method. The proposed method proves that aggregation of such traffic profiles on large topologies allows identification of a certain set of anomalies with high level of certainty. Keywords: Network anomalies, Anomaly detection, Anomaly identification, Principal component analysis, Traffic analysis. [ABSTRACT FROM AUTHOR]

Distributed fault management and event notification are essential in Inter-AS Traffic Engineering (TE). In this paper we design and implement distributed fault management for WBEM based inter-AS TE. We designed DMTF Managed Object Format (MOF) based Managed Object (MO) for fault management. Using the Event Model in standard Common Information Model (CIM) in DMTF WBEM we implemented fault indication and SNMP trap handling mechanisms in indication and SNMP providers accordingly on OpenPegasus [1]. We extended existing providers with new SNMP provider which is not supported by OpenPegasus WBEM, and SNMP manager functionalities. The detailed design and implementation of SNMP, indication, instance and other C++ based providers on OpenPegasus WBEM for inter-AS TE are explained. [ABSTRACT FROM AUTHOR]

This paper intends to introduce the development of a terminal agent for QoS measurement that is suitable for an NGN environment, and to summarize the results of its performance test. Using the terminal agent for service quality measurement, it is possible to measure the QoE-based end-to-end service quality of voice phone, video phone, and VoD services. In addition, the terminal agent, installed in the user terminal (IP-based audio and video phones), as a software or hardware chip, measures the quality index for voice and video related multimedia services, such as R-value, MOS value, call success rate, one-way delay, jitter, packet loss, resolution. The terminal agent also applies the packet capturing method when using the actual service, and analyzes SIP, RTP, and RTCP protocol headers of the received packet. When the terminal agent was implemented in the IP video phone and compared with the performance of a general QoS measurement tool, there were barely any errors in the measurement value. It has also been identified that end-to-end service quality management, which is close to QoE, was possible. Keywords: QoS, QoE, QoS Measurement, SQM(Service Quality Management). [ABSTRACT FROM AUTHOR]

In this paper, we propose the localized adaptive QoS routing scheme using POMDP(partially observable Markov Decision Processes) and Exploration Bonus. In order to deal with POMDP problem, we use CEA(Certainty Equivalency Approximation) technique that involves using the mean value of random variables, since it is intractable to determine the optimal solution. And we present a new path selection using the Exploration Bonus method in order to find detour path, which is better than current path and more adaptive to network environment. Also we evaluate performances of service success rate and average hop count which varies with φ and κ performance parameters, which are defined as exploration count and intervals. Keywords: Localized Adaptive QoS Routing, Reinforcement Learning, POMDP, Exploration Bonus, Certainty Equivalency Approximation, Edge-disjoint multi-path. [ABSTRACT FROM AUTHOR]

Despite the importance of seamless connectivity in ubiquitous computing, research for seamless connectivity has not been considered properly. To provide seamless connectivity, this paper proposes an application execution model for seamless services with an intelligent context-aware handoff scheme based on context information, such as user intentions and application requirements as well as issues of network layer. In this paper, we define several profiles reflecting various context informations and design basic modules organizing middleware architecture for seamless service management and efficient vertical handoff (VHO) management. Consequently, the proposed seamless service management with context-aware handoff scheme provides service continuity in ubiquitous computing environment by preventing unnecessary handoffs, changing application service modes adaptively, and eventually maintaining optimal network configuration. And also simulation results show about 38% enhanced performance in the processing rate, about 13% enhanced performance from service continuity, and about 29% enhanced performance in the processing time, compared with conventional schemes. [ABSTRACT FROM AUTHOR]

Traffic monitoring is essential for accounting user traffic and detecting anomaly traffic such as Internet worms or P2P file sharing applications. Since typical Internet traffic monitoring tools use only TCP/UDP/IP header information, they cannot effectively classify diverse application traffic, because TCP or UDP port numbers could be used by different applications. Moreover, under the recent deployment of firewalls that permits only a few allowed port numbers, P2P or other non-well-known applications could use the well-known port numbers. Hence, a port-based traffic measurement scheme may not provide the correct traffic monitoring results. On the other hand, traffic monitoring has to report not only the general statistics of traffic usage but also anomaly traffic such as exploiting traffic, Internet worms, and P2P traffic. Particularly, the anomaly traffic can be more precisely identified when packet payloads are inspected to find signatures. Regardless of correct packet-level measurement, flow-level measurement is generally preferred because of easy deployment and low-cost operation. In this paper, therefore, we propose a signature-aware flow-level traffic monitoring method based on the IETF IPFIX standard for the next-generation routers, where the flow format of monitoring traffic can be dynamically defined so that signature information could be included. Our experimental results show that the signature-aware traffic monitoring scheme based on IPFIX performs better than the traditional port-based traffic monitoring method. That is, hidden anomaly traffic with the same port number has been revealed. Keywords: signature, IPFIX, traffic measurement, flow, and security. [ABSTRACT FROM AUTHOR]