Sciweavers

1687 search results - page 153 / 338
» On the complexity of scheduling in wireless networks
Sort
View
IWCMC
2010
ACM
15 years 6 months ago
Policy-driven workflows for mobile network management automation
Future wireless networks will experience a continuous growth regarding the number of network elements with increasingly complex interrelations between the configuration of multipl...
Raphael Romeikat, Bernhard Bauer, Tobias Bandh, Ge...
COMCOM
2004
111views more  COMCOM 2004»
15 years 6 months ago
An adaptive scheduling algorithm for differentiated services on WDM optical networks
One of the important issues in the design of future generation high-speed networks is to provide differentiated services to different types of applications with various time const...
Maode Ma, Mounir Hamdi
NETWORK
2006
218views more  NETWORK 2006»
15 years 6 months ago
Quality of service for packet telephony over mobile ad hoc networks
IP telephony over mobile ad hoc networks is a topic of emerging interest in the research arena as one of the paths toward the fixed-mobile convergence in telecommunications networ...
Paolo Giacomazzi, Luigi Musumeci, Giuseppe Caizzon...
ISJGP
2007
146views more  ISJGP 2007»
15 years 6 months ago
End-to-End Security Across Wired-Wireless Networks for Mobile Users
Abstract  Recent advances in mobile computing and wireless communication technologies are enabling high mobility and flexibility of anytime, anywhere service access for mobile us...
Sherali Zeadally, Nicolas Sklavos, Moganakrishnan ...
INFOCOM
2010
IEEE
15 years 4 months ago
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
Berk Birand, Maria Chudnovsky, Bernard Ries, Paul ...