• Title/Summary/Keyword: Internet Bandwidth

Search Result 825, Processing Time 0.039 seconds

Internet Information Service using Telephony and Fax, ITC-CSCC’2000

  • Jang, Young-Gun;Cho, Kyoung-Hwan
    • Proceedings of the IEEK Conference
    • /
    • 2000.07b
    • /
    • pp.691-694
    • /
    • 2000
  • This paper is addressed to Internet telephony based service implementation. It describes an implementation method which uses ARS as a gateway which combines Internet and traditional public switched telephone network for Internet information service using telephony and fax, is different to traditional Internet telephony which provide enhanced speech quality and low cost functionality. This method allows telephony and/or fax user to get Internet information without additional Internet bill, Internet infrastructure and low connection quality from low signal bandwidth connected him. Implemented system is useful to a special kind information service such as climate information of Korea etc and simpler than WAP based service as for wireless mobile telephony user. We implement job opportunity information and advertisement service supported by Home page of Choong Book Small & Medium Business Administration and e-mail service supported by Korean Society for Rehabilitation of persons with Disabilities to demonstrate the system ability. As a result of test implementation, this service system works good fur blind persons and graduated persons without job, is expected to apply for special Internet information provider via Voice and Fax.

  • PDF

Excess Bandwidth Fair Queueing Using Excess Bandwidth Consumer Queue (잉여 대역폭 소비 큐를 이용한 잉여 대역폭 페어 큐잉)

  • 추호철;김영한
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.39 no.10
    • /
    • pp.1-10
    • /
    • 2002
  • Scheduling technology is one of the most important elements required to support the Qos(quality of service) in the Internet and a lot of scheduling algorithms have been developed. However, most of there algorithms are not flexible in the distribution of the excess bandwidth. In order to improve the weakness of existing algorithms, DGPS(decoupled generalized processor sharing)has suggested recently. But, the DGPS algorithm is complex to implement and difficult to apply to the existing algorithms. In this paper, we propose a scheduling algorithm for distribution of the excess bandwidth which improves the implementation complexity of the DGPS and easy to be applied to ordinary algorithms.

The Behavior of TCP over ATM with limited bandwidth (대역폭의 제한을 받는 TCP over ATM의 특성)

  • Lee, Jin-Woo;Park, Ki-Tae;Kim, Jin-Tae;Kim, Hyung-Lae;Park, In-Kap
    • Journal of IKEEE
    • /
    • v.1 no.1 s.1
    • /
    • pp.176-184
    • /
    • 1997
  • The Asynchronous Transfer Mode(ATM) networks are being adopted as backbones over various parts of Internet. Also, TCP is one of the most widespread transport protocols, nowdays. It can be used with ATM. But, TCP shows poor end-to-end performance on ATM networks. Effective throughput of TCP over ATM can be quite low when cells are dropped at the congested ATM switch. The low throughput is due to wasted bandwidth as congested link transmits cells from corrupted packets. This paper examines the behavior of TCP over ATM with limited bandwidth in a broadband environment. As multiple VBR sources occupies most of the available bandwidth, there has been a starvation effect, so TCP sources couldn't get the chance of transmitting data. Also, throughput is proportional to the amount of buffer.

  • PDF

A Study on the Required Frequency Bandwidth for Personal Environment Service (개인환경서비스를 위한 주파수 소요대역폭에 대한 연구)

  • Oh, Jong-Taek
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.11A
    • /
    • pp.898-903
    • /
    • 2009
  • In this paper, the required frequency bandwidth for short range communications and mobile communication networks is analyzed for the matured Personal Environment Service, which establishes intelligent personal living environment with connecting the mobile phone and living appliances to WPAN, mobile communication networks, and Internet. In spite of rough estimation of the service needs, this paper shows the calculation method of required frequency bandwidth for the service and the considerations for the Ubiquitous era in advance.

Differentiated Charging for Elastic Traffic

  • Lee, Hoon;Yoon Uh;Eom, Jong-Hoon;Hwang, Min-Tae;Lee, Yong-Gi
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.26 no.12C
    • /
    • pp.190-198
    • /
    • 2001
  • In this paper, the authors propose methods for determining the differentiated price for elastic traffic in IP (Internet Protocol) network. First, we investigate the behavior in the consumption of bandwidth of elastic traffic in IP network. Next, we propose a method to relate the bandwidth usage with the pricing for the elastic traffic, which is based partially or fully on the usage rate of the network bandwidth. After that, we propose a charging function for elastic traffic, which is based on the de facto usage of the bandwidth. Finally, we will illustrate the implication of the work via simple numerical experiments.

  • PDF

