• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.6B
• /
• pp.495-507
• /
• 2006

In wireless local area networks (WLANs), the successful design of scheduling algorithm is a key factor in guaranteeing the various quality of service (QoS) requirements for the stringent real-time constraints of multimedia services. In this paper we propose a multipolling-based dynamic scheduling algorithm for providing delay guarantees to multimedia traffics such as MPEG streams. The dynamic algorithm exploits the characteristics of MPEG stream, and uses mini frames for feedback control in order to deliver dynamic parameters for channel requests from stations to the point coordinator (PC) operating at the access point (AP). In this scheme, the duration of channel time allocated to a station during a superframe is changed dynamically depending on the MPEG frame type, traffic load and delay bound of the frame, etc. Performance of the proposed scheme is investigated by simulation. Our results show that compared to conventional scheme, the proposed scheme is very effective and has high performance while guaranteeing the delay bound.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.12A
• /
• pp.1111-1119
• /
• 2005

A single fiber cut can potentially influence a total of 1.6 Tbps of traffic and is surprisingly frequent and results in significant loss of traffic. The survivability as we as the resource utilization of the connection in optical networks is important. Existing protection mechanisms to rapidly recover the failures allocate the backup path just SRLG-disjointed with working path. Those did not consider the unbalanced resource share of backup paths. The backup paths can be centralized on the specific link so that the idle resource is not used. As a result, as those do not efficiently use the resource the whole resource utilization is not so good. So we propose the mechanism to enhance the resources utilization as settling down the unbalanced resource share. Our purpose is to improve the link utilization as distributing the maximum link load.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.5
• /
• pp.1049-1068
• /
• 2011

In this paper a simple and effective call admission control (CAC) scheme is proposed for the emerging interleave-division multiple-access (IDMA) systems, supporting a variety of traffic types and offering different quality of service (QoS) requirements and priority levels. The proposed scheme is signal-to-interference-plus-noise ratio (SINR) evolution based CAC (SE-CAC). The key idea behind the scheme is to take advantage of the SINR evolution technique in the process of making admission decisions, which is developed from the effective chip-by-chip (CBC) multi-user detection (MUD) process in IDMA systems. By virtue of this semi-analytical technique, the MUD efficiency can be estimated accurately. Additionally, the computational complexity can be considerably reduced. These features make the scheme highly suitable for IDMA systems, which can combat intra-cell interference efficiently with simple CBC MUD. Analysis and simulation results show that compared to the traditional CAC scheme considering MUD efficiency as a constant, the proposed SE-CAC scheme can guarantee high power efficiency and throughput for multimedia traffic even in heavy load conditions, illustrating the high efficiency of CBC MUD. Furthermore, based on the SINR evolution, the SE-CAC can make accurate estimation of available resource considering the effect of MUD, leading to low outage probability as well as low blocking and dropping probability.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.1
• /
• pp.219-236
• /
• 2014

In this paper, we propose a novel Proxy Mobile IPv6 network bandwidth-efficient handoff scheme. MN are classified into slow and fast one. At first MN should be registered in the microcell for bandwidth efficient handoff scheme. microcell is overlapped to handle the overflow session request which is nested. Overflow session request in macrocell requests to go back from the boundary of the microcell to new microcell. If idle session traffic is in a cell, it is requested by the target microcell. Analysis model was developed, an existing session of the session blocking probability and forcing termination probability of the session request have improved considerably. If the total traffic load of the system is not very large, the proposed scheme has the best bandwidth efficiency and provides better quality of service (QoS) to MN without costs of a lot of processing on the system.

• Journal of Korea Multimedia Society
• /
• v.12 no.3
• /
• pp.419-426
• /
• 2009

The WiMedia Alliance has specified a Distributed Medium Access Control (D-MAC) protocol based on UWB for high speed wireless home networks and WPANs. The WiMedia D-MAC fundamentally removes the problems of the centralized MAC revealed at IEEE 802.15.3 MAC, by adopting a distributed architecture. However, there is no completely distributed method for allocating fair data rates to all traffic streams by considering each stream's QoS parameter. In this paper, a novel fair distributed QoS admission control method is proposed. The proposed method is a fair, adaptive QoS provisioning method, by allocating time slots to devices according to the current traffic load condition, through executing only a proposed single satisfaction of QoS (SoQ) algorithm at each device.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.5B
• /
• pp.421-429
• /
• 2006

