Talk:Fair queuing

message: The name of this page needs to be changed to Fair Queuing to reflect the correct spelling, but I can't figure out how to change a page name. —The preceding unsigned comment was added by 192.76.82.90 (talk • contribs) 22:54, 14 August 2006 (UTC)
replies: text: It's done with a move tab the top of the page. Perhaps you need to create an account and log in to have that ability. I'll do the renaming, and drop the capital Q also. Thanks for catching what everyone else has missed! JonHarder 12:55, 15 August 2006 (UTC)

text: It turns out there is already an article with that name, which means an administrator will have to perform the operation. I'll make the request. JonHarder 13:02, 15 August 2006 (UTC)
replies: text: Problem is partly solved. The name is now Fair Queuing, which is the most common spelling on the internet. It harmonizes with the "Weighted Fair Queuing" article. Unfortunatley I did not succeed in removing the capitalization. (I moved the redirecting page "Fair queing" to a temporary address, and then the "Fair queuing" article to "Fair Queuing". I was not allowed to move to "Fair queuing". Finally the redirecting page was moved to "Fair queueing", and a new redirecting page "Fair queuing" was created.) Mange01 21:54, 15 October 2006 (UTC)

text: The following discussion is an archived debate of the proposal. Please do not modify it. Subsequent comments should be made in a new section on the talk page. No further edits should be made to this section. 
The result of the debate was move; fair queueing should suffice. -- tariqabjotu 02:27, 21 August 2006 (UTC)
thread_title:  Name change fiasco 

message: Add "* Support" or "* Oppose" followed by an optional one-sentence explanation, then sign your opinion with ~~~~
*Support JonHarder 13:12, 15 August 2006 (UTC)
thread_title: Survey

message: I generally try not to blow my own horn on Wikipedia, but Demers, Keshav, and Shenker didn't invent fair queuing in 1989.  I invented it in 1985. .  It's one of the classic Internet RFCs, and there's a published paper. I coined the term fair queueing, which first appears in that paper.  That paper also introduced congestion collapse and first applied the tragedy of the commons problem to networking.  But since it's my own work, I shouldn't edit the article. I'd appreciate it if someone else would do so. Thanks. --John Nagle 22:01, 15 October 2006 (UTC)
replies: text: Done. It is a pleasure to meet you. Personally, I would not restrain myself from using WikiPedia for publishing terms that I have coined. Mange01 22:22, 15 October 2006 (UTC)
thread_title:  A. Demers, S. Keshav, and S. Shenker didn't invent fair queuing. 

message: It says that the complexity is log(n), however, the pseudo code seems to have complexity n (Presumably because it is a naive version of the algorithm). In case I'm not mistaken, one should clarify this. --Muxamilian (talk) 16:10, 19 September 2018 (UTC)
replies: text: Yes, the pseudo-code has complexity O(n). But for example, a Red%E2%80%93black_tree has complexity O(log(n)) at search/insert/delete. One can also consider a sorted array, and since one always pick the smallest one, search is done at O(1) whereas insert/delete is O(n)... MarcBoyerONERA (talk) 16:10, 21 September 2018 (UTC)
thread_title:  Complexity 

message: I do not understand why you have changed the text such that now() represents a virtual time. 
MarcBoyerONERA (talk) 09:42, 23 April 2019 (UTC)
thread_title:  Is now() a virtual time ?