Security Clustering Algorithm Based on Integrated Trust Value for Unmanned Aerial Vehicles Network

  • Zhou, Jingxian;Wang, Zengqi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.4
    • /
    • pp.1773-1795
    • /
    • 2020
  • Unmanned aerial vehicles (UAVs) network are a very vibrant research area nowadays. They have many military and civil applications. Limited bandwidth, the high mobility and secure communication of micro UAVs represent their three main problems. In this paper, we try to address these problems by means of secure clustering, and a security clustering algorithm based on integrated trust value for UAVs network is proposed. First, an improved the k-means++ algorithm is presented to determine the optimal number of clusters by the network bandwidth parameter, which ensures the optimal use of network bandwidth. Second, we considered variables representing the link expiration time to improve node clustering, and used the integrated trust value to rapidly detect malicious nodes and establish a head list. Node clustering reduce impact of high mobility and head list enhance the security of clustering algorithm. Finally, combined the remaining energy ratio, relative mobility, and the relative degrees of the nodes to select the best cluster head. The results of a simulation showed that the proposed clustering algorithm incurred a smaller computational load and higher network security.

A Study on a Packet Forwarding Scheme based on Interworking Architecture (연동 구조 기반의 패킷 포워딩 기법에 대한 연구)

  • Kim, Seok-Hoon;Ryoo, In-Tae
    • Journal of Internet Computing and Services
    • /
    • v.6 no.3
    • /
    • pp.97-106
    • /
    • 2005
  • Generally, network QoS is determined by timeliness, bandwidth, and reliability, As IT technologies are growing day by day, the bandwidth and reliability factors are expected to be able to satisfy user's requirements. The timeliness factor, however, has not fully met user's requirements yet. In this paper, we propose a packet forwarding scheme named POSIA (Packet forwarding Scheme based on Interworking Architecture) that can provide quite a good QoS (quality of service) by minimizing processing time which is the major part of the timeliness factor. Based on path and resource reservation mechanism, the proposed POSIA makes routers on the packet forwarding path synchronize with each other and then forward packets, The POSIA has been verified to outperform the existing MPLS packet forwarding scheme through computer simulations using OPNET.

  • PDF

Improvement of Underlay Cooperative Cognitive Networks Bandwidth Efficiency under Interference and Power Constraints

  • Al-Mishmish, Hameed R.M.;Preveze, Barbaros;Alkhayyat, Ahmed
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.11
    • /
    • pp.5335-5353
    • /
    • 2019
  • The definition of the bandwidth efficiency (BE) of cognitive cooperative network (CCN) is the ratio between a number of the licensed slot(s) or sub-channel(s) used by the unlicensed users to transmit a single data packet from the unlicensed transmitter to unlicensed destination, and from unlicensed relay(s) to unlicensed destination. This paper analyzes and improves the BE in the underlay CCN with a new reactive relay selection under interference and power constraints. In other words, this paper studies how unlicensed cooperative users use the licensed network slot(s) or sub-channel(s) efficiently. To this end, a reactive relay selection method named as Relay Automatic Repeat Request (RARQ) is proposed and utilized with a CCN under interference and power constraints. It is shown that the BE of CCN is higher than that of cooperative transmission (CT) due to the interference and power constraint. Furthermore, the BE of CCN is affected by the distance of the interference links which are between the unlicensed transmitter to the licensed destination and unlicensed relay to the licensed destination. In addition, the BE for multiple relays selection over a CCN under interference and power constraints is also analyzed and studied, and it is shown that the BE of CCN decreases as the number of relays increases.

An Efficient Cell Control Scheme for Internet Traffic Service in PNNI Networks (PNNI 망에서 인터넷 트래픽 서비스를 위한 효율적 셀 제어 기법)

  • Kim Byun-Gon
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.12
    • /
    • pp.15-21
    • /
    • 2004
  • The Guaranteed Bandwidth Rate scheme has been designed to accomodate non-real-time applications, such as Internet based traffic in Pm networks. The Guaranteed Bandwidth Rate scheme not only guarantees a minimum throughput at the frame level, but also supports a fair share of available resources. In this paper, we propose a cell control algorithm which can improve the fairness and the throughput through the traffic control in PM networks. For the evaluation of the proposed scheme, we compare proposed scheme with the existing scheme in the fairness and the throughput. Simulation results show that proposed scheme can improve the fairness and throughput than the existing scheme.

Rate Adaptation for HTTP Video Streaming to Improve the QoE in Multi-client Environments

  • Yun, Dooyeol;Chung, Kwangsue
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.11
    • /
    • pp.4519-4533
    • /
    • 2015
  • Hypertext Transfer Protocol (HTTP) adaptive streaming has become a new trend in video delivery. An HTTP adaptive streaming client needs to effectively estimate resource availability and demand. However, due to the bitrate of the video encoded in variable bitrate (VBR) mode, a bitrate mismatch problem occurs. With the rising demand for mobile devices, the likelihood of cases where two or more HTTP adaptive streaming clients share the same network bottleneck and competing for available bandwidth will increase. These mismatch and competition issues lead to network congestion, which adversely affects the Quality of Experience (QoE). To solve these problem, we propose a video rate adaptation scheme for the HTTP video streaming to guarantee and optimize the QoE. The proposed scheme estimates the available bandwidth according to the bitrate of each segment and also schedules the segment request time to expedite the response to the bandwidth variation. We used a multi-client simulation to prove that our scheme can effectively cope with drastic changes in the connection throughput and video bitrate.