5,222 research outputs found
Upstream traffic capacity of a WDM EPON under online GATE-driven scheduling
Passive optical networks are increasingly used for access to the Internet and
it is important to understand the performance of future long-reach,
multi-channel variants. In this paper we discuss requirements on the dynamic
bandwidth allocation (DBA) algorithm used to manage the upstream resource in a
WDM EPON and propose a simple novel DBA algorithm that is considerably more
efficient than classical approaches. We demonstrate that the algorithm emulates
a multi-server polling system and derive capacity formulas that are valid for
general traffic processes. We evaluate delay performance by simulation
demonstrating the superiority of the proposed scheduler. The proposed scheduler
offers considerable flexibility and is particularly efficient in long-reach
access networks where propagation times are high
A Flow-aware MAC Protocol for a Passive Optical Metropolitan Area Network
The paper introduces an original MAC protocol for a passive optical
metropolitan area network using time-domain wavelength interleaved networking
(TWIN)% as proposed recently by Bell Labs . Optical channels are shared under
the distributed control of destinations using a packet-based polling algorithm.
This MAC is inspired more by EPON dynamic bandwidth allocation than the
slotted, GPON-like access control generally envisaged for TWIN. Management of
source-destination traffic streams is flow-aware with the size of allocated
time slices being proportional to the number of active flows. This emulates a
network-wide, distributed fair queuing scheduler, bringing the well-known
implicit service differentiation and robustness advantages of this mechanism to
the metro area network. The paper presents a comprehensive performance
evaluation based on analytical modelling supported by simulations. The proposed
MAC is shown to have excellent performance in terms of both traffic capacity
and packet latency
Providing Dynamic TXOP for QoS Support of Video Transmission in IEEE 802.11e WLANs
The IEEE 802.11e standard introduced by IEEE 802.11 Task Group E (TGe)
enhances the Quality of Service (QoS) by means of HCF Controlled Channel Access
(HCCA). The scheduler of HCCA allocates Transmission Opportunities (TXOPs) to
QoS-enabled Station (QSTA) based on their TS Specifications (TSPECs) negotiated
at the traffic setup time so that it is only efficient for Constant Bit Rate
(CBR) applications. However, Variable Bit Rate (VBR) traffics are not
efficiently supported as they exhibit nondeterministic profile during the time.
In this paper, we present a dynamic TXOP assignment Scheduling Algorithm for
supporting the video traffics transmission over IEEE 802.11e wireless networks.
This algorithm uses a piggybacked information about the size of the subsequent
video frames of the uplink traffic to assist the Hybrid Coordinator accurately
assign the TXOP according to the fast changes in the VBR profile. The proposed
scheduling algorithm has been evaluated using simulation with different
variability level video streams. The simulation results show that the proposed
algorithm reduces the delay experienced by VBR traffic streams comparable to
HCCA scheduler due to the accurate assignment of the TXOP which preserve the
channel time for transmission.Comment: arXiv admin note: substantial text overlap with arXiv:1602.0369
Heavy-traffic limits for Polling Models with Exhaustive Service and non-FCFS Service Order Policies
We study cyclic polling models with exhaustive service at each queue under a variety of non-FCFS local service orders, namely Last-Come-First-Served (LCFS) with and without preemption, Random-Order-of-Service (ROS), Processor Sharing (PS), the multi-class priority scheduling with and without preemption, Shortest-Job-First (SJF) and the Shortest Remaining Processing Time (SRPT) policy. For each of these policies, we rst express the waiting-time distributions in terms of intervisit-time distributions. Next, we use these expressions to derive the asymptotic waiting-time distributions under heavy-trac assumptions, i.e., when the system tends to saturate. The results show that in all cases the asymptotic wait
- …