if you hash each queue no. ( collision resolution thru secondary hashing) then each queue slot would be equidistantOn 5/8/06,
[EMAIL PROTECTED] [EMAIL PROTECTED] wrote:
At this time,I have following 2 options in my mind,1. When a request for a queue with a requirement of m slots, given
The 1st slot to each queue is given by the hash function while subsequent slots may be seen as collisions . since the table size is previously known, collision resolution could be done thru linear probing( not rehashing)ie add some linear fn. to the hash value obtained earlier and put inthe reqd
Now I've goofed up. Anish, I MEANT to say that I have NOT heard of an
algorithm that fits your needs. Sorry.
It appears from your description Anish, that the proper distance
between any two scheduled time slots should be
STDistance = Calender Depth / Number of Time Slots required by the
queue.
Hello Akshay,
Thanks for starting the discussion, I will try to add more information
to my question. Mainly, the algorithm is supposed to solve Traffic
burstiness problem by shaping it. The calendar is scheduling the
time-slots in a round robin fashion. And the number of time slots
allocated to
At this time,
I have following 2 options in my mind,
1. When a request for a queue with a requirement of m slots, given the
calendar depth n, I find n / m, say p. p is the maximum distance that
can be provided amongst the slots of a queue in the calendar table. For
example, n = 252 and m = 4 then
queues are inmplimented on the firstcome first served
The principle for queues is FIFO ie first in first out...
mail me u r comments..
Sriram
On 5/7/06, akshay ranjan [EMAIL PROTECTED] wrote:
Are the queues being implemented on first come first serve basis or is thre some priority list??
On
Hi anish
i m sriram...i m also new to this group doing my firstyear engineering.i m interested in learning more on computerspls help me to learn more and pls teach me the logics and other stuffs which are necessary for me...introduce me to your friends also...
thankyou
Sriram.N
On 5/6/06,
Welcome to you both. Sriram, it's VERY discourteous to post an
unrelated reply to Anish's post, just above.
Either don't do that, or expect to be flamed and/or ignored in the
group.
Anish, I have heard of an algorithm expressly for this, but I'm sure
there are one's around. What have you
