Monday, September 23, 2013
What is meant by Quality of Service provided by network layer?
Posted by
Sunflower
at
9/23/2013 10:37:00 PM
0
comments
Labels: Applications, Communication, Frequency, Networks, Packets, Parameters, Protocols, QOS, Quality, Quality of Service, Requirements, Services, Signals, Switch, Telecommunication, traffic, Users
|
| Subscribe by Email |
|
Monday, September 16, 2013
What are the differences between inter-network routing and intra-network routing?
Posted by
Sunflower
at
9/16/2013 11:03:00 PM
0
comments
Labels: Connection, Data, device, efficient, Information, Infrastructure, Internetwork Routing, Intranetwork Routing, Network, Networking, Organization, Packets, Protocols, Resources, Router, Routing, Switch, System
|
| Subscribe by Email |
|
Sunday, September 15, 2013
What is inter-network routing?
Posted by
Sunflower
at
9/15/2013 02:16:00 PM
0
comments
Labels: Address, Bridge, Destination, Functionality, Gateways, Hardware, Host, Inter-network Routing, Network, Networking, Packets, Performance, Protocols, Route, Routers, Routing, Software, Switch, System, Units
|
| Subscribe by Email |
|
Saturday, September 7, 2013
Explain the concept of inter-networking?
- OSI or the open system
interconnection model: This model comes with 7 layer architecture that
covers the hardware and the software interface.
- TCP/ IP model: The
architecture of this model is somewhat loosely defined when compared with
the OSI model.
Posted by
Sunflower
at
9/07/2013 11:06:00 PM
0
comments
Labels: device, Gateways, Hardware, Inter-networking, Interface, Internet, LAN, Layers, Link, Networking, Networks, Packets, Protocols, Route, Router, Routing, Software, Switch, Technology, WAN
|
| Subscribe by Email |
|
Wednesday, August 14, 2013
What is the idea behind link state routing?
- IS – IS i.e., intermediate
system to intermediate system and
- OSPF i.e., the open shortest
path first
Idea behind the Link State Routing
- Determination of the
neighboring nodes: Each node determines to which all neighboring nodes it
is connected to. Also, it needs to know whether over the links through
which it is connected are fully working or not. A reach-ability protocol is
used for accomplishing this task. This protocol is run regularly but in
separation from the neighboring nodes.
- Distribution of the map
information: The link state advertisement is the short message that is
made by the node in case of some modification in the connectivity
periodically.
- Calculation of the shortest
paths: Shortest path from one node to other nodes is determined by running
a shortest path routing algorithm over the entire map. The commonly used
algorithm is the Dijkstra’s algorithm.
- Filling the routing table: The
table is filled with best shortest paths obtained in the above step for
every two nodes.
- Optimizations: We gave a
glance of the simple form of this algorithm but in practical applications
this form is used along with a number of optimizations. Whenever a change
is detected in the network connectivity, the shortest path tree has to be
immediately recomputed and then the routing table must be recreated. A
method was discovered by the BBN technologies for recomputing only the affected
part of the tree.
Posted by
Sunflower
at
8/14/2013 08:00:00 PM
0
comments
Labels: Communication, Destination, Information, Link state Routing, Links, Network, Networking, Packet Switching Network, Paths, Protocols, Route, Routes, Routing, Routing table, Source, States, Switch, Switching, Tasks
|
| Subscribe by Email |
|
Saturday, July 20, 2013
What are data gram sub-nets?
- Layer
1: chip (CDMA)
- Layer
2: frames (IEEE 802.3 and IEEE 802.11), cell (ATM)
- Layer
3: data packet
- Layer
4: data segment
Posted by
Sunflower
at
7/20/2013 03:16:00 PM
0
comments
Labels: Advantages, Communication, Connection, Datagram Subnets, Destination, Disadvantages, Hosts, Information, Layers, Network, Operate, OSI, Packets, Protocols, Source, Subnets, Switch, User
|
| Subscribe by Email |
|