• ETRI Journal
• /
• 제29권5호
• /
• pp.682-684
• /
• 2007

A new scheme to alleviate contention in optical burst switching networks is proposed. It consists of preventively reserving resources in a node, to be used if resources are busy on the next hop node. The burst is sent back to the preceding node and then resent forward. Simulations are carried out to assess the feasibility of the proposed scheme. Its performance is compared with that of contention resolution based on deflection routing.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권11호
• /
• pp.2636-2656
• /
• 2013

To improve the cooperative efficiency of node cooperation and multiple access performance for multihop wireless networks, a priority-differentiated cooperative medium access control protocol with contention resolution (CRP-CMAC) is proposed. In the protocol, the helper selection process is divided into the priority differentiation phase and the contention resolution phase for the helpers with the same priority. A higher priority helper can choose an earlier minislot in the priority differentiation phase to send a busy tone. As a result, the protocol promptly selects all the highest priority helpers. The contention resolution phase of the same priority helpers consists of k round contention resolution procedures. The helpers that had sent the first busy tone and are now sending the longest busy tone can continue to the next round, and then the other helpers that sense the busy tone withdraw from the contention. Therefore, it can select the unique best helper from the highest priority helpers with high probability. A packet piggyback mechanism is also adopted to make the high data rate helper with packet to send transmit its data packets to its recipient without reservation. It can significantly decrease the reservation overhead and effectively improve the cooperation efficiency and channel utilization. Simulation results show that the maximum throughput of CRP-CMAC is 74%, 36.1% and 15% higher than those of the 802.11 DCF, CoopMACA and 2rcMAC protocols in a wireless local area network (WLAN) environment, and 82.6%, 37.6% and 46.3% higher in an ad hoc network environment, respectively.

• 한국통신학회논문지
• /
• 제32권9A호
• /
• pp.905-915
• /
• 2007

본 논문은 IEEE 802.11 DCF가 잡음과 부하가 고려된 실제적인 환경에서 효과적으로 작동할 수 있도록 환경 변화에 따라 contention window를 동적으로 적응시키는 필터 기반의 메카니즘을 제안한다. 이는 이미지 프로세싱에서의 미디언 필터개념을 적용시킨 것으로 필터링의 결과에 따라 윈도우의 크기를 조정한다. 이를 통하여 잡음과 충돌에 의해 필연적으로 패킷 전달에 문제가 발생할 수밖에 없는 무선 환경에서 불필요한 윈도우의 조정을 제거하고, 성능을 최적화 할 수 있게 된다. 또한 제안하는 방법은 기존에 전송된 결과를 반영하는 히스토리 비트-패턴을 이용함으로써 기존 연구결과들을 거의 포함하는 일반적인 방법으로 쉽게 확장할 수 있는 장점을 가지고 있다. 제안된 방법은 시뮬레이션을 통해 성능과 지연 측면에서 기존의 연구결과보다 확실한 향상을 가져옴을 확인할 수 있었다.

• ETRI Journal
• /
• 제45권1호
• /
• pp.60-74
• /
• 2023

Integration of the machine learning (ML) technique in all-optical networks can enhance the effectiveness of resource utilization, quality of service assurances, and scalability in optical networks. All-optical multistage interconnection networks (MINs) are implicitly designed to withstand the increasing highvolume traffic demands at data centers. However, the contention resolution mechanism in MINs becomes a bottleneck in handling such data traffic. In this paper, a select list of ML algorithms replaces the traditional electronic signal processing methods used to resolve contention in MIN. The suitability of these algorithms in improving the performance of the entire network is assessed in terms of injection rate, average latency, and latency distribution. Our findings showed that the ML module is recommended for improving the performance of the network. The improved performance and traffic grooming capabilities of the module are also validated by using a hardware testbed.

• 한국통신학회논문지
• /
• 제29권9A호
• /
• pp.1075-1082
• /
• 2004

