• 제목/요약/키워드: network time-delay

검색결과 1,471건 처리시간 0.032초

A LAN System Based on the Buffer Insertion Protocol (버퍼 삽입 프로토콜에 의한 LAN시스템에 관한 연구)

  • 권영수;강창언
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • 제11권1호
    • /
    • pp.16-24
    • /
    • 1986
  • The queueing delay and the response time of model of the buffer insertion LAN have been derived and its performance has been analyzed in terms of the throughput rate-response time characteristic. The results show that the response time can be improved by increasing the medium data rate, and that it can be reduced by 0.7 msec by transmitting the acknowledgement signal at the network interface unit(NIU) rather than at the hose, when the channel utilization is approximately 0.8. Also, implementation of the buffer insertion protocol has been studied.

  • PDF

System Performance and Traffic Control for the AAL Type 2 Traffic in IMT-2000 Networks (IMT-2000 망에서 AAL-2 구조의 트래픽 제어 및 시스템 성능)

  • Ryu, Byung-Han;Ahn, Jee-Hwan;Baek, Jang-Hyun
    • IE interfaces
    • /
    • 제13권2호
    • /
    • pp.178-187
    • /
    • 2000
  • In this paper, we investigate the system performance when the voice traffic is constructed as the ATM Adaptation Layer type 2(AAL-2) and then it is transmitted to the Base Station Controller(BSC) from the Base Station Transceiver Subsystem(BTS) through El link in International Mobile Telecommunication-2000 (IMT-2000) network. For this purpose, we first briefly describe the architecture of the BTS and the BSC, and then model it as a queueing network. By simulation study, we present the required processing time at traffic control blocks and the timeout time which should be set for multiplexing the user packets in the LIU(Line Interface Unit). Further, we evaluate the performance of physical links and the timeout probability that user packets can not be multiplexed within the established timeout time, and the multiplexing gain. Finally, we present the number of voice users who can be simultaneously admitted on one El link and 99.9% value of the transmission delay from the Radio Channel Element(RCE) to the Selector & Transcoder Subsystem(STS).

  • PDF

Data Central Network Technology Trend Analysis using SDN/NFV/Edge-Computing (SDN, NFV, Edge-Computing을 이용한 데이터 중심 네트워크 기술 동향 분석)

  • Kim, Ki-Hyeon;Choi, Mi-Jung
    • KNOM Review
    • /
    • 제22권3호
    • /
    • pp.1-12
    • /
    • 2019
  • Recently, researching using big data and AI has emerged as a major issue in the ICT field. But, the size of big data for research is growing exponentially. In addition, users of data transmission of existing network method suggest that the problem the time taken to send and receive big data is slower than the time to copy and send the hard disk. Accordingly, researchers require dynamic and flexible network technology that can transmit data at high speed and accommodate various network structures. SDN/NFV technologies can be programming a network to provide a network suitable for the needs of users. It can easily solve the network's flexibility and security problems. Also, the problem with performing AI is that centralized data processing cannot guarantee real-time, and network delay occur when traffic increases. In order to solve this problem, the edge-computing technology, should be used which has moved away from the centralized method. In this paper, we investigate the concept and research trend of SDN, NFV, and edge-computing technologies, and analyze the trends of data central network technologies used by combining these three technologies.

Application Layer Multicast Tree Constructing Algorithm for Real-time Media Delivery (실시간 미디어 전송을 위한 응용계층 멀티캐스트 트리 구성 알고리즘)

  • Song Hwangjun;Lee Dong Sup
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • 제29권11B
    • /
    • pp.991-1000
    • /
    • 2004
  • This paper presents an application layer multicast tree constructing algorithm to minimize the average time delay from the sender to end-systems for the effective real-time media delivery. Simultaneously, the proposed algorithm takes into account the computing power and the network condition of each end-system as a control variable and thus avoids the undesirable case that loads are concentrated to only several end-systems. The multicast tree is constructed by clustering technique and modified Dijkstra's algorithm in two steps, i.e. tree among proxy-senders and tree in each cluster. By the experimental results, we show that the proposed algorithm can provide an effective solution.

Multiuser Resource Allocation Scheme Considering Link Layer Effective Capacity in OFDMA Systems (직교 주파수 분할 다원 접속 시스템에서 실효 링크 계층 용량을 고려한 다중 사용자 자원 할당 기법)

  • Sung Si-Hwan;Yoo Myung-Sik;Shin Yo-An;Lee Won-Cheol
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • 제31권6B호
    • /
    • pp.508-516
    • /
    • 2006
  • The explosive growth of wireless network users and the existence of various wireless services have demanded high rate throughput as well as user's QoS guarantees. Towards this, this paper proposes QoS-oriented subcarrier allocation scheme considering the QoS provisioning of multiple users, which is major requirement for wireless network design point of view. This paper introduces joint RR/K&H combined with M-LWDF(Modified Largest Weighted Delay First) scheme throughout observing statistical channel behavior and real time queuing analysis for appropriate resource allocation tightly connected to multiuser scheduling. Accordingly, the system throughput can be enhanced, and the QoS demanded for delay sensitive services can be satisfied. Furthermore, the proposed scheme is applied for OFDMA(Orthogonal Frequency Division Multiple Access) systems to allocate sub-carriers in optimal way. The simulation results verify plausible performances of proposed resource allocation scheme via showing superior effective capacity under time-varying physical-layer channel behaviors.