In this paper, we suggest a new capability aware spanning tree(CAST) algorithm for Ethernet bridged network which consists of both legacy Ethernet bridges and synchronous Ethernet ones. The legacy spanning tree algorithm specified in IEEE 802.1D standard select root bridge and construct tree based on each bridge's identifier without consideration of each bridge's capability. Thus we note that if the legacy STP may assign a synchronous bridge as a root bridge, the bridge may become a bottleneck for asynchronous trafficbecause of bandwidth limitation for asynchronous traffic. In this paper, the CAST algorithm constructsmultiple spanning tree by using of bridge capability and makes different transmission path for each traffics, can removes this kind of defect. From the simulation results, we can see that the proposed CAST algorithm has better end-to-end delay performance than legacy spanning tree algorithm in high traffic load and multiple hops environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.6B
• /
• pp.405-413
• /
• 2012

WFQ(Weighted Fair Queuing) is the most popular fair queuing algorithm to guarantee the Quality-of-Service(QoS), but it has the inherent drawback of a poor resource utilization, particularly under the low rate traffic requiring a tight delay bound. It was recently identified that the poor utilization is mainly due to non-optimized latency of a traffic flow and then LOFQ(Latency-Optimized Fair Queuing) to overcome the drawback was introduced. The LOFQ algorithm, however, renews their optimal latencies for all flows whenever a new flow arrives, which results in the high implementation complexity of O($N^2$).This paper is to reduce thecomplexity to O(1). The proposed method is first to derive the optimal latency index function from the statistical QoS characteristics of the offered load, and then to simply calculate the optimal latency index of the arriving flow using the function.

• Journal of Korean Society of Steel Construction
• /
• v.12 no.2 s.45
• /
• pp.151-165
• /
• 2000

Since vehicles become large and heavy and traffic volume is increased rapidly, many fatigue damages have been reported in bridge members. In order to prevent fatigue damages of bridge members and maintain safety it is essential to perform rational fatigue check. Only one vehicle is loaded on a bridge deck for the fatigue design. But in reality it is seldom that only one vehicle passes on a bridge deck. Usually more than two vehicles are passing on a bridge deck simultaneously. Therefore, it is necessary to consider the influence of simultaneous loading for a rational fatigue design. In this study, the influence of simultaneous loading is investigated by performing stress variation analysis due to vehicle load on the basis of linear superposition method and Monte-Carlo simulation of traffic flow, and then calculating the measure of fatigue damages.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.3
• /
• pp.664-674
• /
• 1996

In high speed multi-wavelength networks, retransmission overhead due to desination conflict or control packet collision is one factor of performance degration because signal prpagation delay is much larger than the transmission time of data packet. In this paper, an efficient WDMA protocol with a collision avoidance mechanism is proposed for high speed WDM single-hop network with a passive star topology. In proposed protocol, each node has cource queues and routing table to store souting informatio. This architecture makes is possible to avoid any kind of collision when a node reserves the channel to transmit a data packet. High system thoughput and channel utilization can be achieved by proposed protocol since there are no discarded packets caused by any collision at transmission time. The performance of proposed protocol is evaluated in term of throughput and delay with variations in offered load. Simulation results show that the proposed protocol has superior performance to convertional protocols under nonuniform traffic as well as uniform traffic.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.4
• /
• pp.750-757
• /
• 2017

Recently, mobile internet traffic has rapidly increased as the huge increase of the smart phone and mobile devices. D2D get attention, because D2D is known that it reduce the traffic load of the base station and also improves the reliability of the network performance. However, D2D has a problem that the efficiency decreases as interference is increased. In this paper, we propose a resource allocation scheme to use the resources efficiently when the D2D link share the cellular resources in the cellular network based the uplink. D2D communication utilizes the location information for allocating resources when the eNB know the location of all devices. The proposed scheme select some cellular user using location informations in order to ensure performance of the D2D communication. and D2D link choose cellular user that performs resource allocation using only selected cellular user. Simulation results show optimal value of resource selection in order to ensure most performance of the D2D communication.