• Title/Summary/Keyword: packet data

Search Result 1,644, Processing Time 0.04 seconds

Optimal Time Slot Assignment Algorithm for Combined Unicast and Multicast Packets

  • Lee, Heyung-Sub;Joo, Un-Gi;Lee, Hyeong-Ho;Kim, Whan-Woo
    • ETRI Journal
    • /
    • v.24 no.2
    • /
    • pp.172-175
    • /
    • 2002
  • This paper considers a packet-scheduling algorithm for a given combined traffic of unicast and multicast data packets and proposes a hybrid router with several dedicated buses for multicast traffic. Our objective is to develop a scheduling algorithm that minimizes schedule length for the given traffic in the hybrid router. We derive a lower bound and develop an optimal solution algorithm for the hybrid router.

  • PDF

Performance Improvement of ISDN AO/DI System with Buffering Scheme (ISDN AO/DI 시스템에서 버퍼링 기능 구현으로 인한 성능 향상)

  • Jeong, Jong-Min;Lee, Goo-Yeon
    • Journal of Industrial Technology
    • /
    • v.20 no.B
    • /
    • pp.227-232
    • /
    • 2000
  • ISDN AO/DI provides efficient communication. It dynamically allocates channels for bandwidth, which is key component for packet data communication. In this paper, we analyze performance improvement of ISDN AO/DI system with buffering scheme and compare with AO/DI system without buffering scheme. From the simulation of AO/DI with buffering scheme, we see that the required bandwidth is less than of the AO/DI system without buffering scheme.

  • PDF

Packet switched WDM backbone network designing regarding detour route (대체 경로를 고려한 패킷교환 방식의 WOM 기간망 설계ml 대한 연구)

  • 이순화;김경민;김장복
    • Proceedings of the IEEK Conference
    • /
    • 2002.06a
    • /
    • pp.247-250
    • /
    • 2002
  • It is predicted that the existing backbone network has encountered its limit due to massive growth in data traffic. Perhaps new WDM methods utilizing optical fibers are desirable. Also to assure reliance of the network detour routes fur collision recovery must be considered. But due to the redundancy occurred by allocating bandwidths to the detour route, the efficiency of the link my decline. In this paper, we designed a detour route to minimize the redundancy.

  • PDF

An Architecture for Home Gateway for Efficient Packet Process (효율적인 패킷 처리를 위한 홈 게이트웨이 구조)

  • 조경연;최광호
    • Proceedings of the IEEK Conference
    • /
    • 2002.06a
    • /
    • pp.101-104
    • /
    • 2002
  • In this parer, a novel architecture for Home gateway is Proposed. In home network system, there exist many different kinds of data types, like audio, video, and control information. And the communication is over multiple networks, like bluetooth, wireless LAN, USB, IEEE1394, and Power Line Communication (PLC). The hardware architecture of the Home gateway presented in this paper is based on ISO/1EC JTC 1/sc 2S/WG 1(1,2). The architecture proposed in this paper takes into account the characteristics of home network environment, so the Packets in the home network system can be processed very efficiently.

  • PDF

The Performance Improvement of Collective Communication in MPICH-G2 through Packet Parallel Data Transfer (패킷단위 병렬데이터 전송을 통한 MPICH-G2 집합통신 성능향상)

  • 이정희;한동수
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.10a
    • /
    • pp.361-363
    • /
    • 2003
  • 본 논문에서는 MPICH-G2의 집합 통신 중 가장 많이 이용되고 있는 브로드캐스트 함수의 통신 속도를 개선함으로써 분산 자원들의 통신속도를 높여 컴퓨팅 능력을 증가시켜주는 효과를 도모한다. 성능향상의 방법으로 패킷단위의 부분 데이터 송수신과 한 노드에서 여러 노드로 동시에 전송하는 두 가지 방법을 이용하였다. 제안된 방식을 사용했을 경우의 얻어지는 효과를 분석한 결과 데이터가 나뉘어진 패킷 수 p, 노드 수 n일 때, O(p$\times$n)에서 O(P+n)로의 성능향상을 나타냈고. bandwidth가 작은 노드로 인해 발생하는 병목현상이 감소되는 것을 확인하였다.

  • PDF

From the Absorption Profile to the Potential by a Time-dependent Inversion Method

  • 김화중;김영식
    • Bulletin of the Korean Chemical Society
    • /
    • v.18 no.12
    • /
    • pp.1281-1285
    • /
    • 1997
  • The time-dependent tracking inversion method is developed to extract the potential of the excited state from frequency-domain measurements, such as the absorption profile. Based on the relay of the regularized inversion procedure and time-dependent wave-packet propagation, the algorithm extract the underlying potential piece by piece by tracking the time-dependent data which can be synthesized from frequency-domain measurements. We have demonstrated the algorithm to extract the potential of excited state for a model diatomic molecule. Finally, we describe the merits of the time-dependent tracking inversion method compared to the time-dependent inversion and discuss several extensions of the algorithm.