무선랜은 우선으로 근거리 디바이스들을 연결하는 통신기술로 IEEE 의 802.11 이 대표적인 프로투콜로 사용되 고 있다 IEEE 802.11 에서 정의된 DCF (Distributed Coordination Fun 이 ion) 는 사용 4 가 증가하고 부하가 커질수록 전송률 ,throughput) 과 데이터 손실률 -(drop rate) 이 커지는 단점을 가지고 있다. 본 논문에서는 무선랜 환경에서 효율적인 최소 동적윈도우 (CWmin) 의 적용을 통한 성능향상방법을 제안하고 분석과 시율레이션을 통해 제안하는 방법이 기존 DCF 보다 성능이 향상됨을 입증한다. 제안하는 동적최소윈도우 방법은 우선 스테이션의 개수가 증가 할수록 , 무선네트워크에 걸리는 부하가 커질수록 성능향상정도가 더욱 커지게 된다. 따라서 향후 고밀도 무선랜 환경에서 효과적일 것이라 기대된다.

• 정보처리학회논문지C
• /
• 제12C권6호
• /
• pp.927-932
• /
• 2005

본 논문은 Optical Burst Switching(OBS) 네트워크상에서 버스트 부분 재전송 시그널링을 적용하여 버스트 층돌이 발생하였을 때 입구 노드에서 손실된 버스트 부분을 재전송하는 메커니즘을 제안하였다. 또한 버스트 부분 재전송 메커니즘을 확장한 광 자원 예약 방식을 기술하였다. 제안된 메커니즘을 사용함으로써 버스트 층돌로 인한 데이터손실을 OBS 계층에서 복원할 수 있고, 광 채널의 이용률을 높일 수 있다. 본 논문에서는 제안된 OBS 기능들을 NS2 시뮬레이터를 기반으로 구현하여 성능을 분석하였다 재전송을 위해 OBS 시그널링 기간동안 입구 노드에서 버스트를 저장함으로 인해서 필요로 되는 입구 노드 버퍼크기가 증가하는 대신 OBS 네트워크의 채널 이용률이 획기적으로 향상됨을 시뮬레이션 결과를 통해서 확인하였다.

• ETRI Journal
• /
• 제24권4호
• /
• pp.311-322
• /
• 2002

Presently, optical burst switching (OBS) technology is under study as a promising solution for the backbone of the optical Internet in the near future because OBS eliminates the optical buffer problem at the switching node with the help of no optical/electro/optical conversion and guarantees class of service without any buffering. To implement the OBS network, there are a lot of challenging issues to be solved. The edge router, burst offset time management, and burst assembly mechanism are critical issues. In addition, the core router needs data burst and control header packet scheduling, a protection and restoration mechanism, and a contention resolution scheme. In this paper, we focus on the burst assembly mechanism. We present a novel data burst generation algorithm that uses hysteresis characteristics in the queueing model for the ingress edge node in optical burst switching networks. Simulation with Poisson and self-similar traffic models shows that this algorithm adaptively changes the data burst size according to the offered load and offers high average data burst utilization with a lower timer operation. It also reduces the possibility of a continuous blocking problem in the bandwidth reservation request, limits the maximum queueing delay, and minimizes the required burst size by lifting up data burst utilization for bursty input IP traffic.

• 한국멀티미디어학회논문지
• /
• 제8권12호
• /
• pp.1613-1622
• /
• 2005

Broadcasting is fundamental and effective data dissemination mechanism for route discovery, address resolution, and many other network services in mobile ad hoc networks. Although many approaches for broadcasting have been proposed to minimize the number of retransmissions, none of them guarantee the best-suited bounds of retransmissions. Appropriate use of probabilistic method can lower the chance of contention and collision among neighboring nodes, so that it reduces the number of rebroadcasts. In this paper, we propose a probabilistic approach that dynamically adjusts the rebroadcasting probability according to the distance between the sender and the receiver. While the rebroadcast probabilities of a mobile node close to sender will be set lower, the rebroadcast probabilities of a mobile node far away from sender wi1l be set to higher, The rebroadcast probability of a node wi1l be set according to the distance from sender. We evaluate the performance of proposed approach by comparing it with flooding as well as a fixed probabilistic broadcast approach. Simulation results showed that the performance of proposed scheme outperforms by about $70\%$ than flooding scheme and outperforms by about $20\%$ than fixed probabilistic scheme.