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
S. Baatz, M. Frank, C. Kuhl, P. Martini, C. Scholz
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... hiện toàn bộ
#Bluetooth #Personal area networks #Adaptive scheduling #Master-slave #Spread spectrum communication #Space technology #Personal digital assistants #Mobile handsets #Job shop scheduling #Frequency conversion
Delay constrained energy efficient transmission strategies for wireless devices
Tập 3 - Trang 1765-1772 vol.3
P. Nuggehalli, V. Srinivasan, R.R. Rao
In this paper, we address the problem of energy efficient packet scheduling in a wireless environment. We consider a wireless transmitter which is limited by its finite battery resource. Our objective is to design a transmission schedule that maximizes battery lifetime subject to some delay constraints. To achieve this, we exploit two previously unconnected ideas: (i) channel coding can be used to... hiện toàn bộ
#Delay #Energy efficiency #Batteries #Transmitters #Channel coding #Scheduling algorithm #Cellular networks #Yarn #CMOS technology #Protocols
Positive correlations and buffer occupancy: lower bounds via supermodular ordering
Tập 3 - Trang 1298-1306 vol.3
S. Vanichpun, A.A. Makowski
We use recent advances from the theory of multivariate stochastic orderings to formalize the "folk theorem" to the effect that positive correlations lead to increased buffer occupancy and larger buffer levels at a discrete-time infinite capacity multiplexer queue. Input sequences are compared in the supermodular (sm) ordering and buffer contents in the increasing convex (icx) ordering, respectivel... hiện toàn bộ
#Traffic control #Buffer storage #Queueing analysis #Educational institutions #Stochastic systems #Multiplexing #Gaussian noise #Design engineering #Space stations #Contracts
Author index
Tập 2 - Trang 1139 - 2002
The author index contains an entry for each author and coauthor included in the proceedings record.
How to market-manage a QoS network
Tập 1 - Trang 284-293 vol.1 - 2002
J. Altmann, H. Daanen, H. Oliver, A.S.-B. Suarez
This paper describes a control mechanism for a future Internet. It is an economic mechanism that enables users to choose different pairs of price/QoS priority levels for network services at the user time scale. The user time scale means that prices vary at a rate suitable for human beings to respond to those price changes. The changes might happen on an hourly, daily, or weekly basis. We believe t... hiện toàn bộ
#Pricing #Quality of service #IP networks #Game theory #Web and internet services #Costs #Queueing analysis #Hardware #Software architecture #Laboratories
Predicting Internet network distance with coordinates-based approaches
Tập 1 - Trang 170-179 vol.1
T.S.E. Ng, Hui Zhang
We propose using coordinates-based mechanisms in a peer-to-peer architecture to predict Internet network distance (i.e. round-trip propagation and transmission delay). We study two mechanisms. The first is a previously proposed scheme, called the triangulated heuristic, which is based on relative coordinates that are simply the distances from a host to some special network nodes. We propose the se... hiện toàn bộ
#IP networks #Peer to peer computing #Economic indicators #Propagation delay #Computer networks #Solid modeling #Performance evaluation #Coordinate measuring machines #Internet #Robustness
Size-based adaptive bandwidth allocation: optimizing the average QoS for elastic flows
Tập 2 - Trang 657-666 vol.2
Shanchieh Yang, G. de Veciana
With a view on improving user perceived performance on networks supporting elastic flows, e.g., multimedia/data file transfers, we identify the key properties that an online dynamic bandwidth allocation policy should have. We then propose a family of bandwidth allocation criteria which depends on the residual work of on-going transfers. Analysis and simulations show that allocating bandwidth in th... hiện toàn bộ
#Channel allocation #Delay #Bandwidth #Throughput #Load flow analysis #Analytical models #Telecommunication traffic #Network topology #Stability #Particle measurements
A Poisson limit for buffer overflow probabilities
Tập 2 - Trang 994-1003 vol.2
J. Cao, K. Ramanan
A key criterion in the design of high-speed networks is the probability that the buffer content exceeds a given threshold. We consider n independent identical traffic sources modelled as point processes, which are fed into a link with speed proportional to n. Under fairly general assumptions on the input processes we show that the steady state probability of the buffer content exceeding a threshol... hiện toàn bộ
#Buffer overflow #Traffic control #Telecommunication traffic #Steady-state #High-speed networks #Costs #Tail #Asynchronous transfer mode #Probability #Switches
Real-time model and convergence time of BGP
Tập 2 - Trang 893-901 vol.2
D. Obradovic
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
Energy-efficient scheduling of packet transmissions over wireless networks
Tập 3 - Trang 1773-1782 vol.3
A. El Gamal, C. Nair, B. Prabhakar, E. Uysal-Biyikoglu, S. Zahedi
The paper develops algorithms for minimizing the energy required to transmit packets in a wireless environment. It is motivated by the following observation: In many channel coding schemes it is possible to significantly lower the transmission energy by transmitting packets over a long period of time. Based on this observation, we show that for a variety of scenarios the offline energy-efficient t... hiện toàn bộ
#Energy efficiency #Wireless networks #Iterative algorithms #Downlink #Channel coding #Closed-form solution #Transmitters #Time sharing computer systems #Scheduling algorithm #Delay