• Title/Summary/Keyword: fair MAC

Search Result 58, Processing Time 0.023 seconds

A study on improving fairness and congestion control of DQDB using buffer threshold value (버퍼의 문턱치값을 이용한 DQDB망의 공평성 개선 및 혼잡 제어에 관한 연구)

  • 고성현;조진교
    • 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.

  • PDF

Time Utility and Channel State based Wireless Downlink Packet Scheduling Algorithm for OFDMA System (OFDMA 무선 시스템에서의 시간-효용과 채널 상태 기반의 하향 링크 패킷 스케줄링)

  • Ryu, Seung-Wan;Seo, Hyun-Hwa;Chung, Soo-Jung;Lim, Soon-Yong;Park, Sei-Kwon
    • IE interfaces
    • /
    • v.17 no.spc
    • /
    • pp.111-121
    • /
    • 2004
  • In this paper, we propose an urgency and efficiency based wireless packet scheduling (UEPS) algorithm that is able to schedule real time (RT) and non-real time (NRT) traffics at the same time. The proposed UEPS algorithm is designed to support wireless downlink packet scheduling in the OFDMA system which is a strong candidate wireless system for the next generation mobile communications. The UEPS algorithm uses the time-utility function as a scheduling urgency factor and the relative status of the current channel to the average one as an efficiency indicator of radio resource usage. The design goal of the UEPS algorithm is to maximize throughput of NRT traffics with satisfying QoS requirements of RT traffics. The simulation study shows that the proposed UEPS algorithm is able to give better throughput performance than existing wireless packet scheduling algorithms such as proportional fair (PF) and modified-largest weighted delay first (M-LWDF) while satisfying QoS requirements of RT traffics such as the average delay and the packet loss rate under various traffic loads.

Proportional Backoff Scheme for Data Services in TDMA-based Wireless Networks

  • Lim, In-Taek
    • Journal of information and communication convergence engineering
    • /
    • v.8 no.6
    • /
    • pp.660-664
    • /
    • 2010
  • This paper proposes a backoff control scheme for guaranteeing fair packet transmissions in TDMA wireless networks. In order to maximize the system performance, the number of packets transmitted in a frame should be kept at a proper level. In the proposed scheme, the base station calculates the packet transmission probability according to the offered loads and then broadcasts to all the mobile stations. Mobile stations attempt to transmit a packet with the received probability. Simulation results show that the proposed scheme can offer better system throughput and delay performance than the conventional one regardless of the offered loads.

Centralized Backoff Control Scheme in Slotted CDMA Systems

  • Lim, In-Taek
    • Journal of information and communication convergence engineering
    • /
    • v.9 no.1
    • /
    • pp.38-43
    • /
    • 2011
  • This paper proposes a centralized backoff control scheme for guaranteeing fair packet transmissions in S-ALOHA CDMA system. In S-ALOHA CDMA system, simultaneously transmitted packets act as multiple access interferences, so that unsuccessful packet transmissions are caused entirely by multiple access interferences. Therefore, in order to maximize the system performance, the levels of MAI should be kept at an optimal level. In the proposed scheme, the base station broadcasts the packet transmission probability, which is calculated based on the level of MAI. Mobile stations attempt to transmit their packet with the received probability. Simulation results show that the proposed scheme can guarantee a good fairness among all the mobile stations.

MAC Protocol for Fair Packet Transmission in CDMA S-ALOHA Systems (RFID 시스템에서 고속 태그식별을 위한 쿼리트리 프로토콜)

  • Yang Eui-Sik;Park Cheol-Woo;Lim In-Taek
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.07a
    • /
    • pp.496-498
    • /
    • 2005
  • 본 논문에서는 RFID 시스템에서 식별영역 내에 있는 태그들을 식별하기 위하여 무기억 특성을 갖는 QT 프로토콜을 개선한 QT_rev 프로토콜을 제안한다. QT_rev 프로토콜에서는 질의 문자열이 식별코드의 처음 비트들과 일치하는 태그는 식별코드 중에서 질의 문자열을 제외한 나머지 비트들로만 응답한다. 또한 리더는 태그들의 응답 문자열 중에서 충돌이 발생한 비트 위치를 알 수 있으므로 충돌이 발생한 위치가 태그 식별코드의 마지막 비트이면 리더는 더 이상의 질의가 없이 두 개의 태그를 동시에 식별할 수 있다.

  • PDF

A Study of the Method for Subscriber-Aware and Fair Aggregation Scheme in Ethernet (이더넷에서 가입자 구별 및 공평한 접선에 관한 연구)

  • Kwon Tae-Hyun;Park Jong-Su;Park Dae-Geun;Lee Yong-Surk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.7B
    • /
    • pp.602-607
    • /
    • 2006
  • A subscriber-oriented service became necessary for the QoS management due to the development of network. BcN(Broadband convergence Network) which incorporates communication, broadcasting and internet not only improves the quality of the communication and broadcasting service but also. aims at broadband service. Therefore, QoS management for each subscriber becomes more important. Not yet, however, the discussion for the subscriber oriented QoS management is not activated. Although, there are several techniques for subscriber distinction using flow information, IP information or MAC information, but they are only processed in layer 3 network. Actually, it is impossible to manage QoS of all subscriber's in layer 3 network. In this paper, we propose a method for QoS management scheme that does not need additional processes or large hardware in layer 2 network and analyze efficiency and overheads. We propose the first subscriber-oriented service method in layer 2 network that is applicable to either existing network or BcN.

A Study on Collision Avoidance and Priority Control Scheme for Cells in Frames

  • Park, Chun-Kwan;Jeon, Byung-Chun
    • Journal of IKEEE
    • /
    • v.2 no.1 s.2
    • /
    • pp.114-121
    • /
    • 1998
  • This paper proposed a collision avoidance scheme to improve the network performance and priority control scheme to support real-time ATM applications in CIF(Cells in Frames), which carries ATM cells over existing Ethernet interfaces. The proposed scheme has optimized for the two nodes Ethernet, that is a typical CIF network, and doesn't require any hardware modification of existing Ethernet interface card. The collision avoidance scheme gives fair access opprtunities with minimized contention to the nodes by assigning different inter-frame gap to each element of CIF network. The priority control scheme guarantees preemptive transmission of real-time frames to the medium by exchanging queuing status information between two nodes. Therefore in this paper it is shown that CIF network which has both the collision avoidance scheme of MAC layer and the priority control scheme of CIF layer has a improved network performance and supports real-time ATM applications efficiently.

  • PDF

MAC Scheduling Algorithm in IEEE 802.15.3 HR-WPAN (고속 무선 개인화 네트워크를 위한 MAC 스케줄링 알고리즘)

  • Joo Sung-Don;Lee Chae-Woo
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.42 no.6 s.336
    • /
    • pp.41-52
    • /
    • 2005
  • In wireless networks there are various errors, caused by multi-path fading and interference between devices which lower the network Performance. Especially, performance of IEEE 802.IS.3 High-Rate WPAN (Wireless Personal Area Network) which is operated in ISM unlicensed frequency band is easily affected by channel errors. In this paper, we propose a scheduling algorithm which takes channel errors into consideration in scheduling asynchronous data traffic. The proposed scheduling algorithm can allocate CTA(Channel Time Allocation) proportionally in accordance with the requested channel time of each device. It also prevents waste of channel time by allocating CTA of the channel-error devices to other channel-error free devices. After recovering from the channel error, the devices are compensated as much as they conceded during channel error status. Simulation results show that the proposed scheduling algorithm is superior to the existing SRPT(Shortest Remain Processing Time) and RR(Round Robin) in throughput and fairness aspects.

TAS: TCP-Aware Sub-layer over IEEE 802.11-based wireless LANs (IEEE 802.11 기반 무선랜에서 TCP 인진서브 계층 TAS)

  • Choi, Nak-Jung;Jung, Ha-Kyung;Ryu, Ji-Ho;Seok, Yong-Ho;Choi, Yang-Hee;Kwon, Tae-Kyoung
    • Journal of KIISE:Information Networking
    • /
    • v.33 no.5
    • /
    • pp.355-368
    • /
    • 2006
  • This paper introduces a new split-TCP approach for improving TCP performance over IEEE 802.11-based wireless LANs. TCP over wireless LANs differently from wired networks is not aggressive, which is a fundamental reason for poor performance. Therefore, we propose TAS (TCP-Aware Sub-layer) to migigate this problem. Our scheme extends the split-connection approach that divides a connection into two different connections at a split point such as an access point (AP). Using TAS, a wireless node emulates TCP ACK packets using MAC ACK frames, instead of receiving real TCP ACK packets. We compared TAS with both normal TCP and I-TCP (Indirect TCP) by NS2 simulation. Results show that TAS achieves higher throughput, more fair resource allocation and, in power-saving mode, shorter delays.

Joint Uplink and Downlink Resource Allocation in Data and Energy Integrated Communication Networks

  • Yu, Qin;Lv, Kesi;Hu, Jie;Yang, Kun;Hong, Xuemin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.6
    • /
    • pp.3012-3028
    • /
    • 2017
  • In this paper, we propose a joint power control strategy for both the uplink and downlink transmission by considering the energy requirements of the user equipments' uplink data transmissions in data and energy integrated communication networks (DEINs). In DEINs, the base station (BS) adopts the power splitting (PS) aided simultaneous wireless information and power transfer (SWIPT) technique in the downlink (DL) transmissions, while the user equipments (UEs) carry out their own uplink (UL) transmissions by exploiting the energy harvested during the BS's DL transmissions. In our DEIN model, there are M UEs served by the BS in order to fulfil both of their DL and UL transmissions. The orthogonal frequency division multiple access (OFDMA) technique is adopted for supporting the simultaneous transmissions of multiple UEs. Furthermore, a transmission frame is divided into N time slots in the medium access control (MAC) layer. The mathematical model is established for maximizing the sum-throughput of the UEs' DL transmissions and for ensuring their fairness during a single transmission frame T, respectively. In order to achieve these goals, in each transmission frame T, we optimally allocate the BS's power for each subcarrier and the PS factor for each UE during a specific time slot. The original optimisation problems are transformed into convex forms, which can be perfectly solved by convex optimisation theories. Our numerical results compare the optimal results by conceiving the objective of maximising the sum-throughput and those by conceiving the objective of maximising the fair-throughput. Furthermore, our numerical results also reveal the inherent tradeoff between the DL and the UL transmissions.