|
|
Program
Thursday,
March 30
|
Friday,
March 31
|
Saturday,
April 1
|
|
|
|
|
|
Session 6: 8:30 -
10:00
|
Dissertation
Competition 1 Chair: S. Ragahavan
|
Minimal Spanning Trees Chair: Luis
Gouveia
|
| Discrete models for content distribution, Bektas |
Determining hop-constrained spanning trees with
repetitive heuristics, Fernandes, Gouveia and Voss |
| Dynamic scheduling in queueing systems with
applications to communication networks, Ross |
The distance
constrained MST: Models and solution procedures, Gouveia, Paias and Sharma
|
| Models and algorithms for effective traffic
engineering of tunnel-based backbone networks, Srivastava |
Hop-constrained
spanning trees: The jump formulation and a relax and cut, Gouveia,
Dahl, Flatberg and Foldnes
|
|
Session 11: 8:30 - 10:00
|
Pricing
and Policy Chair: Nicolas Stier-Moses
|
Survivability Chair: Andras Farago
|
| Telecommunication value intermediation: A portal model,
Werner
and Chakravarty |
Providing survivable interdomain connections over an
optical backbone network, Staessens et al. |
| Lottery-based pricing scheme for peer-to-peer networks,
Zghaibeh
and Harmantzis |
Hop-constrained node survivable network design: An
application to MPLS over WDM, Gouveia, Patricio and de Sousa |
| Network Games
with Atomic Players, Stier-Moses,
Cominetti and Correa |
Survivable network design by demand-wise shared
protection, Koster,
Gruber, Orlowski, Wessäly and Zymolka |
A new
architecture of Internet interconnection with bandwdith trading under
the NgN paradigm, Kim
|
A graph theoretic model for complex network failure
scenarios, Farago |
|
|
Coffee Break
|
|
|
|
| Session 12: 10:15 -
11:45 |
Carrier
Network Design and Performance Chair: Bob Doverspike
|
Location
Problems in Network Design Chair: Rosemary Berger
|
| Why is IP network design so difficult?, Klinewicz |
Locating servers and dimensioning circuits to reduce
delay in an enterprise data network, Berger, Hartman and Trump |
| A study of VPN growth trends for network planning,
Ramakrishnan |
Robust tower location for CDMA networks, Rosenberger and Olinick |
| On WiMax access network design, Li, Wang,
Balasaygun, Doverspike and Magill |
Simultaneous object placement and request routing in
content distribution networks, Bektas, Cordeau, Erkut and Laporte |
Improved bounds for network performability evaluation
algorithms, Oikonomou
and Sinha
|
FTTH-PON splitter location-allocation problem, Lee, Kim and Han
|
|
Lunch
|
|
|
|
|
Coffee Break
|
|
| Session 9: 14:45 -
16:15 |
Mobile Communication Networks Chair:
Neil Keon
|
Novel
Optimization Models and Solutions in Communications Chair: Iraj
Saniee
|
| Pricing and
competition in the mobile
telecommunications, Cricelli, DiPillo, Gastaldi and Ghiron |
RWA decomposition for optimal throughput in
reconfigurable optical networks, Brzezinski and Modiano |
Optimal
design of next-generation wireless
base station subsystems: Models and algorithms, Kalvenes
|
Projective cone
scheduling algorithms for maximal throughput in packet switch networks,
Ross
|
Revenue management and user behavior in mobile
communications, Keon
and Kalvenes
|
Cooperative data-optical InterNetworking: Distributed
multi-layer optimization, Mitra, Walid and Wang |
| BitTorrent and incentive to collaborate, Jin, Shu and Kesidis |
An equitable bandwidth allocation model for
video-on-demand networks, Luss |
|
| Session 14: 14:45 -
16:15 |
Ad
Hoc Mobile Networks Chair: Clayton Commander
|
OSPF Chair: Bernard Fortz
|
| A greedy randomized algorithm for the cooperative
communication problem on ad hoc networks, Commander et al. |
Survivable composite-link IP network design with OSPF
routing, Resende,
Andrade,
Buriol, and Thorup |
| Node-independent multipath routing algorithm for
mobil ad hoc networks, Pasaogullari, Harmononsky and
Joshi |
Comparison of objective functions of the unique
shortest path routing problem, Zhang |
| Total energy optimal multicasting in wireless ad hoc
networks, Min
and Pardalos |
An arc-path model for the OSPF weight setting problem,
Madhavan |
| A class of approximation algorithms for the minimum
energy broadcast routing problem, Bauer, Haugland and Yuan |
A primal-dual approach for the IGP weight setting
problem, Fortz
and Thorup |
Schedule algorithms for data extraction in energy
limited wireless sensor networks, Ye
|
|
|
Coffee Break
|
| Session
5: 17:00 - 18:00 |
| Keynote
Address |
| Delivering Multimedia Home Entertainment:
Services and Technologies, Michael
Grasso (assistant vice president, Consumer Marketing, AT&T U-verse),
bio |
|
| Reception:
18:00-19:30 |
|
Sponsored by
|
|
|
| Session 15: 16:30 -
18:00 |
Satellite
Networks Chair: Olivier Goldschmidt
|
Local
Access and Tree Networks Chair: Luis Gouveia
|
| Opportunities for network designa nd revenue
management in satellite communication networks, Fromont, Gamvros,
Ragahvan and Srikar |
Flow models for local access network expansion problem,
Corte-Real
and Gouveia |
| Traffic routing and onboard configuration planning in
satellite networks, Gamvros and Raghavan |
Cross decomposition of the capacitated minimum
spanning tree problem, Sohn and Bricker
|
| An integer programming model for optimizing satellite
and terrestrial network configuration and routing, Chandran, Fromont and
Srikar |
Traffic engineering of Ethernet carries networks
based on multiple spanning trees, de Sousa and Soares |
| SatPack - optimal transponder capacity re-allocation
for operational contingency planning, Fromont, Srikar and
Goldschmidt |
Performance evaluation of solution
strategies for TKP and ETKP problems in LATN design, van der Merwe and
Hattingh |
|
|