Abstract: The idea of the asynchronous transmission in
wavelength division multiplexing (WDM) ring MANs is studied in
this paper. Especially, we present an efficient access technique to
coordinate the collisions-free transmission of the variable sizes of IP
traffic in WDM ring core networks. Each node is equipped with a
tunable transmitter and a tunable receiver. In this way, all the
wavelengths are exploited for both transmission and reception. In
order to evaluate the performance measures of average throughput,
queuing delay and packet dropping probability at the buffers, a
simulation model that assumes symmetric access rights among the
nodes is developed based on Poisson statistics. Extensive numerical
results show that the proposed protocol achieves apart from high
bandwidth exploitation for a wide range of offered load, fairness of
queuing delay and dropping events among the different packets size
categories.
Abstract: A simple network model is developed in OPNET to
study the performance of the Wi-Fi protocol. The model is simulated
in OPNET and performance factors such as load, throughput and delay
are analysed from the model. Four applications such as oracle, http, ftp
and voice are applied over the Wireless LAN network to determine the
throughput. The voice application utilises a considerable amount of
bandwidth of up to 5Mbps, as a result the 802.11g standard of the
Wi-Fi protocol was chosen which can support a data rate of up to
54Mbps. Results indicate that when the load in the Wi-Fi network is
increased the queuing delay on the point-to-point links in the Wi-Fi
network significantly reduces until it is comparable to that of WiMAX.
In conclusion, the queuing delay of the Wi-Fi protocol for the network
model simulated was about 0.00001secs comparable to WiMAX
network values.
Abstract: Packet switched data network like Internet, which has
traditionally supported throughput sensitive applications such as email
and file transfer, is increasingly supporting delay-sensitive
multimedia applications such as interactive video. These delaysensitive
applications would often rather sacrifice some throughput
for better delay. Unfortunately, the current packet switched network
does not offer choices, but instead provides monolithic best-effort
service to all applications. This paper evaluates Class Based Queuing
(CBQ), Coordinated Earliest Deadline First (CEDF), Weighted
Switch Deficit Round Robin (WSDRR) and RED-Boston scheduling
schemes that is sensitive to delay bound expectations for variety of
real time applications and an enhancement of WSDRR is proposed.
Abstract: Wireless channels are characterized by more serious
bursty and location-dependent errors. Many packet scheduling
algorithms have been proposed for wireless networks to guarantee
fairness and delay bounds. However, most existing schemes do not
consider the difference of traffic natures among packet flows. This
will cause the delay-weight coupling problem. In particular, serious
queuing delays may be incurred for real-time flows. In this paper, it
is proposed a scheduling algorithm that takes traffic types of flows
into consideration when scheduling packets and also it is provided
scheduling flexibility by trading off video quality to meet the
playback deadline.