• Journal of Communications and Networks
• /
• v.7 no.1
• /
• pp.65-75
• /
• 2005

In this paper, we consider a scenario in which the source has been offered QoS guarantees subject to token-bucket regulation. The rate of the source should be controlled such that it conforms to the token-bucket regulation, and also the distortion obtained is the minimum. We have developed an optimal scheduling algorithm for offline (like pre-recorded video) sources with convex distortion function and which can not tolerate any delay. This optimal offline algorithm has been extended for the real-time online source by predicting the number of packets that the source may send in future. The performance of the online scheduler is not substantially degraded as compared to that of the optimal offline scheduler. A sub-optimal offline algorithm has also been developed to reduce the computational complexity and it is shown to perform very well. We later consider the case where the source can tolerate a fixed amount of delay and derive optimal offline algorithm for such traffic source.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.4
• /
• pp.716-722
• /
• 2001

This paper has defined the 3G and beyond wireless networks as the one that is based on IP network architecture and proposed the congestion control scheme in the access networks. Basically the proposed method is built on the ECN(Explicit Congestion Notification) and utilizing the advantages of the wireless and I networks in broadcasting packet in their access network. Consequently it provides the efficiency in controlling the congestion that can be happened by the mobility support in the future wireless networks.

• Annual Conference of KIPS
• /
• 2012.11a
• /
• pp.910-913
• /
• 2012

통신기술의 발달과 스마트 폰의 급격한 보급으로 인하여 모바일 환경은 음성 데이터 기반의 환경에서 인터넷 데이터 기반의 환경으로 급격히 변화되었다. 이로 인하여 음성 서비스 처리 위주의 음성 데이터 기반 모바일 환경은 대용량 동영상 서비스, 인터넷, 메신저 등의 유선 네트워크 환경과 같은 다양한 서비스가 요구되는 환경으로 변화되었다. 이러한 환경 변화로 인하여 모바일 네트워크는 무선 네트워크상의 취약점 뿐 만 아니라 유선환경의 네트워크 취약점을 동시에 지니는 환경으로 변화되었고, 이로 인한 다양한 새로운 취약점들이 부각되기 시작하였다. 본 논문에서는 이와 같이 새롭게 부각되고 있는 모바일 Packet Switched Core Network(PSCN) 환경에서 Service Provider(SP)의 Service Recover로 인해 유발되는 Paging Table Denial of Service(PT-DoS)를 효율적으로 제어하기 위한 Delay Access Control(DAC) 기반의 QoS를 이용한 방법을 설계/구현하였다. 그리고 실험을 통해, PT-DoS를 차단하여 PSCN 공격을 미연에 방지하는 효과를 확인하였다.

• Journal of KIISE:Information Networking
• /
• v.34 no.6
• /
• pp.466-474
• /
• 2007

Asymmetric networks that the downlink bandwidth is larger than the uplink bandwidth may cause the degradation of the TCP performance due to the uplink congestion. In order to solve this problem, this paper designs and implements the Dynamic Segment Size Control mechanism which offers a suitable segment size for current networks. The proposed mechanism does not require any changes in customer premises but suppress the number of ACKs using segment reassembly technique to avoid the uplink congestion. The gateway which adapted the Dynamic Segment Size Control mechanism, detects the uplink congestion condition and dynamically measures the bandwidth asymmetric ratio and the packet loss ratio. The gateway reassembles some of segments received from the server into a large segment and transmits it to the client. This reduces the number of corresponding ACKs. In this mechanism, the SACK option is used when occurs the bit error during the transmission. Based on the simulation in the GEO satellite network environment, we analyzed the performance of the Dynamic Segment Size Control mechanism.

• Journal of Information Processing Systems
• /
• v.2 no.2
• /
• pp.107-113
• /
• 2006

It is essential to guarantee a handoff dropping probability below a predetermined threshold for wireless mobile networks. Previous studies have proposed admission control policies for integrated voice/data traffic in wireless mobile networks. However, since QoS has been considered only in terms of CDP (Call Dropping Probability), the result has been a serious CBP (Call Blocking Probability) unfairness problem between voice and data traffic. In this paper, we suggest a new admission control policy that treats integrated voice and data traffic fairly while maintaining the CDP constraint. For underprivileged data traffic, which requires more bandwidth units than voice traffic, the packet is placed in a queue when there are no available resources in the base station, instead of being immediately rejected. Furthermore, we have adapted the biased coin method concept to adjust unfairness in terms of CBP. We analyzed the system model of a cell using both a two-dimensional continuous-time Markov chain and the Gauss-Seidel method. Numerical results demonstrate that our CAC (Call Admission Control) scheme successfully achieves CBP fairness for voice and data traffic.

