• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.4
• /
• pp.618-636
• /
• 1997

DQDB(Distributed Queue Dual Bus) protocol, the IEEE 802.6 standard protocol for metropolitan area networks, does not fully take advantage of the capabilities of dual bus architecture. Although fairness in bandwidth distribution among nodes is improved when using so called the bandwidth balancing mechanism, the protocol requires a considerable amount of time to adjust to changes in the network load. Additionally, the bandwidth balancing mechanism leaves a portion of the available bandwidth unused. In a high-speed backbone network, each node may act as a bridge/ router which connects several LANs as well as hosts. However, Because the existence of high speed LANs becomes commonplace, the congestionmay occur on a node because of the limitation on access rate to the backbone network and on available buffer spaces. to release the congestion, it is desirable to install some congestion control algorithm in the node. In this paper, we propose an efficient congestion control mechanism and fair and waster-free MAC protocol for dual bus network. In this protocol, all the buffers in the network can be shared in such a way that the transmission rate of each node can be set proportional to its load. In other words, a heavily loaded node obtains a larger bandwidth to send the sements so tht the congestion can be avoided while the uncongested nodes slow down their transmission rate and store the incoming segments into thier buffers. this implies that the buffers on the network can be shared dynamically. Simulation results show that the proposed probotol significantly reduces the segment queueing delay of a heavily loaded node and segment loss rate when compared with original DQDB. And it enables an attractive high throughput in the backbone network. Because in the proposed protocol, each node does not send a requet by the segment but send a request one time in the meaning of having segments, the frequency of sending requests is very low in the proposed protocol. so the proposed protocol signigificantly reduces the segment queuing dely. and In the proposed protocol, each node uses bandwidth in proportion to its load. so In case of limitation of available buffer spaces, the proposed protocol reduces segment loss rate of a heavily loaded node. Bandwidth balancing DQDB requires the wastage of bandwidth to be fair bandwidth allocation. But the proposed DQDB MAC protocol enables fair bandwidth without wasting bandwidth by using bandwidth one after another among active nodes.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.346-348
• /
• 2005

무선 통신망은 유선 통신망에 비하여 대역이 한정적이기 때문에 효율적인 대역의 이용은 매우 중요하다. 그러나 802.16 BWA 시스템의 UGS 알고리즘은 보낼 데이터가 없어도 일정한 간격으로 고정 대역을 단말에 계속 할당하기 때문에 대역의 낭비가 심하다. 본 논문에서는 VAd가 가능한 단말에서 UGS 알고리즘을 이용할 때, 보낼 패킷이 없는 경우에는 그 유휴 대역을 이용하여 우선순위가 낮은 nrtPS나, BE 알고리즘을 이용하는 패킷을 대신 전송하는 방법을 제시함으로써, 802.16 BWA 시스템에서 효율적인 상향링크 스케줄링을 구현한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.855-857
• /
• 2007

In recent years, Wireless Mesh Network (WMN) is a compelling topic to many network researchers due to its low cost in deployment, ease and simplicity in installation and scalability and robustness in operation. In WMN, Gateway nodes (Access Point-AP) are in charge of steering the traffic from the external network (e.g. Internet...) to client devices or mesh clients. The limited bandwidth of wireless links between Gateways and intermediate mesh routers makes the Gateways becomes the bottleneck of the mesh network in both uplink stream and downlink stream. In this paper, we propose a mechanism to permit Gateways collaboratively work to manipulate the traffic to fit our network. They will move the traffic from congested links to the unused capacity on other links.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.05a
• /
• pp.144-147
• /
• 2001

In ATM Network, many algorithms have been proposed for rate-based ABR flow control. The object of these algorithms is to turn around from cell loss and to use the unused bandwidth by ABR Traffic. These Algorithms are applied to control ABR Traffic by EFCI and ER switches. In this paper, we apply these algorithms to the various stale networks and analysis the characteristics of the algorithms and then attempt to show the loss rate of each algorithms. As the result we compare and analysis the efficiency of them.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.17 no.5
• /
• pp.28-35
• /
• 1980

