Beckstrom Defends gTLD Application Process As "Fair" And "Level Playing Field": FT
Posted in: Domain Names at 13/06/2012 21:00
With the "Big Reveal" happening today, ICANN's CEO and President has defended the process that has been developed to process applications for generic Top Level Domains telling the Financial Times it is "fair" and "a level playing field" following harsh criticism from several critics.
With around 1900 applications for gTLDs to be announced today, there will at least three and most likely four batches of applications to be processed over the next two years.
"The consequences of batching are severe," Peter Thrush, chairman of Top Level Domain Holdings and a former chairman of Icann, told the FT. "People who don't get in first will suffer commercially, and in some cases fatally, against those who get into the first batch."
"Whoever gets out of the gate first is going to get a significant advantage," he said.
But Beckstrom defended the process saying "The batching system, as we're currently administering it, was approved and was publicly posted before anyone filed an application. If anyone didn't like the batching solution they could have expressed their views back in December."
Beckstrom also defended the use of "digital archery", whereby applicants are told to click a button on a website at a certain time, with those closest to the mark being processed in the first batch.
"On average, it's fair," said Mr Beckstrom. "Even if you used a random number generator, random generators aren't perfect. [With digital archery] everyone has an equal ability. It's a level playing field."
Beckstrom also told the FT that the application process is expected to be discussed by the board at the ICANN meeting to be held in Prague from 24 June, and that "if the board wishes to change it, they can, and then we'll have to review the whole programme."
Other options, including processing all applications together, would slow down the process Beckstrom also noted.
To read this article in the Financial Times in full, see: