Sciweavers

75 search results - page 13 / 15
» Name independent routing for growth bounded networks
Sort
View
IPPS
1997
IEEE
13 years 11 months ago
Cyclic Networks: A Family of Versatile Fixed-Degree Interconnection Architectures
In this paper, we propose a new family of interconnection networks, called cyclic networks (CNs), in which an intercluster connection is defined on a set of nodes whose addresses...
Chi-Hsiang Yeh, Behrooz Parhami
CIT
2004
Springer
14 years 26 days ago
TCP Based Denial-of-Service Attacks to Edge Network: Analysis and Detection
End-to-end congestion control algorithms in TCP are designed for a highly co-operative environment with the assumption that the end hosts voluntarily participate in it and obey th...
V. Anil Kumar, Dorgham Sisalem
GLOBECOM
2007
IEEE
14 years 1 months ago
Evaluation of the Probability of K-Hop Connection in Homogeneous Wireless Sensor Networks
— Given a wireless sensor network (WSN) whose sensors are randomly and independently distributed in a bounded area following a homogeneous Poisson process with density ρ and eac...
Xiaoyuan Ta, Guoqiang Mao, Brian D. O. Anderson
JCM
2006
89views more  JCM 2006»
13 years 7 months ago
A Premium Traffic Management in DiffServ Through End-to-End Delay Budget Partitioning
Our novel Call Admission Control (CAC) scheme [1], [2] determines the number of Expedited Forwarding (EF) (Premium) flows accepted, based on e2e available bandwidth measurement. Ho...
Hamada Alshaer, Eric Horlait
SIGCOMM
2004
ACM
14 years 27 days ago
An algebraic approach to practical and scalable overlay network monitoring
Overlay network monitoring enables distributed Internet applications to detect and recover from path outages and periods of degraded performance within seconds. For an overlay net...
Yan Chen, David Bindel, Han Hee Song, Randy H. Kat...