The ever unsatisfied demand for more channel and bandwidth to the limited installalion of existing communication facilities, and explosively increasing expanses for the cable installation fee force us to revive once patented but unused idea of multlplexign in time, that is, PCM in telephony. The authors designed, artworked and prototyped PCM 24 since 1972 and tested the first PCM chaulel Hank between Noryang Jin and yang see stations to prove that the resust of their PCM 24 Channel Bank implementation is viable and promissing.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.4
• /
• pp.188-200
• /
• 2002

The WRR scheduling algorithm is widely used in ATM networks due to its simplicity and the low cost of hardware implementation. It guarantees minimum cell rate according to the weight of each queue. The fairness is a important factor for ABR service. That is, scheduling algorithm allocates network resources fairly to each VC. However, WRR algorithm shows worse performance on bursty traffic. Because it schedules input traffics according to predetermined weight, it can not satisfies fairness criteria, MCR plus equal share and Maximum of MCR or Max-Min share, defined by ATM Forum TM 4.1 specification. The Nabeshima et al algorithm is not adapt to network status rapidly because it is not compensate the weights of unused bandwidth to VCs and assign the unused bandwidth to VCs by RR method. In this paper, we propose a scheduling algorithm for satisfying the two fairness criteria, MCR plus equal share and Maximum of MCR or Max-Min share, among the six criteria defined by ATM Forum TM 4.1 specification. The WRR, Nabeshima et al, and the proposed scheduling algorithms are compared with respect to fairness and convergence time throughout experimental simulation. According to the simulation results, the proposed algorithm shows higher fairness and more rapid convergence than other algorithms.

• The Journal of the Korea Contents Association
• /
• v.9 no.11
• /
• pp.37-45
• /
• 2009

Today, Internet service is a most important Information Source. So, the Power Line Communication has been achieved to offer Internet service to Last-Mile area. But, Power Line is not suitable for communication, So, electromagnetic wave is generated from Power Line during flow of communication information. And the electromagnetic wave is interfered with Wireless Communication Service using the same frequency range. In this paper, the Notch Filter and the Spectrum Sensing technology are proposed to reduction of interference between Power Line Communication and Wireless Communication Service. The Spectrum Sensing technology is the core technology of the Cognitive Radio (CR) system. CR is the technology that temporarily allocates the frequency bandwidth by scanning surrounding wireless environments to keep licensed terminals and search the unused frequency bandwidth. The proposed emulator is implemented with Spectrum Sensing and Notch Filter system using Embedded Board.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.6
• /
• pp.9-15
• /
• 2010

Cognitive radio is a technology, which automatically recognizes and searches for temporally and spatially unused frequency spectrum, then actively determines the communication method, bandwidth, etc. according to the environment, thus utilizing the limited spectrum resources efficiently. In this paper, with the imperfect sensing of misdetection and false alarm, we quantitatively investigate the effects of primary and secondary user's queue on the primary and secondary users' spectrum usage through the analysis of continuous time Markov Chain. With the queue primary user's spectrum usage improved up to 18%, and the secondary user's spectrum usage improved up to 50%.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.6
• /
• pp.1-8
• /
• 2010

Wireless multimedia service through the access to mobile telephone network or data network is a vital part of contemporary life, and the demand for frequency spectrum for new services is expected to explode as the ubiquitous computing proliferate. Cognitive radio is a technology, which automatically recognizes and searches for temporally and spatially unused frequency spectrum, then actively determines the communication method, bandwidth, etc. according to the environment, thus utilizing the limited spectrum resources efficiently. In this paper, we investigate the effects of imperfect sensing, misdetection and false alarm, on the primary and secondary users' spectrum usage through the analysis of continuous time Markov Chain. We analyzed the effects of the parameters such as sensing error, offered load on the system performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7B
• /
• pp.1001-1008
• /
• 2010

In this paper, we propose the dynamic spectrum allocation (DSA) algorithm using spectrum sharing method considering the long-term priority between NOs and service classes for the maritime communication system environment where a ship locates at either near shore (or land) or off-shore. It was shown that the proposed algorithm using spectrum sharing with priorities could deliver better satisfaction ratio (SR) than the fixed allocation schemes, in the context of provision of required bandwidth (or spectrum) for each users. Therefore, we conclude that the proposed DSA with priorities could apply to the maritime communication environment and exploit the under-used (or unused, idle) spectrum of terrestrial communication networks.