The fundament of managing P2P traffic is identifying various P2P flows accurately. Although many P2P flows identification methods are presented nowadays, there are no ideas for either integrating these independent met...The fundament of managing P2P traffic is identifying various P2P flows accurately. Although many P2P flows identification methods are presented nowadays, there are no ideas for either integrating these independent methods together or being extended fast to support new method. In this work, an extensible P2P flows identification architecture (EPFIA for short) is proposed. In order to identify many specific P2P flows, EPFIA uses many different identification methods simultaneously, and obtains the highest efficiency via adjusting their identification sequence. An online mechanism of renewing identification methods is designed, which can extend new identification method without compiling the whole program. Applying policy mechanism, identification methods can be updated, started and halted remotely. The experiment results of running the prototype system show us that EPFIA could effectively promote the performance of system and support online renew P2P identification methods and manage them remotely.展开更多
We consider an MX/G/1 queueing system with two phases of heterogeneous service and Bernoulli vacation schedule which operate under a linear retrial policy. In addition, each individual customer is subject to a control...We consider an MX/G/1 queueing system with two phases of heterogeneous service and Bernoulli vacation schedule which operate under a linear retrial policy. In addition, each individual customer is subject to a control admission policy upon the arrival. This model generalizes both the classical M/G/1 retrial queue with arrivals in batches and a two phase batch arrival queue with a single vacation under Bernoulli vacation schedule. We will carry out an extensive stationary analysis of the system, including existence of the stationary regime, embedded Markov chain, steady state distribution of the server state and number of customer in the retrial group, stochastic decomposition and cMculation of the first moment.展开更多
文摘The fundament of managing P2P traffic is identifying various P2P flows accurately. Although many P2P flows identification methods are presented nowadays, there are no ideas for either integrating these independent methods together or being extended fast to support new method. In this work, an extensible P2P flows identification architecture (EPFIA for short) is proposed. In order to identify many specific P2P flows, EPFIA uses many different identification methods simultaneously, and obtains the highest efficiency via adjusting their identification sequence. An online mechanism of renewing identification methods is designed, which can extend new identification method without compiling the whole program. Applying policy mechanism, identification methods can be updated, started and halted remotely. The experiment results of running the prototype system show us that EPFIA could effectively promote the performance of system and support online renew P2P identification methods and manage them remotely.
基金Supported by Department of Science and Technology, Govt. of India through Project No.:SR/S4/MS:229/04
文摘We consider an MX/G/1 queueing system with two phases of heterogeneous service and Bernoulli vacation schedule which operate under a linear retrial policy. In addition, each individual customer is subject to a control admission policy upon the arrival. This model generalizes both the classical M/G/1 retrial queue with arrivals in batches and a two phase batch arrival queue with a single vacation under Bernoulli vacation schedule. We will carry out an extensive stationary analysis of the system, including existence of the stationary regime, embedded Markov chain, steady state distribution of the server state and number of customer in the retrial group, stochastic decomposition and cMculation of the first moment.