The Performance Analysis for Call Processing of the IMS Based Multimedia Service In BcN (BcN에서 IMS기반 멀티미디어 서비스의 호 처리 성능 분석)

  • Lee, Dong-Hyeon;Kim, Hyun-Jong;Choi, Seong-Gon
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • 제45권5호
    • /
    • pp.117-124
    • /
    • 2008
  • In this paper, the call setup performance of the CSCF(Call Session Control function) that manages the session control in providing the IMS(IP Multimedia subsystem)-based multimedia service in the BcN(Broadband convergence Network) is analyzed. While the performance related with the call/session of the SIP-Based voice service is analysed, the study for the call recessing performance of the IMS-based multimedia service is insufficient. In this paper, as, the processing capacity and subscriber number of CSCF were changed, the call setup delay time according to the session setup procedure of IMS was measured using the M/M/1 queuing model and OPNET simulation. The experimental results show that the sudden increased delay showed up in case the session establishment requirement ratio of total users over 13% of the CSCF processing capacity. Therefore, the user number and capacity of CSCF suitable for the session establishment delay threshold can be calculated or estimated.

Fast Switching of a Polymer-networked Twisted Nematic Liquid Crystal Cell (폴리머 네트워크가 형성된 TN 액정셀의 고속응답 특성)

  • Jin, Hye-Jung;Kim, Ki-Han;Baek, Jong-In;Kim, Jae-Chang;Yoon, Tae-Hoon
    • Korean Journal of Optics and Photonics
    • /
    • 제21권2호
    • /
    • pp.69-73
    • /
    • 2010
  • We propose a method to enhance the response time of a twisted nematic liquid crystal (TN-LC) cell using an anisotropic polymer. Polymer networks are formed by the phase separation between a LC and a UV-curable polymer. A TN-LC cell is exposed to UV light after the mixture of LC and anisotropic polymer is injected into the TN-LC cell. As a result, turn-off time of a TN-LC cell can be decreased remarkably without any loss of the transmittance. The turn-off time of a TN-LC cell with pure LC was 16 ms, but those of polymer networked TN-LC cells were 12, 11, and 9 ms when the concentration of the polymer was 3, 5, and 10 wt%, respectively. Moreover, by virtue of the polymer network, the backflow effect and the delay time generated during the turn-off process disappeared.

Traffic Signal Control Scheme for Traffic Detection System based on Wireless Sensor Network (무선 센서 네트워크 기반의 차량 검지 시스템을 위한 교통신호제어 기법)

  • Hong, Won-Kee;Shim, Woo-Seok
    • Journal of Institute of Control, Robotics and Systems
    • /
    • 제18권8호
    • /
    • pp.719-724
    • /
    • 2012
  • A traffic detection system is a device that collects traffic information around an intersection. Most existing traffic detection systems provide very limited traffic information for signal control due to the restriction of vehicle detection area. A signal control scheme determines the transition among signal phases and the time that a phase lasts for. However, the existing signal control scheme do not resolve the traffic congestion effectively since they use restricted traffic information. In this paper, a new traffic detection system with a zone division signal control scheme is proposed to provide correct and detail traffic information and decrease the vehicle's waiting time at the intersection. The traffic detection system obtains traffic information in a way of vehicle-to-roadside communication between vehicles and sensor network. A new signal control scheme is built to exploit the sufficient traffic information provided by the proposed traffic detection system efficiently. Simulation results show that the proposed signal control scheme has 121 % and 56 % lower waiting time and delay time of vehicles at an intersection than other fuzzy signal control scheme.

A Cell Shaping Scheme using Traffic Characteristics in ATM Network (ATM Network에서 트래픽 특성에 의한 셀 쉐이핑)

  • Yoon, Seok-Hyun
    • KSCI Review
    • /
    • 제15권1호
    • /
    • pp.17-23
    • /
    • 2007
  • The change of traffic by the CDV is entered in a condensed form in UPC/NPC, overflowing the buffer of the net and possibly causing its congestion. For this reason this paper proposes the Cell Spacing Scheme. As the Cell Spaing Scheme. two method is proposed; RAT based on the time in which cells enter the spacer and RDT based on the time in which cells come out from the spacer. This Paper Proposes the improved spacing sheme in which the departure time of the present cell determines the departure time of the next one, by combining with Leaky Bucket and using the traffic characteristics of ATM network.

  • PDF

Deadline-Aware Routing: Quality of Service Enhancement in Cyber-Physical Systems (사이버물리시스템 서비스 품질 향상을 위한 데드라인 인지 라우팅)

  • Son, Sunghwa;Jang, Byeong-Hoon;Park, Kyung-Joon
    • KIPS Transactions on Computer and Communication Systems
    • /
    • 제7권9호
    • /
    • pp.227-234
    • /
    • 2018
  • Guaranteeing the end-to-end delay deadline is an important issue for quality of service (QoS) of delay sensitive systems, such as real-time system, networked control system (NCS), and cyber-physical system (CPS). Most routing algorithms typically use the mean end-to-end delay as a performance metric and select a routing path that minimizes it to improve average performance. However, minimum mean delay is an insufficient routing metric to reflect the characteristics of the unpredictable wireless channel condition because it only represents average value. In this paper, we proposes a deadline-aware routing algorithm that maximizes the probability of packet arrival within a pre-specified deadline for CPS by considering the delay distribution rather than the mean delay. The proposed routing algorithm constructs the end-to-end delay distribution in a given network topology under the assumption of the single hop delay follows an exponential distribution. The simulation results show that the proposed routing algorithm can enhance QoS and improve networked control performance in CPS by providing a routing path which maximizes the probability of meeting the deadline.