• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.5
• /
• pp.709-735
• /
• 2010

The reciprocal virtue of peer-to-peer networking has stimulated an explosion of peer population and service capacity, ensuring rapid content distribution in peer-to-peer networks. Critical issues such as peer churn, free riding, and skewed workload significantly affect performance results such as service agility, fairness, and resource utilization. To resolve these problems systematically, this study proposes a peer assignment scheme that supports fair peer-to-peer file sharing applications. The proposed scheme exploits the peer duality of both server-oriented peer capacity and client-oriented peer contribution. Accordingly, the system server can prioritize download requests and appropriately assign server peers to uploading file objects. Several functional extensions, including peer substitution and elimination, bandwidth adjustment, and distributed modification, help cope with subtle situations of service starvation and download blocking, and hence make the system design robust and amenable. Simulation results show this design is examined under both centralized and distributed peer-to-peer environments. Performance results confirm that the proposed mechanisms are simple but effective in maintaining service agility and fairness, without loss of overall service capacity in peer-to-peer files sharing systems.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.3
• /
• pp.357-366
• /
• 1994

The IEEE 802.4 token bus has been widely accepted as the standard for factory local area networks. The priority option of the 802.4 standard supports multiple classes of traffic by using a set of timers to control information exchange. The performance of the 802.4 priority mechanism in industrial real time control is examined. A timer assignment technique is presented for such applications. The timers are set to satisfy the worst case access delay requirements of real time control applications. Other applications that are not time constrainted can be supported simultaneously. In fact under certain conditions, such applications can also be guaranteed a minimum bandwidth allocation. Simulation results are used to evaluate the timer assignment and utililization.

• Proceedings of the IEEK Conference
• /
• 2000.06a
• /
• pp.131-134
• /
• 2000

Only MAC protocol can satisfy the service quality of the request of bandwidth, delay time, and cell loss at the same time and it is because MAC protocol provides mobile terminal an environment to use channel evenly and effectively This Paper has been adapted Mobile ATM Standardization of ETSI in maximum and used not only for practicing in-band signal to a priority order but also to the next reserved slot assignment of the dynamic frame. Also, by accepting VBR traffic more adaptively, the effectiveness of transmission channel has been maximized as well, and these are compared with the old way of it and analyzed to confirm the effectiveness.

• Journal of Communications and Networks
• /
• v.9 no.4
• /
• pp.368-376
• /
• 2007

The large potential bandwidth available in wavelength-division multiplexed optical networks makes this technology of crucial importance for satisfying the ever increasing capacity requirements of the next-generation Internet. In this scenario, the routing and wavelength assignment(RWA) problem that concerns determining the optical paths and wavelengths to be used for connection establishment in a wavelength-routed network, is still one of the most important open issues. In this paper we propose a new online dynamic grooming-capable RWA heuristic scheme working on wavelength division multiplexing(WDM) networks as a multistage selection process. The proposed algorithm is transparent with respect to the presence of wavelength converters, achieves very low connection rejection ratios with minimal computational complexity and is appropriate for the modern multilayer optical circuit and wavelength switched networks with sparse wavelength conversion capability.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.8
• /
• pp.1549-1560
• /
• 2009

In the TDMA PON system, the DBA is essential for ONUs to send data efficiently to the upstream. In this paper, we implement a DBA processor for the G-PON OLT with downstream and upstream rate, 2.5 and 1.25 Gbps, respectively, The processor collects bandwidth request messages from ONUs at every cycle time and allocates properly bandwidth to each Alloc-ID with considering priority and fairness for traffics. In the proposed DBA algorithm, one cycle time consists of multiple G-PON frames ($m{\times}125{\mu}s$) for high link efficiency. In particular, the link efficiency is higher because the algorithm adopts a method that an additional overhead is eliminated when an allocated bandwidth is laid between two G-PON frames for an ONU. This enables that the processor flexibly allocates the bandwidth from zero to the maximum link capacity for an ONU. The proposed DBA processor is implemented with the FPGA and shows bandwidth allocating processes for ONUs with logic analyzer.

• KIEE International Transaction on Electrical Machinery and Energy Conversion Systems
• /
• v.5B no.2
• /
• pp.189-195
• /
• 2005

This paper presents a new velocity estimation strategy for a non-salient permanent magnet synchronous motor drive without high frequency signal injection or special PWM pattern. This approach is based on the d-axis current regulator output voltage of the drive system, which contains the rotor position error information. The rotor velocity can be estimated through a rotor position tracking PI controller that controls the position error at zero. For zero and low speed operation, the PI gain of the rotor position tracking controller has a variable structure according to the estimated rotor velocity. Then, at zero speed, the rotor position and velocity have sluggish dynamics because the varying gains are very low in this region. In order to boost the bandwidth of the PI controller during zero speed, the loop recovery technique is applied to the control system. The PI tuning formulas are also derived by analyzing this control system by frequency domain specifications such as phase margin and bandwidth assignment.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.05a
• /
• pp.381-385
• /
• 2003

We consider the bandwidth parking problem arising from telecommunication networks The problem is to determine the set of calls to be routed and an assignment or them to the paths in arc capacitated network. The objective is to maximize profit. We formulate the problem as an integer programming and propose an algorithm to solve it. Column generation technique to solve the linear programming relxation is proposed with two types of columns in addition, to obtain an optimum integer solution, we consider a new branching strategy. Computational experiments show that the algorithm gives option at solutions within reasonably small time limits.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.5
• /
• pp.1733-1751
• /
• 2015

The IEEE 802.15.4 standard not only provides a maximum of seven guaranteed time slots (GTSs) for allocation within a superframe to support time-critical traffic, but also achieves ultralow complexity, cost, and power in low-rate and short-distance wireless personal area networks (WPANs). Real-time wireless body area sensor networks (WBASNs), as a special purpose WPAN, can perfectly use the IEEE 802. 15. 4 standard for its wireless connection. In this paper, we propose an adaptive GTS allocation scheme for real-time WBASN data transmissions with different priorities in consideration of low latency, fairness, and bandwidth utilization. The proposed GTS allocation scheme combines a weight-based priority assignment algorithm with an innovative starvation avoidance scheme. Simulation results show that the proposed method significantly outperforms the existing GTS implementation for the traditional IEEE 802.15.4 in terms of average delay, contention free period bandwidth utilization, and fairness.

• ETRI Journal
• /
• v.29 no.1
• /
• pp.116-119
• /
• 2007

In this letter, we design a collision resolution protocol for optical burst switching ring networks to avoid burst collision. We define the offset time condition for no burst transmission collision and manage the free time list of nodes for no burst reception collision. In order to improve the throughput, we use a fiber delay line, void-filling, and void-compression. This protocol does not require any additional procedures for bandwidth reservation such as centralized assignment of bandwidth, lightpath setup of WDM ring networks, or token capturing for the burst transmission. The simulation results show that the proposed protocol can achieve high throughput while saving 70% of wavelengths when compared to round robin with random selection, round robin with persistent, and round robin with non-persistent with only destination delay.

• Proceedings of the Optical Society of Korea Conference
• /
• 2009.02a
• /
• pp.307-308
• /
• 2009

To reduce delay for high priority packets in the ring-based EPON, the EPON packet classifier groups services as their priorities and frames for services are dynamically framed as their priorities. Since dynamic framing for a packet priority dynamically changes assignment spaces in the maximum framing packet size as network traffics, it makes services with high priority to improve quality of services with relative low threshold time for transmitting.