• Journal of the Institute of Convergence Signal Processing
• /
• v.8 no.1
• /
• pp.39-43
• /
• 2007

In high speed communication networks, the determination of a transmission rate is critical for the stability of a closed-loop network system with the congestion control scheme. In ATM networks, the available bit rate (ABR) service is based on a feedback mechanism, i.e., the network status is transferred to the ABR source by a resource management (RM) cell. RM cells contain the traffic information of the downstream nodes for the traffic rate control. However, the traffic status of the downstream nodes can not be directly transferred to the source node in the IP based networks. In this paper, a new rate-based congestion control scheme using an exponential weighted moving average algorithm is proposed to build an efficient feedback control law for congestion avoidance in high speed communication networks. The proposed congestion control scheme assures the stability of switch buffers and higher link utilization of the network. Moreover, we note that the proposed congestion scheme can flexibly work along with the increasing number of input sources in the network, which results in an improved scalability.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.7
• /
• pp.1091-1097
• /
• 2022

In this paper, we implement the eXclusive OR-based Cast (XC) system that is a video streaming system using exclusive OR operations, and measure various performance metrics in wireless local area network (WLAN) environments. In addition, we investigate the performance improvement of the XC system considering various practical video streaming environments, while conventional studies analyzed the performance of XC through computer simulations in limited environments. To this end, we propose new control messages such as STR_REQ_MSG (SRM) that clients transmit to a video streaming server and STR_CON_MSG (SCM) that is used for the video streaming server to control the clients, and develop a new protocol by using the new control messages. According to the various measurement results using the implemented XC system, XC video streaming system can reduce the consumption of network bandwidth by 8.6% on average and up to 25% compared to the conventional video streaming system. In addition, the outage probability can be also reduced up to 76%.

• Journal of KIISE:Information Networking
• /
• v.27 no.4
• /
• pp.507-521
• /
• 2000

실시간 멀티미디어 서비스에서 Quality of Service(QoS) 보장의 필요성이 증가하고 있다. 멀티미디어 서비스 제공 형태의 대다수가 될 멀티캐스트 경로설정에서도 QoS 보장은 확장성 신뢰성과 함께 매우 중요한 문제이다. QoS 기반 코어 선택 알고리즘을 제안한다. 제안 알고리즈믄 멀티캐스트 경로설정에서 코어 선택시에 다중 QoS 제약조건을 고려한다. QoS 제약조건은 최소보장 대역폭, 종단 지연, 종단 지연변이 등으로 정의한다. 모의 실험결과는 제안한 QCSA와 Maximum Centered Tree(MCT) Average Centered Tree (ACT) Initial Delay-Constrained Shared Tree(Dcinitial) Random Tree(Random)등의 기존 코어 선택 알고리즘의 성능을 각 항목별로 비교한다 멀티캐스트 그룹 멤버수와 QoS 제약조건을 인자로 한 모의 실험 결과는 제안한 QoS 기반 코어 선택 알고리즘이 기존 코어 선택 알고리즘에 비해서 다중 QoS 제약조건 보장 코어 선택 성공률에서 성능 개선 효과를 가짐을 보여준다. 제안 알고리즘이 본 논문에서 설정한 모의 실험 환경에서는 QoS 기반 코어 선택의 정도를 나타내는 성공률에서 약 10% 정도 기존 알고리즘보다 우수함을 보인다. 이 결과는 제안 알고리즘이 코어 선택 과정의 초기부터 멀티캐스트 그룹내의 모든 멤버에 대한 다중 QoS 제약조건을 고려하는 점이 QoS 기반 코어 선택에서 개선 효과를 나타냄을 보여준다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.5
• /
• pp.444-460
• /
• 2009

In this paper, we propose an expanded patching technique in order to reduce the server network bandwidth requirements to support true VoD services in VoD Systems. Double Patching, which is a typical multicast technique, ensures that a long patching stream delivers not only essential video data for the current client but also extra video data for future clients. Since the extra data may include useless data, it results in server network bandwidth wastage. In order to prevent a server from transmitting useless data, the proposed patching technique uses a new kind of stream called a linking stream. A linking stream is transmitted to clients that have received short patching streams, and it plays a linking role between a patching stream and a regular stream. The linking stream enables a server to avoid transmitting unnecessary data delivered by a long patching stream in Double Patching, so the server never wastes its network bandwidth. Mathematical analysis shows that the proposed technique requires less server network bandwidth to support true VoD services than Double Patching. Moreover, simulation results show that it has better average service latency and client defection rate compared with Double Patching.

• Journal of Electrical Engineering and Technology
• /
• v.9 no.6
• /
• pp.2025-2035
• /
• 2014

