• Title/Summary/Keyword: network time-delay

Search Result 1,471, Processing Time 0.028 seconds

Performance Analysis of an ATM MUX with a New Space Priority Mechanism under ON-OFF Arrival Processes

  • Bang, Jongho;Ansari, Nirwan;Tekinay, Sirin
    • Journal of Communications and Networks
    • /
    • v.4 no.2
    • /
    • pp.128-135
    • /
    • 2002
  • We propose a new space priority mechanism, and analyze its performance in a single Constant Bit Rate (CBR) server. The arrival process is derived from the superposition of two types of traffics, each in turn results from the superposition of homogeneous ON-OFF sources that can be approximated by means of a two-state Markov Modulated Poisson Process (MMPP). The buffer mechanism enables the Asynchronous Transfer Mode (ATM) layer to adapt the quality of the cell transfer to the Quality of Service (QoS) requirements and to improve the utilization of network resources. This is achieved by "Selective-Delaying and Pushing-ln"(SDPI) cells according to the class they belong to. The scheme is applicable to schedule delay-tolerant non-real time traffic and delay-sensitive real time traffic. Analytical expressions for various performance parameters and numerical results are obtained. Simulation results in term of cell loss probability conform with our numerical analysis.

Handoff Processing for Mobile Agent in Distributed Environment (분산 환경에서의 이동 에이전트 핸드오프 처리)

  • Park, Ki-Hyun
    • The KIPS Transactions:PartC
    • /
    • v.8C no.6
    • /
    • pp.815-820
    • /
    • 2001
  • This paper presents a distributed mobile architecture aimed to support the mobility of mobile station. The proposed architecture considers three significant objects;mobile station (MS), mobile agent (MA) which logically represents mobile station in the wireline network, and trace agent (TA) to represent application server (AS) providing application service to mobile station. The mobile agent is made closely coupled with the mobile station while the trace agent is made closely coupled with the application server. During the handoff process, a flow control mechanism is considered to correct packet loss and out-of-sequence packets problem. The result of analytic additional time delay due to handoff processing is presented and simulation was performed to check the additional time delay as well as the correctness of handoff algorithm.

  • PDF

The Method of Handoff Using CLP on the WATM Network (무선 ATM에서 CLP를 이용한 핸드오프 방식)

  • 김준배;황재문;강경식
    • Journal of the Korea Society of Computer and Information
    • /
    • v.6 no.3
    • /
    • pp.44-49
    • /
    • 2001
  • In general. requirements for QoS are different according to the type of services in wireline and wireless ATM, and real-time video service is more sensitive to cell transmission delay than to cell loss. Existing handoff schemes emphasizing prevention of cell loss had limitations in cell transmission delay to satisfy QoS. In this paper, a novel scheme to transmit ATM cells with low CLP (when CLP = 0) prior to others and discarding cells with high CLP (when CLP = 1) in ATM cell header among cells to be forwarded during handoffs in real-time VBR service is proposed. The proposed scheme is proven to be suitable for the satisfaction of QoS and appropriate for fast handoffs by giving high CLP value to less meaningful MPEG frames through simulations.

  • PDF

Resource Allocation Method in High-Rate Wireless Personal Area Networks (고속 무선 PAN에서의 자원 할당 방식)

  • Kim, Byung-Seo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.8 no.1
    • /
    • pp.39-45
    • /
    • 2008
  • High-Rate Wireless Personal Area Networks (HR-WPANs) in IEEE 802.15.3 standard use a TIme Devision Multiple Access (TDMA) protocol to support isochronous traffic. Isochronous traffic requires a delay-bounded service. However, the HR-WPAN standard suffers from long access delay and association delay. In this paper, we propose an enhanced MAC protocol for the delay-bounded traffic. This proposed protocol provides a way that a central node is able to collect traffic status on all member nodes. Furthermore, by utilizing the information, a scheduling algorithm is also proposed in order to synchronize the instant of a packet transmission with that of the packet arrival. With the proposed protocol and algorithm, the delay of access and association can be reduced. Performance analysis is carried out and the significant performance enhancement is observed.

  • PDF

Performance Analysis of Opportunistic Spectrum Access Protocol for Multi-Channel Cognitive Radio Networks

  • Kim, Kyung Jae;Kwak, Kyung Sup;Choi, Bong Dae
    • Journal of Communications and Networks
    • /
    • v.15 no.1
    • /
    • pp.77-86
    • /
    • 2013
  • Cognitive radio (CR) has emerged as one of effective methods to enhance the utilization of existing radio spectrum. Main principle of CR is that secondary users (SUs) are allowed to use the spectrum unused by primary users (PUs) without interfering PU's transmissions. In this paper, PUs operate on a slot-by-slot basis and SUs try to exploit the slots unused by PUs. We propose OSA protocols in the single channel and we propose an opportunistic spectrum access (OSA) protocols in the multi-channel cognitive radio networks with one control channel and several licensed channels where a slot is divided into contention phase and transmission phase. A slot is divided into reporting phase, contention phase and transmission phase. The reporting phase plays a role of finding idle channels unused by PUs and the contention phase plays a role of selecting a SU who will send packets in the data transmission phase. One SU is selected by carrier sense multiple access / collision avoidance (CSMA/CA) with request to send / clear to send (RTS/CTS) mechanism on control channel and the SU is allowed to occupy all remaining part of all idle channels during the current slot. For mathematical analysis, first we deal with the single-channel case and we model the proposed OSA media access control (MAC) protocol by three-dimensional discrete time Markov chain (DTMC) whose one-step transition probability matrix has a special structure so as to apply the censored Markov chain method to obtain the steady state distribution.We obtain the throughput and the distribution of access delay. Next we deal with the multi-channel case and obtain the throughput and the distribution of access delay by using results of single-channel case. In numerical results, our mathematical analysis is verified by simulations and we give numerical results on throughput and access delay of the proposed MAC protocol. Finally, we find the maximum allowable number of SUs satisfying the requirements on throughput and access delay.