• Journal of Internet Computing and Services
• /
• v.6 no.5
• /
• pp.1-9
• /
• 2005

In a role based access control through attribute certificate, the use of role assignment certificates and role specification certificates can reduce management cost and the overhead incurred by changing roles, Highly distributed computing environments such as ubiquitous computing environments not having global or broad control. need another attribute certificate management technique, Actually just having role specification certificate separately reduce management cost, But for better performance we structure role specification, We group roles and make the role group relation tree, It results secure and efficient role renewing and distribution, For scalable role specification certificate distribution, the multicasting of packets is used, We take into account the packet lass and quantify performance enhancements of structuring role specification certificates.

• Journal of Communications and Networks
• /
• v.17 no.3
• /
• pp.247-255
• /
• 2015

In this paper, we propose an adaptive time division multiple access based medium access control (MAC) protocol, called bitmap-assisted shortest job first based MAC (BS-MAC), for hierarchical wireless sensor networks (WSNs). The main contribution of BS-MAC is that: (a) It uses small size time slots. (b) The number of those time slots is more than the number of member nodes. (c) Shortest job first (SJF) algorithm to schedule time slots. (d) Short node address (1 byte) to identify members nodes. First two contributions of BS-MAC handle adaptive traffic loads of all members in an efficient manner. The SJF algorithm reduces node's job completion time and to minimize the average packet delay of nodes. The short node address reduces the control overhead and makes the proposed scheme an energy efficient. The simulation results verify that the proposed BS-MAC transmits more data with less delay and energy consumption compared to the existing MAC protocols.

• Journal of KIISE:Information Networking
• /
• v.28 no.3
• /
• pp.435-446
• /
• 2001

In this paper, a new fairness control method is proposed to distribute DQDB-SR (Distributed-Queue Dual-Bus with Slot Reuse) network bandwidth fairly to all stations on client-server environments. By using an access limit that follows a characteristic of client-sever load patterns and a bandwidth borrowing and returning mechanism, the proposed mechanism imparts fairness bandwidth control capability to DQDB-SR. To implement the proposed mechanism, we find the optimal placement of erasure nodes that maximizes network capacity for DQDB-SR, and calculate the access limit. At overload conditions, simulation results show that the proposed mechanism does not deteriorate network throughput, and outperforms other fairness control mechanisms in a success rate and an average packet transfer delay.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.9
• /
• pp.2027-2034
• /
• 1997

Frame relay is a fast packet switching technology that performs relaying and multiplexing frames with variable lengths over a wide area link at the T1 or E1 speed, by elminating error and flow control in the network. In frame relay networks, congestion control is typically performed through the rate enforcement with a discard eligibility (DE) bit, and the explicit negative feedback meachanisms using explicit congetion notification bits. In this paper, we consider the congestiong control scheme using the rate enforcement mechanism with DE bit for frame relay network. Assuming that each frame with exponentially distributed length arrives according to the Poission fashion, we can treat the frame relay switch as an M/M/1/K priority queueing system with pushout basis. We analyze and present the blocking probabilities and waiting time distributions of frames.

• Journal of Communications and Networks
• /
• v.18 no.3
• /
• pp.502-512
• /
• 2016

The wireless carrier sense multiple access with collision detection (WCSMA/CD) and carrier sense multiple access with collision resolution (CSMA/CR) protocols are considered representative distributed collision detection protocols for fully connected dense wireless local area networks. These protocols identify collisions through additional short-sensing within a collision detection (CD) period after the start of data transmission. In this study, we analyze their throughput numerically and show that the throughput has a trade-off that accords with the length of the CD period. Consequently, we obtain the optimal length of the CD period that maximizes the throughput as a closed-form solution. Analysis and simulation results show that the throughput of distributed collision detection protocols is considerably improved when the optimal CD period is allocated according to the number of stations and the length of the transmitted packet.