• Title/Summary/Keyword: Bandwidth on Demand

Search Result 219, Processing Time 0.024 seconds

Design of 10-Gb/s Adaptive Decision Feedback Equalizer with On-Chip Eye-Opening Monitoring (온 칩 아이 오프닝 모니터링을 탑재한 10Gb/s 적응형 Decision Feedback Equalizer 설계)

  • Seong, Chang-Kyung;Rhim, Jin-Soo;Choi, Woo-Young
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.48 no.1
    • /
    • pp.31-38
    • /
    • 2011
  • With the increasing demand for high-speed transmission systems, adaptive equalizers have been widely used in receivers to overcome the limited bandwidth of channels. In order to reduce the cost for testing high-speed receiver chips, on-chip eye-opening monitoring (EOM) technique which measures the eye-opening of data waveform inside the chip can be employed. In this paper, a 10-Gb/s adaptive 2-tap look-ahead decision feedback equalizer (DFE) with EOM function is proposed. The proposed EOM circuit can be applied to look-ahead DFEs while existing EOM techniques cannot. The magnitudes of the post-cursors are measured by monitoring the eye of received signal, and coefficients of DFE are calculated using them by proposed adaptation algorithm. The circuit designed in 90nm CMOS technology and the algorithm are verified with post-layout simulation. The DFE core occupies $110{\times}95{\mu}m^2$ and consumes 11mW in 1.2V supply voltage.

An Energy Efficient Routing Protocol using MAC-layer resources in Mobile Ad Hoc Networks (이동 애드혹 네트워크에서 MAC 계층 자원을 이용한 에너지 효율 라우팅 프로토콜)

  • Yoo, Dae-Hun;Choi, Woong-Chul
    • Journal of the Korea Society of Computer and Information
    • /
    • v.12 no.6
    • /
    • pp.219-228
    • /
    • 2007
  • End-to-end path setup and maintenance are very important for mobile ad-hoc wireless communications, because of the mobility and the limited battery capacity of the nodes in the networks. the AODV routing protocol is the one of mary proposed protocols. However, there are route failure problem with the Proposed protocols between intermediate nodes due to such mobility and exhausted battery characteristics, and this is because only the shortest hop count is considered for the route setup. If route failure happens. Problem such as the waste of bandwidth and the increment of the energy consumption occur because of the discarding data packets in the intermediate nodes and the path re-setup process required by the source node. In addition, it obviously causes the network lifetime to be shortened. This paper proposes a routing protocol based on the AODV routing protocol that it makes use of the remaining energy, signal strength and SNR of the MAC layer resources to setup a path.

  • PDF

CDASA-CSMA/CA: Contention Differentiated Adaptive Slot Allocation CSMA-CA for Heterogeneous Data in Wireless Body Area Networks

  • Ullah, Fasee;Abdullah, Abdul Hanan;Abdul-Salaam, Gaddafi;Arshad, Marina Md;Masud, Farhan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.12
    • /
    • pp.5835-5854
    • /
    • 2017
  • The implementation of IEEE 802.15.6 in Wireless Body Area Network (WBAN) is contention based. Meanwhile, IEEE 802.15.4 MAC provides limited 16 channels in the Superframe structure, making it unfit for N heterogeneous nature of patient's data. Also, the Beacon-enabled Carrier-Sense Multiple Access/Collision-Avoidance (CSMA/CA) scheduling access scheme in WBAN, allocates Contention-free Period (CAP) channels to emergency and non-emergency Biomedical Sensors (BMSs) using contention mechanism, increasing repetition in rounds. This reduces performance of the MAC protocol causing higher data collisions and delay, low data reliability, BMSs packet retransmissions and increased energy consumption. Moreover, it has no traffic differentiation method. This paper proposes a Low-delay Traffic-Aware Medium Access Control (LTA-MAC) protocol to provide sufficient channels with a higher bandwidth, and allocates them individually to non-emergency and emergency data. Also, a Contention Differentiated Adaptive Slot Allocation CSMA-CA (CDASA-CSMA/CA) for scheduling access scheme is proposed to reduce repetition in rounds, and assists in channels allocation to BMSs. Furthermore, an On-demand (OD) slot in the LTA-MAC to resolve the patient's data drops in the CSMA/CA scheme due to exceeding of threshold values in contentions is introduced. Simulation results demonstrate advantages of the proposed schemes over the IEEE 802.15.4 MAC and CSMA/CA scheme in terms of success rate, packet delivery delay, and energy consumption.