Trajectory Control of a Robot Manipulator by TDNN Multilayer Neural Network (TDNN 다층 신경회로망을 사용한 로봇 매니퓰레이터에 대한 궤적 제어)

  • 안덕환;양태규;이상효;유언무
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.18 no.5
    • /
    • pp.634-642
    • /
    • 1993
  • In this paper a new trajectory control method is proposed for a robot manipulator using a time delay neural network(TDNN) as a feedforward controller with an algorithm to learn inverse dynamics of the manipulator. The TDNN structure has so favorable characteristics that neurons can extract more dynamic information from both present and past input signals and perform more efficient learning. The TDNN neural network receives two normalized inputs, one of which is the reference trajectory signal and the other of which is the error signals from the PD controller. It is proved that the normalized inputs to the TDNN neural network can enhance the learning efficiency of the neural network. The proposed scheme was investigated for the planar robot manipulator with two joints by computer simulation.

  • PDF

Worst-case Guaranteed Scheduling Algorithm for HR-WPAN (HR-WPAN을 위한 Worst-case Guaranteed Scheduling Algorithm)

  • Kim, Je-Min;Lee, Jong-Kyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.5B
    • /
    • pp.270-276
    • /
    • 2007
  • The proposed LDS(Link-status Dependent Scheduling) algorithm in HR-WPAN(High Rate-Wireless Personal Area Network) up to now aims at doing only throughput elevation of the whole network, when the crucial device is connected with worst-link relatively, throughput of this device becomes aggravation. The proposed the WGS(Worst-case Guaranteed Scheduling) algorithm in this paper guarantees throughput of the device which is connected with worst-link in a certain degree as maintaining throughput of all devices identically even if a link-status changes, decreases delay of the whole network more than current LDS algorithm. Therefore proposed WGS algorithm in this paper will be useful in case of guaranteeing throughput of a device which is connected worst-link in a certain degree in a design of HR-WPAN hereafter.

Different QoS Constraint Virtual SDN Embedding under Multiple Controllers

  • Zhao, Zhiyuan;Meng, Xiangru;Lu, Siyuan;Su, Yuze
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.9
    • /
    • pp.4144-4165
    • /
    • 2018
  • Software-defined networking (SDN) has emerged as a promising technology for network programmability and experiments. In this work, we focus on virtual network embedding in multiple controllers SDN network. In SDN virtualization environment, virtual SDN networks (vSDNs) operate on the shared substrate network and managed by their each controller, the placement and load of controllers affect vSDN embedding process. We consider controller placement, vSDN embedding, controller adjustment as a joint problem, together considering different quality of service (QoS) requirement for users, formulate the problem into mathematical models to minimize the average time delay of control paths, the load imbalance degree of controllers and embedding cost. We propose a heuristic method which places controllers and partitions control domains according to substrate SDN network, embeds different QoS constraint vSDN requests by corresponding algorithms, and migrates switches between control domains to realize load balance of controllers. The simulation results show that the proposed method can satisfy different QoS requirement of tenants, keep load balance between controllers, and work well in the acceptance ratio and revenue to cost ratio for vSDN embedding.

Trajectoroy control for a Robot Manipulator by Using Multilayer Neural Network (다층 신경회로망을 사용한 로봇 매니퓰레이터의 궤적제어)

  • 안덕환;이상효
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.16 no.11
    • /
    • pp.1186-1193
    • /
    • 1991
  • This paper proposed a trajectory controlmethod for a robot manipulator by using neural networks. The total torque for a manipulator is a sum of the linear feedback controller torque and the neural network feedfoward controller torque. The proposed neural network is a multilayer neural network with time delay elements, and learns the inverse dynamics of manipulator by means of PD(propotional denvative)controller error torque. The error backpropagation (BP) learning neural network controller does not directly require manipulator dynamics information. Instead, it learns the information by training and stores the information and connection weights. The control effects of the proposed system are verified by computer simulation.

  • PDF

Efficient Seamless Handover Protocol in Network Mobility (NEMO) Environment (네트워크 이동성 환경에서 효율적인 Seamless 핸드오버 프로토콜)

  • Kim, Jong-Young
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.11
    • /
    • pp.173-178
    • /
    • 2011
  • In this paper, we propose an efficient seamless handover protocol in NEMO environment. Yokoda et al 4. proposed fast handover method with collaboration of access routers in local network and Teraoka et al. 1 showed fast handover method with collaboration of layers in mobile network. These methods can delay the time of overall binding update and increase packets loss when link of router is unstable because they transport packets through only one path or link of router. And they don't also mention redirection method of packets in their protocol in case of unstable link state of routers. The proposed protocol can execute fast binding update and reduce packets loss with collaboration of routers in mobile network.