Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
2,397,115
The Access Network Design Problem
, 1998
"... We consider the problem of designing a minimum costaccess network to carry traffic from a set of endnodes to a core network. A set of trunks of K differing types areavailable for leasing or buying. Some trunk-types have a high initial overhead cost but a low cost per unit bandwidth. Others have a ..."
Abstract
-
Cited by 45 (1 self)
- Add to MetaCart
We consider the problem of designing a minimum costaccess network to carry traffic from a set of endnodes to a core network. A set of trunks of K differing types areavailable for leasing or buying. Some trunk-types have a high initial overhead cost but a low cost per unit bandwidth. Others have a
Reformulation, Column Generation And Lagrangian Relaxation For Local Access Network Design Problems
, 1994
"... In this paper, we present several models of Local Access Network Design and Expansion problems, and discuss different alternatives for solving these problems, as well as the relationships among different approaches. One of our results shows that both Design and Expansion problems provide examples fo ..."
Abstract
- Add to MetaCart
In this paper, we present several models of Local Access Network Design and Expansion problems, and discuss different alternatives for solving these problems, as well as the relationships among different approaches. One of our results shows that both Design and Expansion problems provide examples
A MIP-based approach to solve the Prize-Collecting Local Access Network Design Problem
, 2013
"... This paper presents a new combinatorial optimization problem that can be used to model the deployment of broadband telecommunications systems in which optical fiber cables are installed between a central office and a number of end-customers. In this capacitated network design problem the installatio ..."
Abstract
- Add to MetaCart
, and aims for minimizing the total cost of the network providing this minimum service. For that reason the underlying problem is called the Prize-Collecting Local Access Network Design problem (PC-LAN). We propose a branch-and-cut approach for solving small instances. For large instances of practical
Design and Implementation or the Sun Network Filesystem
, 1985
"... this paper we discuss the design and implementation of the/'fiesystem interface in the kernel and the NF$ virtual/'fiesystem. We describe some interesting design issues and how they were resolved, and point out some of the shortcomings of the current implementation. We conclude with some i ..."
Abstract
-
Cited by 504 (0 self)
- Add to MetaCart
this paper we discuss the design and implementation of the/'fiesystem interface in the kernel and the NF$ virtual/'fiesystem. We describe some interesting design issues and how they were resolved, and point out some of the shortcomings of the current implementation. We conclude with some
Theoretical improvements in algorithmic efficiency for network flow problems
-
, 1972
"... This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimum-cost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps req ..."
Abstract
-
Cited by 565 (0 self)
- Add to MetaCart
problem, in which all shortest-path computations are performed on networks with all weights nonnegative. In particular, this
Medium Access Control with Coordinated Adaptive Sleeping for Wireless Sensor Networks
- IEEE/ACM Transactions on Networking
, 2004
"... This paper proposes S-MAC, a medium access control (MAC) protocol designed for wireless sensor networks. Wireless sensor networks use battery-operated computing and sensing devices. A network of these devices will collaborate for a common application such as environmental monitoring. We expect senso ..."
Abstract
-
Cited by 684 (15 self)
- Add to MetaCart
This paper proposes S-MAC, a medium access control (MAC) protocol designed for wireless sensor networks. Wireless sensor networks use battery-operated computing and sensing devices. A network of these devices will collaborate for a common application such as environmental monitoring. We expect
The broadcast storm problem in a mobile ad hoc network
- ACM Wireless Networks
, 2002
"... Broadcasting is a common operation in a network to resolve many issues. In a mobile ad hoc network (MANET) in par-ticular, due to host mobility, such operations are expected to be executed more frequently (such as finding a route to a particular host, paging a particular host, and sending an alarm s ..."
Abstract
-
Cited by 1217 (15 self)
- Add to MetaCart
Broadcasting is a common operation in a network to resolve many issues. In a mobile ad hoc network (MANET) in par-ticular, due to host mobility, such operations are expected to be executed more frequently (such as finding a route to a particular host, paging a particular host, and sending an alarm
Designing Games With A Purpose
, 2008
"... Data generated as a side effect of game play also solves computational problems and trains AI algorithms. ..."
Abstract
-
Cited by 524 (2 self)
- Add to MetaCart
Data generated as a side effect of game play also solves computational problems and trains AI algorithms.
Network information flow
- IEEE TRANS. INFORM. THEORY
, 2000
"... We introduce a new class of problems called network information flow which is inspired by computer network applications. Consider a point-to-point communication network on which a number of information sources are to be mulitcast to certain sets of destinations. We assume that the information source ..."
Abstract
-
Cited by 1961 (24 self)
- Add to MetaCart
We introduce a new class of problems called network information flow which is inspired by computer network applications. Consider a point-to-point communication network on which a number of information sources are to be mulitcast to certain sets of destinations. We assume that the information
Results 1 - 10
of
2,397,115
