• Title/Summary/Keyword: traffic assignment

Search Result 254, Processing Time 0.022 seconds

Timed Petri Net Based Approach for Elevator Group Controls

  • Cho, Young-Cheol;Zavarin Gagov;Kwon, Wook-Hyun
    • Transactions on Control, Automation and Systems Engineering
    • /
    • v.2 no.2
    • /
    • pp.121-129
    • /
    • 2000
  • In this paper, an optimal group control for elevator systems is proposed with timed Petri net based approach. Elevator system is modeled by time Petri nets and hall call response times are estimated with moment generating functions (MGFs) methos, which is applicable to real traffic patterns. Two assignment policies are proposed to satisfy the demands of passengers(i.e. hall/car calls) and to handle exceptional situations. In addition, optimal algorithms are implementated to minimize cost functions. THe performances of the elevator system employing the proposed algorithms are compared with each others in ways of several performance measures by a computer simulation.

  • PDF

A Study on Adaptable Dynamic Slot Assignment for QoS guarantee of VBR traffic using In-band Parameter in Wireless ATM Networks (무선 ATM에서 VBR 트래픽의 QoS 보장을 위한 In-Band 파라미터를 이용한 적응적 슬롯 할당에 관한 연구)

  • Jun, Chan-Yong;Lim, Myoung-Ju;Kim, Young-Chul
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2001.04b
    • /
    • pp.1161-1164
    • /
    • 2001
  • 본 논문에서는 무선 ATM 망에서 VBR(Variable Bit Rate) 트래픽의 QoS(quality of Service)를 보장하고 무선 채널의 효율성을 극대화 할 수 있는 새로운 적응적 슬롯 할당 알고리즘인 In-VDSA를 제안한다. 제안된 알고리즘에서는 ATM 셀 헤더 부분의 GFC(Generic Flow Field) 필드 상에 단말기의 버퍼 상태를 부호화하여 piggybacking하는 방식을 채택하였으며 다음 프레임에 할당할 슬롯의 개수를 기존의 다른 방식과는 달리 유동적으로 조절하여 할당함으로써 단말기의 셀 손실이나 지연에 대한 QoS를 보장하고 채널 이용 효율을 높일 수 있었다. 제안된 알고리즘은 BONeS tool을 이용한 시뮬레이션을 통하여 기존의 방식과 비교 분석한 결과 그 정당성을 확인하였다.

  • PDF

Adaptive GTS allocation scheme with applications for real-time Wireless Body Area Sensor Networks

  • Zhang, Xiaoli;Jin, Yongnu;Kwak, Kyung Sup
    • 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.

Datacenter-Oriented Elastic Optical Networks: Architecture, Operation, and Solutions

  • Peng, Limei;Sun, Yantao;Chen, Min;Park, Kiejin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.11
    • /
    • pp.3955-3966
    • /
    • 2014
  • With the exponentially increasing Internet traffic and emergence of more versatile and heterogeneous applications, the design of datacenter networks (DCNs) is subject to unprecedented requirements for larger capacity and more flexible switching granularities. Envisioning Optical-Orthogonal Frequency Division Multiplexing (O-OFDM) as a promising candidate for such a scenario, we motivate the use of O-OFDM as the underlying switching technology in order to provide sufficient switching capacity and elastic bandwidth allocation. For this purpose, this article reviews the recent progresses of DCN deployment and assesses the scenario where the O-OFDM transmission and switching technology is employed in the underlying transport plane. We discuss the key issues of the datacenter-oriented O-OFDM optical networks, and in particular, elaborate on a number of open issues and solutions including system interconnection architecture, routing and resource assignment, survivability, and energy-efficiency.

Resource Reservation Scheme for Handoff Calls in the CDMA Cellular System using Multiple Frequency Channels (다중 주파수 채널을 사용한는 CDMA 셀룰러 이동통신시스템에서 핸드오프호를 위한 예약 할당 방법)

  • 권수근;전형구;조경록
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.34S no.8
    • /
    • pp.1-9
    • /
    • 1997
  • Soft handoff provided in CDMA cellular system has much advantage such as better service quality, interference control and low call dropping probability. In this paepr, we propose an optimum resource reservationscheme for handoff calls in the CDMA cellular system to increase the soft handoff probability in handoff. In the proposed scheme, resources of each frquency channel are reserved for handoff according to the number of its neighbot cells serving the same frequency channel. A performance analysis shows that the soft handoff probability of the proposed scheme is higher than that of conventional scheme disregarding the condition of frquency assignment of neighbot cells, and that ever frequency channel served by neighbor cells should reserve more than one traffic channel for handoff to get good performance.

  • PDF

