Search

Banyan network plays an important role in today΄s broadband technology. One of the problem faced in the banyan network is the loss of packets and blocking probability. To address this problem, the concept of increasing the queue size to one is applied. The simulation is carried out for both cases i.e for normal queue size and increased queue size. The output obtained is used for plotting graph in MS-Excel. With the obtained graphs, the performance of the network for both cases and a report is prepared. This analysis provides a valuable analysis for network designers and operators in terms of network performance. [ABSTRACT FROM AUTHOR]

We investigate the problem of scheduling of file distribution from Road-Side Units (RSUs) to vehicles in an urban environment. We suppose one RSU exist in each cross-road and all RSUs are connected to each other through a high speed backbone. Since the number of vehicles as well as the number and size of files are potentially large, scalable scheduling is a challenge. We first chop each file into several segments. A vehicle may not be able to finish downloading all segments from a RSU, thus, our proposed algorithm allows it to continue its download from the next RSUs. We propose a scheduling algorithm in which each RSU implements two separate queues for: 1) download requests from the scratch and 2) resumed downloads. The data segment for distribution is chosen from aforementioned queues based on some scheduling policies. Simulation result shows that the proposed approach offer desirable performance and scalability. [ABSTRACT FROM AUTHOR]

The WiBro operates at the 2.3GHz broadband and the communication infrastructure is a cellular system. The WiBro is based on IEEE 802.16e standard and it is designed to maintain connectivity on mobile environment at a speed of up to 60 km/h. ACR(Access Control Router) manages several RAS(Radio Access Station). When mobile node moves to another domain from the present domain, which is managed by different ACR, MN sends Binding Update to HA (Home Agent) or CN (Correspondent Node). However ACR may be a single point of performance bottleneck because the ACR should not only handle signaling traffics but also process data tunneling traffic for all MNs registered in its domain. In this paper, we propose ACR load balancing method by priority queue. Quantitative results of the performance analysis show that our proposal has superior performance. [ABSTRACT FROM AUTHOR]

This article discusses how to use queue to make non-recursion algorithm of binary link tree. As for a general binary tree, if we adopt sequence storage, firstly we should extend it first into a complete binary tree, secondly we store it to a temporary queue according to the sequence of up-down and left-right. On the basis of the properties of the complete binary tree and the queue, if we can confirm every element in the queue, then we can find the left and right children of the element in the queue. When we recur these steps, we can create a binary link bit tree. This algorithm enriches the method from recursion to non-recursion. [ABSTRACT FROM AUTHOR]