How Spanning Tree Protocol works?
147219
The spanning tree protocol for routers work like this.\n\n1. Each router is supposed to be a node in the graph and physical connecting lines as the edges.\n\n2. Each router puts a dummy packet to all its neighbours and calculates the cost of the physical network line there.\n\n3. This cost is assigned to the respective edge.\n\n4. Once all the edges are assigned the weight. The spanning tree is calculated using either the Prim's or the Kruskal's algorithm, which is a simple elimination algorithm.\n\nThe spanning tree algorithm highlights the edges which are to be used while multicasting or broadcasting a message packet. The spanning tree ensures that \n\nA) all the nodes (routers) get connected, \n\nB) there is no repetition of data transfer to a router,\nand\nC) the total cost (sum of costs of all the physical lines used) of the network is the minimal.\n\nDue to dynamic nature of networks(their status and traffic), one needs to run the Spanning Tree Algorithm over and over again. This is particularly done after a specified amount of time.\n\nRegards\nParvesh
708214
When an IP device needs to speak to another IP device on the same subnet it must have the hardware address of that device.  To get it, it looks in its ARP table (which is empty at first).  Finding nothing, it sends a broadcast ARP request saying "would the owner of the IP address a.b.c.d please respond to me?"  The all stations on the subnet hear the request and the owner responds "this is me."  (The packet with the response carries the hardware address of the responder.)  The original requester caches that association of IP address and hardware address in its ARP table.\n\nThe next time the requester wants to send a packet to the same IP address, it would find the IP address-hardware address association in the ARP table and would skip the broadcast message.  It can send the packet without re-doing the address resolution because it already "knows" from the ARP table.\n\nARP entries age out of the table after a few minutes or if another device with that IP address (and a different hardware address) speaks up.  This was if you shut down a computer, replace the network card (changing the hardware address), and re-start, the other devices on the network will learn to know your computer by the new hardware address when they want to send packets to you.\n\nThe ARP tables cut the number of broadcast network packets dramatically (every station has to receive and decide what to do with each broadcast packet).  Without the ARP table, every packet sent would be proceeded by a broadcast packet and a response from the receiver--three packets for every one effective transmitted packet.
171412
1. get a switch\n2. get some straight UTP cables (as many as the computers you want to have in your network). The cables can be up to 100 meters long. \n3. make sure all your computers have network cards\n4. connect the computers to the switch using the cables\n5. power the switch\n6. configure the ip addressess your computers. Use 192.168.1.1 for the first computer, 192.168.1.2 for the second and so on. configure the subnet masks as 255.255.255.0\n7. Make sure all your computers are in the same workgroup.\n8. have fun sharing :D
866263
Token passing is an excellent way to eliminate collisions.  Only stations with "the token" are permitted to communicate...kind of like "raising your hand" in a classroom to prevent everyone from talking at the same time.\n  \nThis is fundamentally different from the CSMA/CD technology that standard ethernet uses to reduce collisions.  (basically...after a collision, each station waits a random amount of time before retransmitting):\nhttp://www.webopedia.com/TERM/C/CSMA_CD.html
533325
In the TCP/IP protocol suite, data is exchanged in the form of packets. Because of the way TCP/IP performs routing, the path taken by packets can change dynamically throughout a session. This means that if Host A and B are communicating and Host A sends two packets, they could potentially take different paths to Host B, and could arrive out of order. Host B must therefore have a way to re-assemble the packets (containing the data in octets) in correct order. \n\nTCP/IP provides a way to do this using sequence numbers. Starting from an initial sequence number (ISN) that each host provides as part of the session setup, each octet is assigned a sequence number that is one larger than that of its predecessor. For example, if Host B provides 123 as the initial sequence number for its session with Host A, Host A's first octet is numbered 123, the second is numbered 124, the third is numbered 125, etc. \n\nIf someone attempts to launch an attack against another computer and the attacker can predict how a host selects ISNs, it's possible to conduct two types of attacks, known as IP address spoofing and session hijacking. The more random the ISNs are, the more difficult it is to carry out these attacks. \n\nFor related information on this problem, please visit the following Microsoft Web site: \nhttp://www.microsoft.com/technet/security/bulletin/MS99-046.asp (http://www.microsoft.com/technet/security/bulletin/MS99-046.asp)\nFor additional security-related information about Microsoft products, please visit the following Microsoft Web site: \nhttp://www.microsoft.com/technet/security/
1106437
to know about the SPANNING TREE OPTIMAL PATH METHOD SPECIALLY THE WARSHALL METHOD WITH SUITABLE EXAMPLE visit the below mentioned site u will get all the info. \nhttp://www.me.utexas.edu/~jensen/ORMM/models/unit/combinatorics/tree.html\nyou can also see in wikipedia.com
662828
The implementation I have used is for computer to computer transfers when no other network is available.  \n\nI used this protocol to transfer files from an old computer being put out of commision to a new computer.  \n\nReally don't see much other use for it.  No permanant uses anyway, it's too unstable.  You have to have a crossover cable to be able to use this protocol.  Then you just plug one end to one computer's Network card and the other to the other, no routers or hubs needed.  Good for temporary use, not much else.
894482
Bus topology: \n                            All devices are connected to a central cable, called the bus or backbone. Bus networks are relatively inexpensive and easy to install for small networks. Ethernet systems use a bus topology. This topology uses Co-axial Cables.\n\nRing topology : \n                             All devices are connected to one another in the shape of a closed loop, so that each device is connected directly to two other devices, one on either side of it. Ring topologies are relatively expensive and difficult to install, but they offer high bandwidth and can span large distances. Here if and one system become fails, the total network will get collapsed.\n\nStar topology: \n                            All devices are connected to a central hub. Star networks are relatively easy to install and manage, but bottlenecks can occur because all data must pass through the hub. This topology uses UTP CAT5 cables. Normally this type of network is followed in most places.\n\nFor further information along with pic, visit\nhttp://www.webopedia.com/TERM/T/topology.html
243113
Sounds like the routing table needs to be updated. A router connects two networks.\n\nYour system can ping the router and your local resources.\n\nThe remote system can ping the router and access their local resources.\n\nBut the two networks cannot contact each other. The routing table in the router is what facilitates the two networks contacting each other. It tells where other PC's are on other networks. Without this, a PC wouldn't know where other PC's are on other networks and couldn't talk. Which is what's happening.
451331
Types of computer network\n\n1) A bus network is a network architecture in which a set of clients are connected via a shared communications line, called a bus. There are several common instances of the bus architecture, including one in the motherboard of most computers, and those in some versions of Ethernet networks.\n\nBus networks are the simplest way to connect multiple clients, but often have problems when two clients want to transmit at the same time on the same bus. Thus systems which use bus network architectures normally have some scheme of collision handing or collision avoidance for communication on the bus, quite often using Carrier Sense Multiple Access or the presence of a bus master which controls access to the shared bus resource.\n\nA true bus network is passive – the computers on the bus simply listen for a signal; they are not responsible for moving the signal along. However, many active architectures can also be described as a "bus", as they provide the same logical functions as a passive bus; for example, switched Ethernet can still be regarded as a logical bus network, if not a physical one. Indeed, the hardware may be abstracted away completely in the case of a software bus.\n\nWith the dominance of switched Ethernet over passive Ethernet, passive bus networks are uncommon in wired networks. However, almost all current wireless networks can be viewed as examples of passive bus networks, with radio propagation serving as the shared passive medium.\n\n\n2) Star networks are one of the most common computer network topologies. In its simplest form, a star network consists of one central switch, or hub computer which acts as a router to transmit messages.\n\nWhen applied to a bus-based network, this central hub rebroadcasts all transmissions received from any peripheral node to all peripheral nodes on the network, sometimes including the originating node. All peripheral nodes may thus communicate with all others by transmitting to, and receiving from, the central node only. The failure of a transmission line linking any peripheral node to the central node will result in the isolation of that peripheral node from all others, but the rest of the systems will be unaffected.\n\nIf the central node is passive, the originating node must be able to tolerate the reception of an echo of its own transmission, delayed by the two-way transmission time (i.e. to and from the central node) plus any delay generated in the central node. An active star network has an active central node that usually has the means to prevent echo-related problems.\n\n3) A ring network is a topology of computer networks where each node is connected to two other nodes, so as to create a ring. The most popular example is a token ring network.\n\nRing networks tend to be inefficient when compared to star networks because data must travel through more points before reaching its destination. For example, if a given ring network has eight computers on it, to get from computer one to computer four, data must travel from computer one, through computers two and three, and to its destination at computer four. It could also go from computer one through eight, seven, six, and five until reaching four, but this method is slower because it travels through more computers.\n\n4) Mesh networking is a way to route data, voice and instructions between nodes. It allows for continuous connections and reconfiguration around blocked paths by "hopping" from node to node until a connection can be established.\n\nMesh networks are self-healing: the network can still operate even when a node breaks down or a connection goes bad. As a result, a very reliable network is formed. This concept is applicable to wireless networks, wired networks, and software interaction.\n\nA mesh network is a networking technique which allows inexpensive peer network nodes to supply back haul services to other nodes in the same network. It effectively extends a network b
107537
web pages use HTTP protocol which inturn uses TCP/IP not OSI.\n\nEven if you want to relate the 5 tcp/ip layers,\n\nHere is it \nApplication - HTTP (Hyper text transfer protocol)\nTransport - TCP\nInternet - IP \nDatalink- ARP (Address resolution protocol)\nPhysical - generally 802.3 10/100/1000 MBPS if you are on                              LAN
1009057
little known command\n\nhttp://www.microsoft.com/resources/documentation/windows/xp/all/proddocs/en-us/net_send.mspx?mfr=true\n\n\nthere are limitations, they must be windows computers on the same network .  but try it
941387
RIP is limited ti 15 hops and OSPF is not.\nOSPF calcualte the best path by many parameters like bandwidth, delay etc.  whereas RIP works only on hop counting.
15845
In order to enable IP Multicasting, all the nodes on your network (or at least the ones that need to recieve the multicast packets) need to be listening for packets on a certain address (from the Class D range). \nThe sending computer will then start sending data packets to that address, and all the computer should pick them up. The Multicast-HOWTO below is probably a good place to start if you want to set something like this up.
604926
TCP Xmas Tree is a port scanning techinique. The Xmas tree scan sends a TCP frame to a remote device with the URG, PUSH, and FIN flags set. This is called a Xmas tree scan because of the alternating bits turned on and off in the flags byte (00101001), much like the lights of a Christmas tree.\n\nTCP FIN is another port scaning technique. Scaning is done by sending the connection request with FIN bit set.\n\nRFC 739 - Assigned numbers, its a RFC document.\n\nFor further info visit:\nXMas Tree: http://www.networkuptime.com/nmap/page3-5.shtml\nTCP FIN: http://www.insecure.org\nRFC 739: http://www.faqs.org/rfcs/rfc739.html
749932
A communication tree....
463210
Asynchronous Transfer Mode