Analysis of Optimized Aggregation Timing in Wireless Sensor Networks

  • Lee, Dong-Wook;Kim, Jai-Hoon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.3 no.2
    • /
    • pp.209-218
    • /
    • 2009
  • In a wireless sensor network(WSN) each sensor node deals with numerous sensing data elements. For the sake of energy efficiency and network lifetime, sensing data must be handled effectively. A technique used for this is data aggregation. Sending/receiving data involves numerous steps such as MAC layer control packet handshakes and route path setup, and these steps consume energy. Because these steps are involved in all data communication, the total cost increases are related to the counts of data sent/received. Therefore, many studies have proposed sending combined data, which is known as data aggregation. Very effective methods to aggregate sensing data have been suggested, but there is no means of deciding how long the sensor node should wait for aggregation. This is a very important issue, because the wait time affects the total communication cost and data reliability. There are two types of data aggregation; the data counting method and the time waiting method. However, each has weaknesses in terms of the delay. A hybrid method can be adopted to alleviate these problems. But, it cannot provide an optimal point of aggregation. In this paper, we suggest a stochastic-based data aggregation scheme, which provides the cost(in terms of communication and delay) optimal aggregation point. We present numerical analysis and results.

BRAIN: A bivariate data-driven approach to damage detection in multi-scale wireless sensor networks

  • Kijewski-Correa, T.;Su, S.
    • Smart Structures and Systems
    • /
    • v.5 no.4
    • /
    • pp.415-426
    • /
    • 2009
  • This study focuses on the concept of multi-scale wireless sensor networks for damage detection in civil infrastructure systems by first over viewing the general network philosophy and attributes in the areas of data acquisition, data reduction, assessment and decision making. The data acquisition aspect includes a scalable wireless sensor network acquiring acceleration and strain data, triggered using a Restricted Input Network Activation scheme (RINAS) that extends network lifetime and reduces the size of the requisite undamaged reference pool. Major emphasis is given in this study to data reduction and assessment aspects that enable a decentralized approach operating within the hardware and power constraints of wireless sensor networks to avoid issues associated with packet loss, synchronization and latency. After over viewing various models for data reduction, the concept of a data-driven Bivariate Regressive Adaptive INdex (BRAIN) for damage detection is presented. Subsequent examples using experimental and simulated data verify two major hypotheses related to the BRAIN concept: (i) data-driven damage metrics are more robust and reliable than their counterparts and (ii) the use of heterogeneous sensing enhances overall detection capability of such data-driven damage metrics.

BER performance analysis of successive interference cancellation(SIC) algorithm for W-CDMA HSDPA receiver (W-CDMA HSDPA수신기의 직렬간섭제거 알고리즘의 오류율 성능해석)

  • Koo Je-Gil
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.1
    • /
    • pp.13-22
    • /
    • 2004
  • This paper drives the exact expression of bit error rate(BER) performance for successive interference cancellation(SIC) algorithm against multipath interference components in a high-speed downlink packet access(HSDPA) system of W-CDMA downlink and the BER performance is evaluated by numerical analysis. Numerical results showed that the average BER performance is rapidly saturated in terms of increasing the number of multipath and is revealed significant improvement for improvement Processing gain(PG). For example, the average BER Performance of the SIC algorithm is superior to the performance of conventional scheme by more than 7dB and 1.4dB for processing gain PG=54 and 128 under the two-path channel and average BER=$1.0{\times}10^{-3}$, respectively. This results also indicated that the average BER saturation is occurred at nearly one weight factor which is assigned to pilot and data channels. Likewise, the average BER performance is greatly degraded due to increasing the interference power in proportional to the number of multipath with increasing multicode K. And the smaller multipath fading channel gain is arrived later, the more the average BER performance is improved. The results of performance analysis in this paper indicated that the multipath interference cancellation is required to improve the BER performance in a HSDPA system under multicode for high-speed packet transmission, low spreading factor, and multipath fading channel.

Performance Analysis of AAL2 Packet Dropping Algorithm using PDV on Virtual Buffer (PDV를 이용한 가상 버퍼상의 AAL2 패킷 폐기 알고리즘과 성능분석)

  • Jeong, Da-Wi;Jo, Yeong-Jong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.39 no.1
    • /
    • pp.20-33
    • /
    • 2002
  • Usage of ATM AAL2 packets becomes dominant to increase transmission efficiency of voice traffic in the backbone network. In case of voice service that uses AAL2 mechanism, if resources of network are enough, connection of new call is accepted. However, due to packets generated by the new call, transmission delay of packets from old calls can increase sharply. To control this behavior, in this paper we present an AAL2 buffer management scheme that allocates a virtual buffer to each call and after calculating its propagation delay variation(PDV), decides to drop packets coming from each call according to the PDV value. We show that this packet dropping algorithm can effectively prevent abrupt QoS degradation of old calls. To do this, we analyze AAL2 packet composition process to find a critical factor in the process that influences the end-to-end delay behavior and model the process by K-policy M/D/1 queueing system and MIN(K, Tc)-policy M/D/1 queueing system. From the mathematical model, we derive the probability generating function of AAL2 packets in the buffer and mean waiting time of packets in the AAL2 buffer. Analytical results show that the AAL2 packet dropping algorithm can provide stable AAL2 packetization delay and ATM cell generation time even if the number of voice sources increases dramatically. Finally we compare the analytical result to simulation data obtained by using the COMNET Ⅲ package.