Now, for e (N1 NU ) \ N we have that N (N1 NU ) \ cfw_e and therefore e (u) e (u u(e)
(recall that u(e) denotes denotes the binary vector with all entries equal to 0 except for u(e)e = 1).
Finally,
F (u) F (u0 )
=
eNU (1
0
e(N1 NU )\N ( e (u
u(e) e (u0
9
C
d
p ldp xdp
d
p Ld xdp
=
d Ld
p xdp
=
d Ld hd
(the last equality is implied by constraint (4.1.7a). Now observe that the assumption of the fact stated in
Exercise 4.3 implies that
EL7363, Fall 2011: Solutions for Homework #3
d Ld hd
= C + ,
where > 0.
EL7363 Homework 7 Solutions (Fall, 2011)
November 22, 2011
1. For the network in Figure 1, there are four nodes, and ve undirected links. The number on a
link is its link id. The link capacities are given as C1 = 17, C2 = 10, C3 = 8, C4 = 11, C5 = 13
Supp
Topological Design So far deal with link dimensioning: links
already in place cost increases with link capacity q
Topological Design long-term network planning stage
where to place nodes/links installation/opening cost capacity
independent q Two Types of
EL7363 Communications Networks II:
Design and Algorithms
Class10: Restoration and Protection
Design of Resilient Networks
Yong Liu
1
Outline
q Resilient Network Design
q Link Capacity Re-establishment
q Demand Flow Re-establishment
q Separated Normal and
Observe that using the piecewise linear approximation of the dimensioning functions Fe () would involve an additional term in the objective function and the objective function would look as follows (see
solution to Exercise 4.22):
objective
minimize
r+
e
For SS7 node location design formulation, the only change that is needed is to modify (6.1.1b) in the
following way:
j uij
= 2,
i = 1, 2, . . . , N .
Solution to 6.2
EL7363, Fall 2011: Solutions for Homework #5
Lagrangian-relaxation for (6.1.1)
Incidently
1
Peer-to-Peer Streaming of Layered Video:
Efciency, Fairness and Incentive
Hao Hu , Yang Guo , and Yong Liu
Electrical & Computer Engineering, Polytechnic Institute of NYU, Brooklyn, NY 11201
Research and Innovation, Technicolor, Princeton, NJ 08540
Ab
Weighted ECMP for IP Network
Junjie Zhang
0402063
1
Motivation
Equal-Cost Multipath (ECMP) routing equally split traffic among the multiple
paths [4]. However, evenly splitting traffic among the paths does not achieve
optimal load balancing
0.5
0.5
S1
0.5
Resource Allocation for Data
Center Networks
Zizhong CAO
12/5/2011
0431398
1
Outline
Introduction
Problem Statement and Modeling
Definition and Notation
Problem Formulation
Optimization over B-Cube Network
B-Cube Network Topology
Heuristic Algorith
Distinguishing Users with
Capacitive Touch Communication
Tam Vu, Akash Baid, Simon Gao, Marco Gruteser, Richard Howard, Janne Lindqvist,
Predrag Spasojevic, Jeffrey Walling
WINLAB, Rutgers University
cfw_tamvu, baid, gruteser, reh, janne, spasojev @winlab
EL7363 Communications Networks II:
Design and Algorithms
Class12: Final Design Project
1
Objective
q Apply modeling and solution techniques learned from
this course to solve network design problem:
routing, dimensioning, topological design, fairness, res
Micha Pi ro & Deepankar Medhi
o
Micha Pi ro & Deepankar Medhi
o
SOLUTIONS TO EXERCISES
EXERCISES
(Chapters 2-9)
(Chapters 2-9)
EL7363, Fall 2011: Solutions for Homework #1
Chapter 2
Chapter 2
Solution to 2.1
Solution to 2.1
Link path formulation in link-d