About Selwyn Dmello

A Computer Engineering Student, Blogger, Java Programmer, Web Developer and Owner of this website.

Packet Grabbing Tools

1.SmartSniff It is a network monitoring tool that allows you to grab TCP/IP packets that pass through  network adapter, and view the captured data as sequence of conversations between clients and servers. You can view the TCP/IP conversations in Ascii Continue reading

A Case Study on CORBA-Common Object Request Broker Architecture with Source Code

corba

The Common Object Request Broker Architecture (CORBA) is a standard defined by the Object Management Group (OMG) designed to facilitate the communication of systems that are deployed on diverse platforms. CORBA enables collaboration between systems on different operating systems, programming Continue reading

Dijkstra’s algorithm with Java Code Program Example

dijkstra

Dijkstra’s algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1956 and published in 1959, is a graph search algorithm that solves the single-source shortest path problem for a graph with non-negative edge path costs, producing a shortest path tree. This algorithm is often used in routing and as a subroutine in other graph algorithms. ALGORITHM: Let Continue reading

ISA-Industry Standard Bus Architecture Case Study

isa

  Industry Standard Architecture Industry Standard Architecture (ISA) is a computer bus standard for IBM PC compatible computers introduced with the IBM Personal Computer to support its Intel 8088 microprocessor’s 8-bit external data bus and extended to 16 bits for Continue reading

A Case Study on Wifi and WiMAX

wifi

Wifi and WiMAX Wifi It is a popular technology that allows an electronic device to exchange data wirelessly (using radio waves) over a computer network, including high-speed Internet connections. The Wi-Fi Alliance defines Wi-Fi as any “wireless local area network Continue reading

A Study on Distance-vector routing protocol-DVR

4d

Distance-vector routing protocol Introduction: The term distance vector refers to the fact that the protocol manipulates vectors (arrays) of distances to other nodes in the network. Examples of distance-vector routing protocols include RIPv1 and RIPv2 and IGRP. EGP and BGP Continue reading