2004
DOI: 10.1109/jsac.2004.833837
|View full text |Cite
|
Sign up to set email alerts
|

QoS Scheduler/Shaper for Optical Coarse Packet Switching IP-Over-WDM Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
9
0

Year Published

2006
2006
2008
2008

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 11 publications
(9 citation statements)
references
References 25 publications
0
9
0
Order By: Relevance
“…In the control plane, an FPGA-based traffic generator produced four traffic channels using two different labels (fibers 1 and 2) and two priorities (H and L), respectively. For each channel, the traffic arrivals were generated following an Interrupted Bernoulli Process [7] characterized by two parameters (α,β), where α (β) corresponds to the probability of the state change per slot from "ON" ("OFF") to "OFF"("ON"). While the first-channel traffic was used to trigger the 10 Gb/s data pattern generator to actually pump out data packets, the remaining three channel's information was passed to CSC to virtually emulate the environment with desired traffic and loads.…”
Section: Experimentation and Resultsmentioning
confidence: 99%
“…In the control plane, an FPGA-based traffic generator produced four traffic channels using two different labels (fibers 1 and 2) and two priorities (H and L), respectively. For each channel, the traffic arrivals were generated following an Interrupted Bernoulli Process [7] characterized by two parameters (α,β), where α (β) corresponds to the probability of the state change per slot from "ON" ("OFF") to "OFF"("ON"). While the first-channel traffic was used to trigger the 10 Gb/s data pattern generator to actually pump out data packets, the remaining three channel's information was passed to CSC to virtually emulate the environment with desired traffic and loads.…”
Section: Experimentation and Resultsmentioning
confidence: 99%
“…2. Weighting schemes have significant impact on the decisions made by arbitration and scheduling mechanism, Various weight functions, including iterative longest packet queue first (LPF), shortest packet queue first (SPF) and oldest packet queue first (OPF) have been presented in the literature [10][11][12][13][14][15][16]. However, LPF strategy can efficiently and delay restrains the queue length and packet delay, but is known as achieve 100% throughput by the cost of speedup OPS switch.…”
Section: Node Scheduling For Asynchronous Opsmentioning
confidence: 99%
“…These mechanisms control the service time and service order of the packet to provide delay guarantee and packet loss ratio. An ideal scheduling algorithm should be a fair, computationally simple to allow implementation on high-speed optical networks [10][11]. The lack of the optical memory leads to a higher packet loss ration when resource contentions occur at the intermediate optical OPS nodes.…”
Section: Introductionmentioning
confidence: 99%
“…An ideal scheduling algorithm should be a fair, computationally simple to allow implementation on high-speed optical networks [7][8]. The scheduling mechanisms can guarantee the packet delay and packet loss ratio by controlling packet service time and service order.…”
Section: Introductionmentioning
confidence: 99%