Proceedings - IEEE INFOCOM
SCOPUS (1983-2024)
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
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
Virtual-topology adaptation for WDM mesh networks under dynamic traffic
Tập 1 - Trang 48-56 vol.1
We present a new approach to the virtual-topology reconfiguration problem for
wavelength-routed, optical wide-area networks under dynamic traffic demand. By
utilizing the measured Internet backbone traffic characteristics, an adaptation
mechanism is proposed to follow the changes in traffic without assuming that the
future traffic pattern is known. In that sense, our work differs from previous
stu...
#Wavelength division multiplexing #WDM networks #Mesh networks #Telecommunication traffic #Optical sensors #Time measurement #Watermarking #Optical fiber networks #Wavelength measurement #Internet
Packet scheduling with fragmentation
Tập 1 - Trang 427-436 vol.1
We investigate a scheduling problem in a TDMA environment where packets may be
fragmented. Our model of the problem is derived from a scheduling problem
present in data over CATV networks, where a slotted TDMA channel is used to
carry both real-time and best-effort traffic. Packets of real-time flows have
high priority and are allocated in fixed, periodically located slots.
Best-effort packets hav...
#Scheduling algorithm #Time division multiple access #Collision mitigation #Timing #Telecommunication traffic #Traffic control #Cable TV #Modems #Media Access Protocol #Read only memory
Clustering overhead for hierarchical routing in mobile ad hoc networks
Tập 3 - Trang 1698-1706 vol.3
Numerous clustering algorithms have been proposed that can support routing in
mobile ad hoc networks (MANET). However, there is very little formal analysis
that considers the communication overhead incurred by these procedures. Further,
there is no published investigation of the overhead associated with the
recursive application of clustering algorithms to support hierarchical routing.
This paper ...
#Routing #Intelligent networks #Mobile ad hoc networks #Clustering algorithms #Network topology #Scalability #Measurement #Performance analysis #Mobile communication #Upper bound
Optimal configuration of OSPF aggregates
Tập 2 - Trang 874-882 vol.2
Open shortest path first (OSPF) is a popular protocol for routing within an
autonomous system (AS) domain. In this paper, we address the important practical
problem of configuring OSPF aggregates to minimize the error in OSPF shortest
path computations due to subnet aggregation. We first develop an optimal dynamic
programming algorithm that, given an upper bound k on the number of aggregates
to be...
#Aggregates #Databases #Routing protocols #Internet #Joining processes #Network topology #Advertising #Costs #Bandwidth
Power and server allocation in a multi-beam satellite with time varying channels
Tập 3 - Trang 1451-1460 vol.3
We consider power and server allocation in a multi-beam satellite downlink which
transmits data to N different ground locations over N time-varying channels.
Packets destined for each ground location are stored in separate queues, and the
server rate for each queue i depends on the power p/sub i/(t) allocated to that
server and the channel state c/sub i/(t) according to a concave rate-power curve
...
#Satellites #Downlink #Time-varying channels #Power system modeling #Algorithm design and analysis #Stability analysis #Routing #Throughput #Interchannel interference #Interference constraints
Delay bounds for approximate maximum weight matching algorithms for input queued switches
Tập 2 - Trang 1024-1031 vol.2
Input Queued (IQ) switch architecture has been of interest due to its low memory
bandwidth requirement. A scheduling algorithm is required to schedule the
transfer of packets through cross-bar switch fabric at every time slot. The
performance, that is throughput and delay, of a switch depends on the scheduling
algorithm. The maximum weight matching (MWM) algorithm is known to deliver 100%
throughp...
#Delay #Impedance matching #Scheduling algorithm #Switches #Throughput #Traffic control #Approximation algorithms #Bandwidth #Packet switching #Fabrics
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
On-line admission control and packet scheduling with interleaving
Tập 1 - Trang 94-103 vol.1
This paper presents a comprehensive study of the effect of job interleaving by
preemption on the throughput of a single server where requests arrive with a
given processing time and slack. The problem is to decide which requests to
serve so as to maximize the server's utilization. This simple model captures
many situations, both at the application (e.g., delivery of video) as well as at
the networ...
#Admission control #Scheduling algorithm #Interleaved codes #Network servers #Switches #Performance analysis #Algorithm design and analysis #Throughput #Packet switching #Analytical models