This paper proposes a method of improving the efficiency of P2P(peer-to-peer) content sharing services like BitTorrent using the network information in the mobile ad hoc network (MANET) environment. While many papers focus on P2P information dissemination and searching in the MANET environment, this paper focuses on the P2P data delivery strategy. This strategy involves peer selection and piece selection methods. The existing peer selection method uses hop counts between peers. However, this method has the problem of being unable to reflect other network traffic conditions. Therefore, we use not only hop counts but also network status as a parameter. Moreover, we improve the existing LRF piece selection algorithm by considering peer topology. We show that our proposed methods improve P2P delivery performance over MANET through a simulation.

In this paper, we consider a nonblocking ATM switch with capacity C which adopts a hybrid priority control scheme in input buffers. Each input queue has two separate buffer spaces with different sizes for two classes of traffic, and adopts a general state-dependent scheduling scheme which assigns priorities to each class dynamically. We obtain the distribution of input queue length, loss probabilities and mean waiting times of two traffic classes using a semi-Markov process concept and compare the performances of various scheduling schemes. Numerical analysis and simulation indicate that the utilization of the switch with the hybrid priority control scheme satisfying the QoS of each traffic class is much higher than that of the switch without control. And, the required buffer size is reduced while satisfying the same QoS. Among the 5 scheduling schemes we have considered in this paper, the queue length threshold (QLT) scheme yields the highest utilization of the switch and has flexible performance which is adequate to satisfy, various values of QoS for two classes of traffics.

Analyzes the performance of a statistical multiplexer for heterogeneous types of bursty traffic in an asynchronous transfer mode (ATM) network. The authors model each type of bursty traffic with a Markov-modulated Poisson process (MMPP), and represent the different burstinesses of traffic by changing the parameters of the MMPP. Then, they use a finite queue multi-server model for analysis of the statistical multiplexer with multiple output channels. In order to consider the slottized operation of the ATM channel, they also assume that transmission of the cells queued in the buffer occurs at discrete time instants. With these traffic and system models they obtain the cell delay distribution and the cell blocking probability for the superposed heterogeneous types of bursty traffic. They also investigate the performance of each traffic separately by obtaining the cell delay and the cell blocking probability. From numerical results, they show the effects of each traffic's characteristic on the performance of the statistical multiplexer. According to these results, it is noted that some efficiencies might be effected by dividing those types of traffic with comparable burstiness into segregated groups and allocate bandwidth to them exclusively.>

Bandwidth allocation strategies with access restrictions for the integration of wideband (WB) and narrowband (NB) traffic in a broadband integrated services digital network (BISDN) are studied. Access restrictions are placed on both types of traffic to meet the grade of service required for each. The WB traffic is assumed nonqueuable, whereas the NB traffic may be queued. As an improved strategy, an access strategy which allows each type of traffic to use its bandwidth in the access-restricted region with the risk of being preempted by an arriving call for which the overflowed region is reserved is considered. Under this strategy, the preempted NB calls are queued at the head of a waiting room, and preempted WB calls are queued in another finite waiting room. The performance of these strategies is analyzed in terms of access delay for NB traffic and blocking probability for WB traffic by the matrix-geometric solution method. It is shown numerically that these strategies can easily be adapted to varying traffic loads by changing the restriction levels.>