Proceedings - IEEE INFOCOM
SCOPUS (1983-2023)
0743-166X
Mỹ
Cơ quản chủ quản: Institute of Electrical and Electronics Engineers Inc.
Lĩnh vực:
Computer Science (miscellaneous)Electrical and Electronic Engineering
Phân tích ảnh hưởng
Các bài báo tiêu biểu
Bluetooth scatternets: an enhanced adaptive scheduling scheme
Tập 2 - Trang 782-790 vol.2
The vision of ad-hoc networking with Bluetooth includes the concept of devices participating in multiple "piconets" and thereby forming a "scatternet". However, the details of scatternet support for Bluetooth are not specified yet. This paper presents a scheme for Bluetooth scatternet operation that adapts to varying traffic patterns. Being based on sniff mode, it does not require substantial modi......
#Bluetooth #Personal area networks #Adaptive scheduling #Master-slave #Spread spectrum communication #Space technology #Personal digital assistants #Mobile handsets #Job shop scheduling #Frequency conversion
Distributed construction of connected dominating set in wireless ad hoc networks
Tập 3 - Trang 1597-1604 vol.3
The connected dominating set (CDS) has been proposed as the virtual backbone or spine of a wireless ad hoc network. Three distributed approximation algorithms have been proposed in the literature for minimum CDS. We first reinvestigate their performances. None of these algorithms have constant approximation factors. Thus these algorithms can not guarantee to generate a CDS of small size. Their mes......
#Intelligent networks #Ad hoc networks #Mobile ad hoc networks #Spine #Distributed algorithms #Network topology #Approximation algorithms #Computer networks #Computational efficiency #Land mobile radio cellular systems
Gothic: a group access control architecture for secure multicast and anycast
Tập 3 - Trang 1547-1556 vol.3
Multicast and anycast have received considerable attention due to their ability to support networked services. There are distinct and significant security vulnerabilities in both the multicast and anycast model including denial of service, theft or service, eavesdropping, and masquerading. The multicast problem requires a secure IGMP. The anycast problem requires secure anycast server advertisemen......
#Access control #Network servers #Multicast protocols #Routing protocols #Cryptography #Scalability #Computer crime #Security #Computer architecture #Educational institutions
SWAN: service differentiation in stateless wireless ad hoc networks
Tập 2 - Trang 457-466 vol.2
We propose SWAN, a stateless network model which uses distributed control algorithms to deliver service differentiation in mobile wireless ad hoc networks in a simple, scalable and robust manner. We use rate control for UDP and TCP best-effort traffic, and sender-based admission control for UDP real-time traffic. SWAN uses explicit congestion notification (ECN) to dynamically regulate admitted rea......
#Mobile ad hoc networks #Communication system traffic control #Traffic control #Testing #Distributed control #Robust control #Admission control #Telecommunication traffic #Analytical models #Delay
Real-time model and convergence time of BGP
Tập 2 - Trang 893-901 vol.2
BGP allows routers to use general preference policies for route selection. This paper studies the impact of these policies on convergence time. We first describe a real-time model of BGP. We then state and prove a general theorem providing an upper bound on convergence time. Finally, we show how to the use the theorem to prove convergence and estimate convergence time in three case studies.
#Convergence #Peer to peer computing #Routing protocols #Upper bound #Shortest path problem #Distributed algorithms #Concatenated codes
Stability of a multicast tree
Tập 2 - Trang 1099-1108 vol.2
Most of the currently deployed multicast protocols (e.g. DVMRP, PIM, MOSPF) build one shortest path multicast tree per sender, the tree being rooted at the sender's subnetwork. This paper examines the stability of such a tree, specifically, how the number of links change as the number of multicast users in a group changes. We make two modelling assumptions: (a) packets are delivered along the shor......
#Stability #Streaming media #Application software #Multicast protocols #Topology #Video sharing #Videoconference #Video compression #Routing protocols #Density functional theory
How good are deterministic fluid models of Internet congestion control?
Tập 2 - Trang 497-505 vol.2
Congestion control algorithms used in the Internet are difficult to analyze or simulate on a large scale, i.e., when there are large numbers of nodes, links and sources in a network. The reasons for this include the complexity of the actual implementation of the algorithm and the randomness introduced in the packet arrival and service processes due to many factors such as arrivals and departures o......
#Internet #Delay #Differential equations #Proportional control #Fluid flow control #Throughput #Bandwidth #Predictive models #IP networks #Algorithm design and analysis
Stochastic approaches to compute shared mesh restored lightpaths in optical network architectures
Tập 2 - Trang 801-807 vol.2
We assess the benefits of using statistical techniques to ascertain the shareability of protection channels when computing shared mesh restored lightpaths. Current deterministic approaches require a detailed level of information proportional to the number of active lightpaths, and do not scale well as traffic demands and network grow. With the proposed approach, we show that less information, inde......
#Stochastic processes #Computer networks #Optical computing #Intelligent networks #Optical fiber networks #Computer architecture #Costs #Protection #Buildings #Topology
Session-based overload control in QoS-aware Web servers
Tập 2 - Trang 516-524 vol.2
With the explosive use of the Internet, contemporary Web servers are susceptible to overloads and their services deteriorate drastically and often cause denial of services. In this paper, we propose two methods to prevent and control overloads in Web servers by utilizing the session-based relationship among HTTP requests. We first exploited the dependence among session-based requests by analyzing ......
#Web server #Capacity planning #Scheduling algorithm #Computer crime #Delay #Quality of service #Web services #Availability #Explosives #Web and internet services
Clock synchronization algorithms for network measurements
Tập 1 - Trang 160-169 vol.1
Packet delay traces are important measurements for analyzing end-to-end performance and for designing traffic control algorithms in computer networks. Due to the fact that the clocks at the end systems are usually not synchronized and running at different speeds, these measurements can be quite inaccurate. We propose several algorithms to estimate and remove the relative clock skews from delay mea......
#Clocks #Synchronization #Algorithm design and analysis #Delay estimation #Performance analysis #Traffic control #Computer networks #Velocity measurement #Linear regression #Linear programming