Sciweavers

3910 search results - page 588 / 782
» Analyzing Cross-Connected Networks
Sort
View
JSAC
2007
78views more  JSAC 2007»
15 years 6 months ago
Partially Optimal Routing
— Most large-scale communication networks, such as the Internet, consist of interconnected administrative domains. While source (or selfish) routing, where transmission follows ...
Daron Acemoglu, Ramesh Johari, Asuman E. Ozdaglar
CCR
2002
86views more  CCR 2002»
15 years 6 months ago
Hop-by-hop routing algorithms for premium traffic
In Differentiated Service (DiffServ) networks, the routing algorithms used by the premium class traffic, due to the high priority afforded to that traffic, may have a significant ...
Jun Wang, Klara Nahrstedt
IFE
2007
77views more  IFE 2007»
15 years 6 months ago
Drawing Subway Maps: A Survey
Abstract This paper deals with automating the drawing of subway maps. There are two features of schematic subway maps that make them different from drawings of other networks such...
Alexander Wolff
TNN
1998
125views more  TNN 1998»
15 years 6 months ago
Symbolic connectionism in natural language disambiguation
Abstract—Natural language understanding involves the simultaneous consideration of a large number of different sources of information. Traditional methods employed in language an...
Samuel W. K. Chan, James Franklin
NETWORK
2007
93views more  NETWORK 2007»
15 years 6 months ago
Modeling VoIP Call Holding Times for Telecommunications
Voice over IP is one of the most popular applications in broadband access networks. It is anticipated that the characteristics of call holding times (CHTs) for VoIP calls will be ...
Whai-En Chen, Hui-Nien Hung, Yi-Bing Lin