The search functionality is under construction.
The search functionality is under construction.

Keyword Search Result

[Keyword] best effort service(2hit)

1-2hit
  • Distributed Channel Assignment Scheme Supporting Various Traffic Loads in Microcellular Systems

    Seung-young PARK  Hyun-hee LEE  Kyung-goo JUNG  

     
    LETTER-Wireless Communication Technologies

      Vol:
    E93-B No:3
      Page(s):
    766-770

    In this letter, we propose a distributed channel assignment where each basestation selects a set of channels shared by multiple users through time domain scheduling for best effort services. The proposed scheme distributedly assigns the channels considering a cochannel interference from neighboring basestations and its own traffic load condition. The computer simulation demonstrates that the proposed scheme appropriately assigns the channels to the basestations taking into account these requirements.

  • Simulative Analysis of Routing and Link Allocation Strategies in ATM Networks Supporting ABR Services

    Gabor FODOR  Andras RACZ  Sφren BLAABJERG  

     
    PAPER-ATM Traffic Control

      Vol:
    E81-B No:5
      Page(s):
    985-995

    In this paper an ATM call level model, where service classes with QoS guarantees (CBR/VBR) as well as elastic (best effort) services (ABR/UBR) coexist, is proposed and a number of simulations have been carried out on three different network topologies. Elastic traffic gives on the network level rise to new challenging problems since for a given elastic connection the bottleneck link determines the available bandwidth and thereby put constraints on bandwidth at other links. Thereby bandwidth allocation at call arrivals but also bandwidth reallocation at call departure becomes, together with routing, an important issue for investigation. Two series of simulations have been carried out where three different routing schemes have been evaluated together with two bandwidth allocation algorithms. The results indicate that the choice of routing algorithm is load dependent and in a large range the shortest path algorithm properly adopted to the mixed CBR/ABR environment performs very well.