Sciweavers

207 search results - page 30 / 42
» Multicast Trees for Collaborative Applications
Sort
View
NETGAMES
2006
ACM
14 years 2 months ago
Applicability of group communication for increased scalability in MMOGs
Massive multiplayer online games (MMOGs) are today the driving factor for the development of distributed interactive applications, and they are increasing in size and complexity. ...
Knut-Helge Vik, Carsten Griwodz, Pål Halvors...
ICUMT
2009
13 years 6 months ago
Experimental study on neighbor selection policy for Phoenix Network Coordinate system
Network Coordinate (NC) which provides efficient distance prediction with scalable measurements, brings benefits to various network applications. Phoenix Network Coordinate system ...
Gang Wang, Shining Wu, Guodong Wang, Beixing Deng,...
ESA
2008
Springer
134views Algorithms» more  ESA 2008»
13 years 10 months ago
A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
Spyros Angelopoulos
GLOBECOM
2008
IEEE
14 years 3 months ago
Power-Cost-Effective Node Architecture for Light-Tree Routing in WDM Networks
—We present a novel cost-effective multicast capable optical cross connect (MC-OXC) node architecture which improves efficiency of optical power by constraining splitting to only...
G. M. Fernandez, David Larrabeiti, C. Vazquez, P. ...
ICMCS
2006
IEEE
116views Multimedia» more  ICMCS 2006»
14 years 2 months ago
SIKAS: A Scalable Distributed Key Management Scheme for Dynamic Collaborative Groups
The increasing popularity of distributed and collaborative applications prompts the need for secure communication in collaborative groups. Some distributed collaborative key manag...
Jiang Zhang, Jian-Guang Luo, Bin Li, Shiqiang Yang