Describe the steps involved in network simplex method, Computer Networking

Assignment Help:

QUESTION 1:

(a) Define what you understand by the following terms in Network Flows:

i) UnDirected Path
ii) Directed Path
iii) Directed Cycle.
iv) Tree

In each of the above, show the differences in terms of nodes and directions.

(b) In Radix Heap Algorithm, the technique of buckets is employed. However this idea is an extension of Dial's Algorithm. Analyse the complexity of Radix Heap Algorithm referring to:

1. Movement of nodes between buckets
2. Node Selection principle

QUESTION 2:

(a) Below is the algorithm of a flow decomposition algorithm.

begin
Initialize
while y ≠ Φ do
begin
              Select(s, y)
              Search(s, y)
              if a cycle C is found then do
              begin
                            let D = Capacity(C, y)
                            Add Flow(D, C) to cycle flows
                            Subtract Flow(D, C) from y.
              end
              if a path P is found then do
              begin
                           let D = Capacity(P, y)
                           Add Flow(D, P) to path flows
                           Subtract Flow(D, P) from y.
               end
end

Describe the complexity of the following:

i) Selecting the initial node,
ii) Finding a cycle or a path,
iii) Update step.

(b) Explain how Lower Bounds on Arc Flows are eliminated. Show your workings by a mathematical representation or otherwise.

(c) Refer to the diagram below, show how we could always provide a flow of at most 10 on Node 4.

                          1881_11.png

QUESTION 3:

(a) Briefly describe the steps involved in Network Simplex Method.

(b) Referring to Dial's Algorithm and assuming C, to be the Largest arc length, complete the table below.

Variables                                   Cost Value
Number of buckets needed
Time to create buckets.
Time to update d() and
buckets.
Time to find min.
Total running time.

(c) Using Kruskal's algorithm, find the minimum spanning tree of the graph as show in Figure 3.1.

                              1776_11.png

                                                       Figure 3.1

(d) Give mathematical models for the 0-1 knapsack problem and the bounded knapsack problem in Dynamic Programming.


QUESTION 4:

(a) Write down a Generic Label Correcting Algorithm.

(b) Explain how you could detect Negative Cost Cycles in a given set of flows.

(c) Prove that a Negative Cycle Algorithm terminates with an optimal flow.


Related Discussions:- Describe the steps involved in network simplex method

Explain about the cell splitting, Cell splitting  In practice, the dist...

Cell splitting  In practice, the distribution of traffic and topographic features is not uniform, and this shows opportunities of capacity enhance. Cells in areas of high usage

Explain about congestion control, Q. Explain about Congestion control? ...

Q. Explain about Congestion control? Congestion control Open-loop congestion control - prevent congestion before it happens retransmission policy - Ret

High availability - application layer, High Availability Oracle web  c...

High Availability Oracle web  cache supports  content  aware  load  balancing  and fail  over  detection. The  features ensure that cache messes are directed to the most  avai

How network gateway is different from routers, Gateway A device linked...

Gateway A device linked to multiple physical TCP/IP networks capable of routing or delivering IP packets among them. Router It's a layer 3 device that connects 2 diss

What is a transaction server, What is a Transaction server? With a tran...

What is a Transaction server? With a transaction server, the client includes remote procedures that reside on the server with an SQL database engine. These remote processes on

Designing a network for a retail customer, You are designing a network for ...

You are designing a network for a retail customer; they plan to have 5 locations initially with the main store acting as the warehousing depot.  Within the next year they are plann

Error detection in lrc, Error Detection- 2D/LRC Adds an additional...

Error Detection- 2D/LRC Adds an additional character (instead of a bit) A block of bits is prearranged in a table The Parity Bit for every data unit is calculate

How does it optimise handovers in cellular networks, Question: (a) In r...

Question: (a) In relation with a cellular network architecture, describe the following terms: (i) Clusters (ii) Pico cells (iii) Nano cells (iii) Cell breathing (b)

Process server, Using a process server (such as inetd or xinetd) to listen ...

Using a process server (such as inetd or xinetd) to listen on a set of well-popular ports and start one another server.  I said that it had much to do with overhead.  Say you set u

Internet protocols, A communication protocol is an agreement which specifie...

A communication protocol is an agreement which specifies a common language two computers use to exchange messages. For instance, a protocol denotes the exact format and meaning of

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd