• Title/Summary/Keyword: Server network bandwidth

Search Result 188, Processing Time 0.034 seconds

Design and Prototyping of Partial Connection Manager for Mobile Computing Service (이동 컴퓨팅 서비스를 위한 부분 연결 관리자의 설계 및 프로토타입핑)

  • Kim, Pyeong-Jung;Yun, Seok-Hwan;Jin, Seong-Il
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.6
    • /
    • pp.1932-1940
    • /
    • 2000
  • We must solve problems caused by mobile computing environments for supporting efficient mobile computing services. The problem is the use of wireless medium having high error rates and low bandwidth, and the sudden network disconnection to reduce the power consumption of a mobile host and the cost of the network connection. For these problems, we proposed the architecture of the partial connection manager and designed and implemented that in this paper. In particular, The partial connection manager creates the limited number of mobile agents according to priority and sends them in parallel to server systems and combines results of them process rapidly the user request. By applying the proposed partial connection manager to the mobile computing services called cybermarket, we knew that the mobile agent technique could be suited to the mobile computing environment and overcome the partial connection problem caused by eh mobile computing environment.

  • PDF

Field Test of VOD Service in Sasebo Research Center

  • Motsuke-GOTO;Tomoyoshi-MORIYAMA;Nobuyoshi-NINOKATA;Shinji-MIYANISHI;Hideo-KURODA
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 1999.06a
    • /
    • pp.183-190
    • /
    • 1999
  • We have started the field test of the VOD service since April 1996, in Huis Ten Bosch which is one of the famous theme parks in Japan. In three years, total about 100 thousands people have used this VOD system and evaluated it. This test verifies that the VOD system which provides moving picture by MPEG2 via broad bandwidth ATM network has already reached the level of actual use. And also we get the know-how to construct contents, or how to manage network resources and server resources, and we have proposed them.

Client-driven Music Genre Classification Framework (클라이언트 중심의 음악 장르 분류 프레임워크)

  • Mujtaba, Ghulam;Park, Eun-Soo;Kim, Seunghwan;Ryu, Eun-Seok
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2020.07a
    • /
    • pp.714-716
    • /
    • 2020
  • We propose a unique client-driven music genre classification solution, that can identify the music genre using a deep convolutional neural network operating on the time-domain signal. The proposed method uses the client device (Jetson TX2) computational resources to identify the music genre. We use the industry famous GTZAN genre collection dataset to get reliable benchmarking performance. HTTP live streaming (HLS) client and server sides are designed locally to validate the effectiveness of the proposed method. HTTP persistent broadcast connection is adapted to reduce corresponding responses and network bandwidth. The proposed model can identify the genre of music files with 97% accuracy. Due to simplicity and it can support a wide range of client hardware.

  • PDF

Adaptive Cache Maintenance Scheme based on Connection States in Mobile Computing Environments (이동 컴퓨팅 환경하의 연결 상태를 기반으로 한 적응적 캐쉬 유지 기법)

  • Nam, Sung-Hun;Cho, Sung-Ho;Hwang, Chong-Sun
    • Journal of KIISE:Information Networking
    • /
    • v.27 no.2
    • /
    • pp.149-159
    • /
    • 2000
  • In mobile computing environments, invalidation and propagation method based on broadcasting is used to transmit the information for cache maintenance of mobile hosts. Previous researches generally adopted invalidation method that easily adapts to the limited network bandwidth and the frequent disconnection. But the invalidation of frequently accessed data causes the contention on the wireless network with the increasing cache requests. Although the propagation method can reduce the cache requests, the high probability of broken message or loss of message is the main factor that degrades the system performance. To resolve these problems, we propose adaptive cache maintenance scheme that dynamically adjusts the broadcasting ratio of invalidation and propagation, according to the wireless network connection states. The proposed scheme broadcasts the propagation message in stable connection state, so it can reduce the cache requests and server response time. With the decreasing available network bandwidth by the frequent partial disconnection and disconnection, the proposed scheme dynamically increases the broadcasting ratio of the invalidation messages to minimize the broken message or the loss of message probability. Consequently, the proposed scheme resolves the problems which arise in the invalidation or propagation method in mobile computing environments.

  • PDF

An Improvement of the P2P Streaming Network Topology Algorithm Using Link Information (연결 정보를 이용한 P2P 스트리밍 네트워크 구조의 개선)

  • Lee, Sang-Hoon;Han, Chi-Geun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.5
    • /
    • pp.49-57
    • /
    • 2012
  • In P2P streaming management, peer's churning and finding efficient topology architecture optimization algorithm that reduces streaming delay is important. This paper studies a topology optimization algorithm based on the P2P streaming using peer's link information. The proposed algorithm is based on the estimation of peer's upload bandwidth using peer's link information on mesh-network. The existing algorithm that uses the information of connected links is efficient to reduce message overload in the point of resource management. But it has a risk of making unreliable topology not considering upload bandwidth. And when some network error occurs in a server-closer-peer, it may make the topology worse. In this paper we propose an algorithm that makes up for the weak point of the existing algorithm. We compare the existing algorithm with the proposed algorithm using test data and analyze each simulation result.

