honeypot is a security device the value of which lies mainly in discovering and inspecting, being attacked and being at risk. most of the present honeypots are configured and installed on the network statically. in some cases considerations have been made on dynamic configuration of honeypots at the time of installation but still no study have been carried out on how to instantaneously change t...

Multiple classes of conventional and multimedia applications are expected to be supported by the emerging connection-oriented integrated-service networks, where bestefJort flows and quality-of-service (QoS) flows co-exist. We propose a novel two-level hierarchical scheduling algorithm, which provides an integrated, simple scheme to distribute the link bandwidth among a dynamic set of flows in t...

In a home network, there are multiple users each running different applications interacting with the network. To enhance the experience of each user, prioritization of various network applications is important. Previous solutions to this problem assigned priorities in a static manner. Even though there has been some efforts to assign priorities dynamically, these solutions only used interactivi...

This work addresses the interconnection of the IntServ and DiffServ models. In particular, new mapping mechanisms between the Controlled-Load service (CL) of the IntServ model and the Assured Forward (AF) Per-HopBehaviours group of the DiffServ model, are proposed and analysed by simulation. The proposed mechanisms have a dynamic nature and they are associated to an admission control such that ...

Urban congestion patterns have become ubiquitous and complex. Traditional, “static” approaches are no longer adequate for analyzing network flows and conducting minimum cost routing. This paper reports on a GIS-based decision support tool for modeling dynamic network congestion and conducting minimum cost routing. The system predicts network flows at a detailed level of temporal resolution, cap...

We represent a data network as a set of links shared by a dynamic number of competing flows. These flows are generated within sessions and correspond to the transfer of a random volume of data on a pre-defined network route. The evolution of the stochastic process describing the number of flows on all routes, which determines the performance of the data transfers, depends on how link capacity i...

Network flows that vary over time arise naturally when modeling rapidly evolving systems such as the Internet. In this paper, we continue the study of equilibria for flows over time in the single-source single-sink deterministic queuing model proposed by Koch and Skutella. We give a constructive proof for the existence and uniqueness of equilibria for the case of a piecewise constant inflow rat...

Distributed audio and video applications need to adapt to fluctuations in delivered quality of service (QoS). By trading off temporal and spatial quality to available bandwidth, or manipulating the playout time of continuous media in response to variation in delay, audio and video flows can be made to adapt to fluctuating QoS with minimal perceptual distortion. In this paper we introduce dynami...