A heuristic algorithm for wavelength assignment in bidirectional WDM ring (양방향 WDM 환형망의 파장 할당 휴리스틱 알고리즘)

  • 조철희;박영일
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.8B
    • /
    • pp.1487-1492
    • /
    • 2000
  • WDM SHR has advantages compared to SDH SHR in both cost and capacity But, wavelengths should be carefully assigned not to clash with each other and the number should be minimum. In this study, a heuristic algorithm, which is efficient in practical situations where the traffic pattern is not full-mesh or more than one wavelength is required for connecting some specific nodes, is suggested. The performance of the suggested algorithm is compared with that of the convential algorithm.

  • PDF

Study on a Neural DSA Algorithm for QoS of VBR Traffic in the Wireless ATM Networks (무선 ATM망에서 VBR 트래픽 QoS 보장을 위한 Neural DSA 알고리즘에 관한 연구)

  • Jun, Chan-Yong;Lee, Tae-Won;Kim, Young-Chul
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2000.10b
    • /
    • pp.1071-1074
    • /
    • 2000
  • 본 연구는 멀티미디어 트래픽의 하나인 VBR(Variable Bit Rate) 서비스를 위한 무선 단말기의 효율적인 채널 사용을 위한 무선 ATM MAC(Medium Access Control) 프로토콜에 관한 연구이다. 현재 유선망에서는 멀티미디어 서비스를 위하여 ATM 기술을 사용하고 있기 때문에 유무선망의 통합을 위한 ATM 무선망의 설계가 대두되고 있다. 이를 위해서는 무선망이 가지는 대역폭의 한계와 링크의 높은 에러율을 극복하기 위해서 효율적인 MAC 알고리즘 개발이 필요하다. 본 논문에서는 무선 ATM망에서 VBR 트래픽 소스를 갖는 단말기의 QoS를 보장하고 채널 사용의 효율을 높이기 위하여 신경망을 이용한 Neural DSA(Dynamic Slot Assignment) 알고리즘을 제안하고 시뮬레이션을 통해 기존에 제안된 MAC 알고리즘과 성능 비교 분석을 통해 그 우수성을 확인하였다.

  • PDF

The Forwarding Channel of a BTS in IS-95 CDMA Cellular Network

  • Kwag, Min-kok;Jung, Duk-in;Shin, In-Cheol
    • Proceedings of the IEEK Conference
    • /
    • 2000.07b
    • /
    • pp.990-994
    • /
    • 2000
  • The design of LAI(Local Area Identifier), the first paging area for searching the mobile terminal has a close relation with the performance of paging channel in CDMA cellular network. This paper discusses the performance of the forward channel of IS-95 CDMA standard, known as the paging through the related messages such as call control message, channel assignment message. Modeling and simulation work were conducted to quantify the performance of paging channel in terms of traffic handling capacity and blocking levels. This result serves as illustrative guidelines for the proper engineering of common control channel, which has a major impact on the overall performance of cellular network.

  • PDF

Experiment of VoIP Transmission with AMR Speech Codec in Wireless LAN (무선랜 환경에서 AMR 음성부호화기를 적용한 VoIP 전송 실험)

  • Shin, Hye-Jung;Bae, Keun-Sung
    • Speech Sciences
    • /
    • v.11 no.4
    • /
    • pp.67-73
    • /
    • 2004
  • Packet loss, jitter, and delay in the Internet are caused mainly by the shortage of network bandwidth. It is due to queuing and routing process in the intermediate nodes of the packet network. In the Internet whose bandwidth is changing very rapidly in time depending on the number of users and data traffic, controlling the peak transmission bit-rate of a VoIP. system depending on the channel condition could be very helpful for making use of the available network bandwidth. Adapting packet size to the channel condition can reduce packet loss to improve the speech quality. It has been shown in [1] that a VoIP system with an AMR speech codec provides better speech quality than VoIP systems with fixed rate speech codecs. With the adaptive codec mode assignment. algorithm proposed in [1], in this paper, we performed the voice transmission experiments using the wireless LAN through the real Internet environment. Experimental results are analyzed and discussed with our findings.

  • PDF

Polynomial Time Algorithm for Satellite Communications Scheduling Problem with Capacity Constrainted Transponder

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.6
    • /
    • pp.47-53
    • /
    • 2016
  • This paper deals with the capacity constrained time slot assignment problem(CTSAP) that a satellite switches to traffic between $m{\times}n$ ground stations using on-board $k{\leq}_{min}\{m,n\}$ k-transponders switching modes in SS/TDMA time-division technology. There was no polynomial time algorithm to solve the optimal solution thus this problem classified by NP-hard. This paper suggests a heuristic algorithm with O(mn) time complexity to solve the optimal solution for this problem. Firstly, the proposed algorithm selects maximum packet lengths of $\({mn \atop c}\)$ combination and transmits the cut of minimum packet length in each switching mode(MSMC). In the case of last switching mode with inefficient transmission, we applies a compensation strategy to obtain the minimum number of switching modes and the minimum makespan. The proposed algorithm finds optimal solution in polynomial time for all of the experimental data.