Design and Implement A Hybrid WebRTC Signalling Mechanism for Unidirectional & Bi-directional Video Conferencing

  • Naktal Edan;Ali Al-Sherbaz;Scott Turner
    • International Journal of Computer Science & Network Security
    • /
    • v.24 no.9
    • /
    • pp.186-194
    • /
    • 2024
  • WebRTC (Web Real-Time Communication) is a technology that enables browser-to-browser communication. Therefore, a signalling mechanism must be negotiated to create a connection between peers. The main aim of this paper is to create and implement a WebRTC hybrid signalling mechanism named (WebNSM) for video conferencing based on the Socket.io (API) mechanism. WebNSM was designed over different topologies such as simplex, star and mesh. Therefore it offers several communications at the same time such as one-to-one (unidirectional/bidirectional), one-to-many (unidirectional) and many-to-many (bi-directional) without any downloading or installation. In this paper, WebRTC video conferencing was accomplished via LAN and WAN networks, including the evaluation of resources in WebRTC like bandwidth consumption, CPU performance, memory usage, Quality of Experience (QoE) and maximum links and RTPs calculation. This paper presents a novel signalling mechanism among different users, devices and networks to offer video conferencing using various topologies at the same time, as well as other typical features such as using the same server, determining room initiator, keeping the communication active even if the initiator or another peer leaves, etc. This scenario highlights the limitations of CPU performance, bandwidth consumption and the use of different topologies for WebRTC video conferencing.

Multicast Group Partitioning Algorithm using Status or Receivers in Content Delivery WDM Network (콘텐츠 전달 WDM망에서 수신기의 상태를 고려한 멀티캐스트 그룹화 알고리즘)

  • Kyohong Jin;Jindeog Kim
    • Journal of Korea Multimedia Society
    • /
    • v.6 no.7
    • /
    • pp.1256-1265
    • /
    • 2003
  • Content Delivery Network(CDN) is a mechanism to deliver multimedia content to end users on behalf of web content providers. Provider's content is distributed from content server to a set of delivery platforms located at Internet Service Providers(ISPs) through the CDN in order to realize better performance and availability than the system of centralized provider's servers. Existing work on CDN has primarily focused on techniques for efficiently multicasting the content from content server to the delivery platforms or to end users. Multimedia contents usually require broader bandwidth and accordingly WDM broadcast network has been highly recommended for the infrastructure network of CDN. In this paper, we propose methods for partitioning a multicast group into smaller subgroups using the previous status of receivers. Through the computer simulation, we show that proposed algorithm are useful to reduce the average receiver's waiting time and the number of transmissions.

  • PDF

A Study on Estimating the Number of Users in e-Commerce Systems (전자상거래 시스템의 사용자 수 예측에 관한 연구)

  • Kim, Jeong-Su;Sea, Sang-Koo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.4 s.36
    • /
    • pp.259-274
    • /
    • 2005
  • In this paper, we propose a methodology to estimate the number of users in e-Commerce systems. There have been a lot of previous work under the closed-LAN system environment. But the study on the number of acceptable users in real network environment is hard to find in the literature. Our research applies a Hybrid Simulation by using QoS results for end-to-end high-speed Internet service, and experiments are performed with regard to LAN and WAN, network equipments, and various network bandwidth. As result of the experiments we observed that the response time of high-speed Internet service media(Wireless LAN, ADSL, Cable, VDSL) depends heavily on the sequence and depth of transactions and on the ratio of transactional and non-transactional interactions. That is, as the network and application get more loads, the number of acceptable users decreases. By adding a cache server and an L4 switch to the simulation model, we analysed the changes in the number of users and client response time.

  • PDF

A Study on Traffic Analysis and Hierarchical Program Allocation for Distributed VOD Systems (분산 VOD 시스템의 트래픽 분석과 계층적 프로그램 저장에 관한 연구)

  • Lee, Tae-Hoon;Kim, Yong-Deak
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.8
    • /
    • pp.2080-2091
    • /
    • 1997
  • It is generally recognized that Video On Demand (VOD) service will become a promising interactive service in the emerging broadband integrated services digital networks. A centralized VOD system, all programs are stored in a single VOD server which is linked to each user via exchanges, is applicable when a small number of users enjoys the VOD service. However, in case of large service penetration, it is very important to solve the problems of bandwidth and load concentrating in the central video server(CVS) and program transmission network. In this paper, the architecture of the video distribution service network is studied, then a traffic characteristics and models for VOD system are established, and proposed program allocation method to video servers. For this purpose, we present an analysis of program storage amount in each LVS(Local Video Server), transmission traffic volume between LVSs, and link traffic volume between CVS and LVSs, according to changing the related factors such as demand, the number of LVS, vision probability, etc. A method for finding out storage capacity in LVSs is also presented on the basis of the tradeoffs among program storage cost, link traffic cost, and transmission cost.

  • PDF

Building Low Delay Application Layer Multicasting Trees for Streaming Services (스트리밍 서비스를 위한 적은 지연의 응용계층 멀티캐스트 트리 구축)

  • Kim, Jong-Gyung
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.10
    • /
    • pp.20-26
    • /
    • 2008
  • The quality of stream remaking is decided the load of a server and Jitter through the traffic of the transmission path between end to end. In order to improve these problems in this paper, I propose tree construction method of low-delay-level-multicast. In this case which the network congestion will be occurred by streaming quality, I also propose the technique which dynamically changes the transmission path. This technique first constructs the overlay structure for relaxing the overload of server. Secondly, in order to decrease Jitter of client, it makes upload bandwidth and low latency balanced. In the evaluation of the performance, this paper showed better enhancement of about $15%{\sim}24%$ than P2CAST[4] in the simulation about node average join count, average bandwidth, service request refusal ratio, RTT measurement of nodes, and node average join count by defect ratio.