The read range of UHF mobile readers can be extended by a booster for mobile RFID readers (BoMR). But in an environment where multiple BoMRs are installed, the read success rate may be decreased due to signal interference. This paper proposes three arbitration methods based on interference estimation with the purpose of enhancing the read success rate. A central arbitration server manages global information in centralized arbitration method (CAM) without broadcast/multicast communication facility. In fully distributed arbitration method (FDAM), all the arbitration messages are broadcasted from a BoMR to every BoMR, and each BoMR decides with broadcasted global information. Events in FDAM are serialized naturally with broadcasted messages. Cluster Distributed Arbitration Method (CDAM) forms clusters with multicasted BoMRs and a selected BoMR acts as an arbiter in the cluster. Such effects as lengthened read range, improved the read success rates of readers can be obtained by the proposed methods without any hardware modification. In order to evaluate the arbitration methods, the RFID system is modeled by using the DEVS formalism and simulated by using the DEVSim++.

• Journal of information and communication convergence engineering
• /
• v.7 no.4
• /
• pp.475-479
• /
• 2009

In ad hoc network, the scarce energy management of the mobile devices has become a critical issue in order to extend the network lifetime. Current research activity for the Minimum Energy Multicast (MEM) problem has been focused on devising efficient centralized greedy algorithms for static ad hoc networks. In this paper, we consider mobile ad hoc networks(MANETs) that could provide the reliable monitoring and control of a variety of environments for remote place. Mobility of MANET would require the topology change frequently compared with a static network. To improve the routing protocol in MANET, energy efficient routing protocol would be required as well as considering the mobility would be needed. In this paper, we propose a new method, the CACH(Context-aware Clustering Hierarchy) algorithm, a hybrid and clustering-based protocol that could analyze the link cost from a source node to a destination node. The proposed analysis could help in defining the optimum depth of hierarchy architecture CACH utilize. The proposed CACH could use localized condition to enable adaptation and robustness for dynamic network topology protocol and this provide that our hierarchy to be resilient. As a result, our simulation results would show that CACH could find energy efficient depth of hierarchy of a cluster.

• International journal of advanced smart convergence
• /
• v.5 no.3
• /
• pp.61-65
• /
• 2016

In the TV broadcasting, movie production and business the transportation of video between creators (programmers, studios) and distributors (broadcast and cable networks, cable and satellites companies) is still a mix of File Transfer Protocol (FTP), physical delivery, and expensive multicast satellite. Cloud-based file sync-and-share providers like Dropbox and box are playing an increasing role, but the industry's unique demands for speed and multicasting have fueled the growth of IP Video transport. This paper gives a solid grasp of the major elements of IP video technology, including content preparation, system architecture alternatives and network performance management.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.5
• /
• pp.2267-2285
• /
• 2016

Information Centric Networking that uses content name instead of IP address as routing identifier can handle challenges such as traffic explosion and user mobility, but it also suffers from scalability and incompatibility problems. In this paper by combining the concept of software defined networking and Internet end to end arguments, we propose a wide area deployable software defined information centric networking service model named SD-ICN. SD-ICN employs a dual space structure that separates edge service network and core transmission network. The enhanced SDN techniques are used in edge service network in order to implement intelligent data routing and caching, while traditional IP technique is reserved in core transmission network so as to provide wide area high speed data transmission. Besides, a distributed name resolution system based on the cooperation of different controllers is also presented. The prototype experiments in our campus network show that SD-ICN can be deployed in a scalable and incremental way with no modification of the core network, and can support typical communication modes such as multicast, mobility, multihoming, load balancing, and multipath data transmission effectively.

• Journal of Satellite, Information and Communications
• /
• v.1 no.1
• /
• pp.40-47
• /
• 2006

The next-generation mobile communication system are required to provide high-data-rate and high quality transmission over hostile radio channels. Orthogonal Frequency Division Multiplexing(OFDM) technique regarded as a most promising solution in mobile environment. This paper considers the issue of efficient subcarrier allocation for OFDM system in multi-service application. Proposed algorithm can consider channel gain of each service and divide subchannel. Proposed method considers priority of service and divide more subchannels in high priority service. When proposed algorithm compares with existent algorithm, the convergence rate improves and the calculation amount is decreased.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.11 no.4
• /
• pp.77-89
• /
• 2001

Recently, with the explosive growth of communication technologies, group oriented services such as teleconference and multi-player game are increasing. Access control to information is handled by secret communications with group keys shared among members, and efficient updating of group keys is vital to such secret communications of large and dynamic groups. In this paper, we employ (2,4)-tree as a key tree, which is one of height balanced trees, to reduce the number of key updates caused by join or leave of members. Especially, we use CBT(Core Based Tree) to gather network configurations of group members and reflect this information to key tree structure to update group keys efficiently when splitting or merging of subgroups occurs by network failure or recovery.