Implementation of Web-based Information System for Full-text Processing (전문 처리를 위한 웹 기반 정보시스템 구현)

  • Kim, Sang-Do;Mun, Byeong-Ju;Ryu, Geun-Ho
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.6
    • /
    • pp.1481-1492
    • /
    • 1999
  • As Internet is popularized by the advent of Web concept having characteristics such as open network, user-friendly, and easy-usage, there are many changes in Information systems providing various information. Web is rapidly transferred traditional Information systems to Web-based Information systems, because it provides not only text information but also multimedia information including image, audio, video, and etc. Also, as information contents were changed from text-based simple abstract information to full-text information, there was appeared various document formats processing Full-text information. But, as they naturally demand large systems memory, long processing time, broader transmission bandwidth, and etc, estimating of these factors is necessary when constructing information systems. This paper focuses on how to design and construct information system processing full-text information and providing function of an integrated document. Primarily, we should review standard document format which is used or developed, and any document format is appropriate to process full-text information in review with viewpoint of information system. Also, practically we should construct information system providing full-text information based on PDF document.

  • PDF

A "GAP-Model" based Framework for Online VVoIP QoE Measurement

  • Calyam, Prasad;Ekici, Eylem;Lee, Chang-Gun;Haffner, Mark;Howes, Nathan
    • Journal of Communications and Networks
    • /
    • v.9 no.4
    • /
    • pp.446-456
    • /
    • 2007
  • Increased access to broadband networks has led to a fast-growing demand for voice and video over IP(VVoIP) applications such as Internet telephony(VoIP), videoconferencing, and IP television(IPTV). For pro-active troubleshooting of VVoIP performance bottlenecks that manifest to end-users as performance impairments such as video frame freezing and voice dropouts, network operators cannot rely on actual end-users to report their subjective quality of experience(QoE). Hence, automated and objective techniques that provide real-time or online VVoIP QoE estimates are vital. Objective techniques developed to-date estimate VVoIP QoE by performing frame-to-frame peak-signal-to-noise ratio(PSNR) comparisons of the original video sequence and the reconstructed video sequence obtained from the sender-side and receiver-side, respectively. Since processing such video sequences is time consuming and computationally intensive, existing objective techniques cannot provide online VVoIP QoE. In this paper, we present a novel framework that can provide online estimates of VVoIP QoE on network paths without end-user involvement and without requiring any video sequences. The framework features the "GAP-model", which is an offline model of QoE expressed as a function of measurable network factors such as bandwidth, delay, jitter, and loss. Using the GAP-model, our online framework can produce VVoIP QoE estimates in terms of "Good", "Acceptable", or "Poor"(GAP) grades of perceptual quality solely from the online measured network conditions.

Performance Analysis of SDR Communication System Based on MTD Technology (MTD 기법이 적용된 SDR 통신 시스템의 성능 분석)

  • Ki, Jang-Geun;Lee, Kyu-Tae
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.2
    • /
    • pp.51-56
    • /
    • 2017
  • With the rapid increase in the number of mobile terminals, demand for wireless technologies has sharply increased these days. While wireless communication provides advantages such as ease of deployment, mobility of terminals, continuity of session, and almost comparable transmission bandwidth to the wired communication, it has vulnerability to malicious radio attacks such as eavesdropping, denial of service, session hijacking, and jamming. Among a variety of methods of preventing wireless attacks, the MTD(Moving Target Defense) is the technique for improving the security capability of the defense system by constantly changing the ability of the system to be attacked. In this paper, in order to develop a resilient software defined radio communication testbed system, we present a novel MTD approach to change dynamically and randomly the radio parameters such as modulation scheme, operating frequency, packet size. The probability of successful attack on the developed MTD-based SDR communication system has been analysed in a mathematical way and verified through simulation.

Implementation and Performance Analysis of H.264/AVC Decoder System for Mobile Digital Broadcasting (이동형 디지털 방송을 위한 H.264/AVC 디코더 시스템의 구현 및 성능 분석)

  • Jung, Jin-Won;Song, Yong-Ho
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.44 no.10
    • /
    • pp.38-48
    • /
    • 2007
  • The increasing demand on the use of multimedia video contents drives more mobile embedded systems to incorporate H.264/AVC decoding capability. An H.264/AVC decoder often requires high computation bandwidth during its decoding phase. Depending upon processor computation capability and multimedia contents complexity, the decoder can be implemented either in hardware or software. However, without a thorough analysis on the Performance and resource requirements, it is difficult to choose a cost-effective methodology of implementing this codec. This paper presents both hardware and software implementation of H.264/AVC decoding subsystem in mobile embedded systems, and quantitatively analyses the performance and resource requirements. It also shows the methodology to identify performance bottleneck in Linux-based mobile embedded systems, which is in turn used to select feasible and efficient implementation methodology.

Channel Scheduling Policies for Batching in VOD System (VOD 시스템에서 일괄전송을 위한 채널 스케줄링 기법)

  • Park, Ho-Gyun;Yu, Hwang-Bin
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.2
    • /
    • pp.385-395
    • /
    • 1999
  • Video-On-demand system provides electronic video rental services from remote video servers on a broadband communication networks. When we assume some situation that serve the same video stream by batching, each time single video stream became available at server-end side, we face the problem that what video stream to be scheduled at what time instant. Hence, in order to manage the resource bandwidth which is different at each stream, the policy of channel allocation became important factor. In this work, we proposed three type of scheduling policies with queueing, as are cumulative Waiting Time(CWT), Mean Waiting Time(MWT) and Predictable Popular Factor(PPF). While CWT policy is good for popular video, MWT policy was good for non-popular video. Also, we know that PPT policy has some fairness for average wait time and reneging rate of user requests.

  • PDF

On Transmission Scheduling with Tuning-Limited Transmitters in WDM Star Networks (파장 분할 방식 성형 통신망에서 조정 제약을 갖는 전송기를 이용한 전송 스케줄링)

  • Choi, Hong-Sik;Lee, Kyung-Joon;Kim, Jin
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.2
    • /
    • pp.129-140
    • /
    • 2002
  • In this paper, we consider the problem of packet transmission in a wavelength division multiplexed(WDM) optical network. Our network model assumes that receivers are fixed-tuned and transmitters are tunable such that optical lasers assigned to transmitters have limited access to the network bandwidth: hence each node must be equipped with multiple optical lasers and/or multiple optical filters in order to maintain a single-hop network. We first analyze scheduling all-to-all packet transmissions and present optimum scheduling for all-to-all packet transmissions. We then extend the analysis to the case of arbitrary traffic demands. We show that the scheduling with arbitrary traffic demand is NP-hard. A heuristic algorithm based on list scheduling is presented. The upper bound so obtained is compared with the lower bound and provides performance guarantees with arbitrary demands. The result are applicable to arbitrary tuning delay, arbitrary number of wavelength channels and optical lasers of arbitrary tuning ranges.

GPU Based Incremental Connected Component Processing in Dynamic Graphs (동적 그래프에서 GPU 기반의 점진적 연결 요소 처리)

  • Kim, Nam-Young;Choi, Do-Jin;Bok, Kyoung-Soo;Yoo, Jae-Soo
    • The Journal of the Korea Contents Association
    • /
    • v.22 no.6
    • /
    • pp.56-68
    • /
    • 2022
  • Recently, as the demand for real-time processing increases, studies on a dynamic graph that changes over time has been actively done. There is a connected components processing algorithm as one of the algorithms for analyzing dynamic graphs. GPUs are suitable for large-scale graph calculations due to their high memory bandwidth and computational performance. However, when computing the connected components of a dynamic graph using the GPU, frequent data exchange occurs between the CPU and the GPU during real graph processing due to the limited memory of the GPU. The proposed scheme utilizes the Weighted-Quick-Union algorithm to process large-scale graphs on the GPU. It supports fast connected components computation by applying the size to the connected component label. It computes the connected component by determining the parts to be recalculated and minimizing the data to be transmitted to the GPU. In addition, we propose a processing structure in which the GPU and the CPU execute asynchronously to reduce the data transfer time between GPU and CPU. We show the excellence of the proposed scheme through performance evaluation using real dataset.