fig1 and the following discussion are intended to provide a brief , general description of a suitable computing environment in which the invention may be implemented . although not required , the invention will be described in the general context of computer - executable instructions , such as program modules , being executed by a personal computer . generally , program modules include routines , programs , objects , components , data structures , etc . that perform particular tasks or implement particular abstract data types . moreover , those skilled in the art will appreciate that the invention may be practiced with other computer system configurations , including hand - held devices , multiprocessor systems , microprocessor - based or programmable consumer electronics , network pcs , minicomputers , mainframe computers , and the like . the invention may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network . in a distributed computing environment , program modules may be located in both local and remote memory storage devices . with reference to fig1 , an exemplary system for implementing the invention includes a general purpose computing device in the form of a conventional personal computer 20 , including a processing unit 21 , a system memory 22 , and a system bus 23 that couples various system components including the system memory to the processing unit 21 . the system bus 23 may be any of several types of bus structures including a memory bus or memory controller , a peripheral bus , and a local bus using any of a variety of bus architectures . the system memory includes read only memory ( rom ) 24 and random access memory ( ram ) 25 . a basic input / output system 26 ( bios ) containing the basic routines that helps to transfer information between elements within the personal computer 20 , such as during start - up , is stored in rom 24 . in one embodiment of the present invention on a server computer 20 with a remote client computer 49 , commands are stored in system memory 22 and are executed by processing unit 21 for creating , sending , and using self - descriptive objects as messages over a message queuing network in accordance with the invention . the personal computer 20 further includes a hard disk drive 27 for reading from and writing to a hard disk , not shown , a magnetic disk drive 28 for reading from or writing to a removable magnetic disk 29 , and an optical disk drive 30 for reading from or writing to a removable optical disk 31 such as a cd rom or other optical media . the hard disk drive 27 , magnetic disk drive 28 , and optical disk drive 30 are connected to the system bus 23 by a hard disk drive interface 32 , a magnetic disk drive interface 33 , and an optical drive interface 34 , respectively . the drives and their associated computer - readable media provide nonvolatile storage of computer readable instructions , data structures , program modules and other data for the personal computer 20 . although the exemplary environment described herein employs a hard disk , a removable magnetic disk 29 and a removable optical disk 31 , it should be appreciated by those skilled in the art that other types of computer readable media which can store data that is accessible by a computer , such as magnetic cassettes , flash memory cards , digital video disks , bernoulli cartridges , random access memories ( rams ), read only memories ( rom ), and the like , may also be used in the exemplary operating environment . a number of program modules may be stored on the hard disk , magnetic disk 29 , optical disk 31 , rom 24 or ram 25 , including an operating system 35 , one or more application programs 36 , other program modules 37 , and program data 38 . a user may enter commands and information into the personal computer 20 through input devices such as a keyboard 40 and pointing device 42 . other input devices ( not shown ) may include a microphone , joystick , game pad , satellite dish , scanner , or the like . these and other input devices are often connected to the processing unit 21 through a serial port interface 46 that is coupled to the system bus , but may be collected by other interfaces , such as a parallel port , game port or a universal serial bus ( usb ). a monitor 47 or other type of display device is also connected to the system bus 23 via an interface , such as a video adapter 48 . in addition to the monitor , personal computers typically include other peripheral output devices ( not shown ), such as speakers and printers . the personal computer 20 may operate in a networked environment using logical connections to one or more remote computers , such as a remote computer 49 . the remote computer 49 may be another personal computer , a server , a router , a network pc , a peer device or other common network node , and typically includes many or all of the elements described above relative to the personal computer 20 , although only a memory storage device 50 has been illustrated in fig1 . the logical connections depicted in fig1 include a local area network ( lan ) 51 and a wide area network ( wan ) 52 . such networking environments are commonplace in offices , enterprise - wide computer networks , intranets and the internet . when used in a lan networking environment , the personal computer 20 is connected to the local network 51 through a network interface or adapter 53 . when used in a wan networking environment , the personal computer 20 typically includes a modem 54 or other means for establishing communications over the wide area network 52 , such as the internet . the modem 54 , which may be internal or external , is connected to the system bus 23 via the serial port interface 46 . in a networked environment , program modules depicted relative to the personal computer 20 , or portions thereof , may be stored in the remote memory storage device . it will be appreciated that the network connections shown are exemplary and other means of establishing a communications link between the computers may be used . the present invention provides for sending self - descriptive message objects as messages between two or more applications , and operates in any computing environment that supports data objects , whether on a standalone computer or preferably in a networked environment . using self - descriptive objects as messages , a recipient no longer relies on a convention or a special - coding serialization scheme . the recipient application can simply extract a data element from the received object in a standard , well - known way , discover the element &# 39 ; s logical type , and take appropriate programmatic action . the present invention is described in the context of a microsoft message queue server ( msmq ) network and using microsoft component object model ( com ) objects in order to illustrate one embodiment of the invention . the present invention is not so limited , as the teachings disclosed herein provide for the present invention to be used in other messaging systems and communications networks , as well as using other forms of objects and self - descriptive structures . a brief introduction of message queuing is provided below . a more detailed explanation of msmq is described in “ microsoft message queue server ( msmq ),” msdn library — april 1998 , microsoft corporation , and is hereby incorporated by reference . and a detailed explanation of com is described in described in “ com and activex object services ,” msdn library — april 1998 , microsoft corporation , and is hereby incorporated by reference . msmq implements asynchronous communications by enabling applications to send messages to , and receive messages from , other applications . these applications may be running on the same machine or on separate machines connected by a network . msmq messages can contain data in any format that is understood by both the sender and the receiver . when an application receives a request message , it processes the request by reading the contents of the message and acting accordingly . if required , the receiving application can send a response message back to the original requestor . while in transit between senders and receivers , msmq keeps messages in holding areas called queues , hence the name message queuing . msmq queues protect messages from being lost in transit and provide a place for receivers to look for messages when they are ready . applications make requests by sending messages to queues associated with the intended receiver . if senders expect responses in return , they must include the name of a response queue ( that the sender must create in advance ) in all requests that they make to the receiver . turning now to fig2 a , shown is a block diagram illustrating the basics of the transportation of a message 75 from message queuing machine 1 ( computer 80 ) to machine 2 ( computer 90 ) over a transport network 85 supporting such network transport protocols as tcp / ip or ipx . the message 75 contains self - descriptive objects and / or self - descriptive data elements in accordance with the present invention . each computer 80 and 90 performs both server and client operations for transferring messages 75 between their respective message queues . a message queuing enterprise network can span many locations and operate on top of different transport network protocols . the topology of the message queuing enterprise network can be described in terms of ( 1 ) physical location and ( 2 ) communication protocol connectivity . the term “ site ” describes an aspect of the enterprise network based on a physical location . in contrast , a “ connected network ” describes an aspect of the message queuing enterprise network according to communication protocol connectivity . an enterprise network is a collection of sites connected through slow / expensive network connections . a site , is a physical collection of machines , where communication between two machines is cheap and fast . these two computers are typically located in the same physical location , although not required . the concept of a site is integral to the message routing algorithm employed by the message queuing system . in order to route messages throughout the message queuing enterprise network , a message queuing computer must be able to locate the destination message queue . a subset of computers within the message queuing network are also directory servers (“ ds servers ”) which maintain message queuing information , including information to enable routing of messages such as sites , connected networks , and names of ds servers within the message queuing network . a msmq network is a collection of addresses “ speaking ” several communication protocols and are connected by physical communication links . a connected network is a collection of addresses , where every two addresses can communicate directly ( i . e ., the underlying communication network provides the connection if all its components are on - line ). inside a connected network , communication delay and cost may vary . the physical communication lines and the traffic overhead define the communication delay and cost . two addresses in a connected network may be connected by a fast , cheap line , for example , if their machines are in the same site or by a slow expensive line if their machines are in different sites . two machines belong to the same connected network if they support the same protocol , and can have a direct session on that protocol . a machine can support more than one connected network on a specific protocol if it supports more than one address which belong to different connected networks on a specific protocol . a connected network does not consist of more than one protocol . these concepts are further illustrated in fig2 b - c , shown in block diagrams illustrating an enterprise network 200 . as illustrated in fig2 b , shown are three sites : site a ( 201 ), site b ( 202 ), site c ( 203 ), connected by network lines 212 , 213 , and 223 . as previously described herein , sites are a grouping of computers within a message queuing network grouped together for the purposes of routing . one distinction that can be made between sites in a typical message queuing network is that sites are connected to relatively slow , expensive lines . computers within a site are typically connected by fast , cheap lines such as those computers residing on a single ethernet . for example , site a ( 201 ) contains a plurality of message queuing computers 230 , 231 connected by fast networking lines 234 . these computers can also perform additional message queuing functionality . for example , computer 231 might be a ds server . in addition , computer 232 might be a remote access server ( ras ) with software to respond to client requests packets . turning now to fig2 c , illustrated is an enterprise network 200 showing sites a - c ( 201 - 203 ) and connected networks 261 - 264 . as previously described herein , each connected network within a message queuing network represents those machines which can directly communicate with each other using a single networking protocol , such as tcp / ip or ipx . as shown in fig2 c , computers 270 - 272 , 280 - 282 and 290 - 291 support tcp / ip protocol , and computers 283 , 290 , 294 support ipx protocol . a computer can use more than one protocol as represented by computer 290 , or support more than one network interface for the same protocol as represented by computers 270 and 280 . in addition , a computer can be connected to more than one connected network . for example , computers 270 and 280 belong to two connected ip networks 261 and 262 ; and computer 290 belongs to two connected networks 261 and 264 supporting ip and ipx protocols . it is also possible for a connected network to span all sites , such as illustrated by connected network 261 spanning sites a - c ( 201 - 203 ). in one embodiment of the present invention , messages are sent as serialized dictionary objects over a message queuing network . the dictionary represents an abstract data type defined in terms of four fundamental operations that can be performed on it , namely : add , remove , lookup , and enumerate ; with the addition of two operations to serialize and unserialize the persistent dictionary object to enable the dictionary object to be sent across a network . turning now to fig3 a , shown is a block diagram illustrating persistent dictionary object 300 comprising an idictionary interface 310 and an ipersistdict interface 320 . the dictionary object 300 contains a data structure and methods that when invoked , perform operations on the internal data structure . the operations performed on the data elements correspond to methods invoked to perform the desired operation . as implied by the method names , add ( ) 301 adds a specified element to the dictionary ; remove ( ) 302 removes a specified element in the dictionary ; lookup ( ) 303 finds a specified element in the dictionary ; and enumerate ( ) 304 provides a mechanism for obtaining the next element from the dictionary given a position in the dictionary . to enable the dictionary object to be sent across a network , the save ( ) method 321 causes the dictionary object to serialize itself to a specified target location ( i . e ., the message body ) and the load ( ) method 322 loads a serialized dictionary object . the dictionary elements , in an embodiment of the present invention , are in the form of a triplet comprised of a name , type and value . the name represents a string identifier ; the type specifies the type of element which could be as simple as a constant or integer , or be a more complex ( and very rich ) type such as an excel spreadsheet or even a serialized data dictionary ; and the value specifies a current value or state of the element . in an embodiment , the type field contains an agreed upon indicator specifying the type of element ( e . g ., 1 is an integer , 2 is a string , 3 is an object , etc .). in another embodiment , the type mechanism is extended to provide a standard way for receivers to learn about type indicators that the receiver does not recognize such as by querying the sending application , the message queuing network , or some other local or remote process . for example , a record of data such as an address book entry could be sent as a persistent dictionary object , with the address book entries being defined in terms of two dictionary elements . the first dictionary element having a name of “ entry name ”, being of type “ string ”, and having a value of “ uspto ”; with the second dictionary element having a name of “ city ”, being of type “ string ”, and having a value of “ washington d . c .”. using visual basic and dimensioning d as a new persistent dictionary , the elements could be added to d using the statements : then , the elements could be extracted from d by the following references : d (“ entry name ”) and d (“ city ”). using the previously described triplet as a data element merely illustrates a very generalized abstract data element . various other dictionary data elements could be employed in keeping with the present invention . in addition , late binding techniques could be used to make each named element in the data dictionary a data member of the object . using this technique , elements of the dictionary could be referenced directly . for example , a data element msword_document in a dictionary d could be referenced as d . msword_document as opposed to d (“ msword_document ”). turning now to fig3 b , illustrated is a serialized dictionary object 360 . the first field , celements 370 , contains the number of elements in the serialized dictionary object 360 , which is followed by each of the dictionary elements . as shown , the first dictionary element 380 comprises the triplet of the name 381 , type 382 and value 383 . a dictionary object can contain a plurality of dictionary elements as indicated by element field 399 . fig4 a , 5 a , 5 b , and 4 b illustrate the steps performed by a sending application , the sending msmq server , the receiving msmq server , and the recipient application , respectively , in sending a message object from a sending application to a recipient application over a msmq network in one embodiment . in other embodiments , certain of these described functions could be performed by the application instead of the message queuing network and vice versa . for example , the serialization and deserialization of the persistent dictionary object could be performed by the sending and recipient applications ( or by other intermediate protocol layers , or by other processes ). in this example , the message queuing network would not necessarily need to know that it was transporting a self - descriptive message . moreover , self - descriptive messages ( e . g ., persistent dictionary objects ) could be transported using other network technologies and protocols , in addition to , or in place of the message queuing network described herein . first , turning to fig4 a , illustrated are the steps performed by a microsoft visual basic application preparing and sending a message object containing an excel spreadsheet across a msmq network . first , a msmq queue q , an excel spreadsheet xl , and a msmq message m are dimensioned in steps 405 - 415 . next , the body of the message m is set to the excel spreadsheet xl in step 420 . finally , in step 425 , the msmq message m is sent via queue q . next , turning to fig5 a , the sending msmq server continues in response to the request to send the message object by the sending application in step 420 ( fig4 a ). first , in step 505 , the message object is checked to see if it supports data persistence ( such as being a com object ). if it does not support data persistence , then the object is not sent in one embodiment and processing ends with step 545 . in other embodiments , it would be possible to add additional functionality based on the teachings disclosed herein to incorporate serialization and unserialization of arbitrary objects . otherwise , if the message object supports persistence as determined in step 505 , then the required size of a buffer is determined and allocated in step 510 to accommodate the serialized message object . next , in step 515 , the persistent storage type supported by the message object is determined . if the message object supports streams , then processing flows to steps 520 - 525 wherein the message object writes itself to the buffer , and the message type is set to a “ streamed object ”. otherwise , the message object supports storage ( the other storage type for a com object ) and processing continues with steps 530 - 535 wherein a storage pointing to the message buffer is created , the object saves itself to the storage ( i . e ., the message buffer ), and the message type is set to a “ stored object ”. finally , in step 540 , the msmq message body is set to the contents of the buffer and the msmq server forwards the message to the destination queue . when such a message object is received at a receiving msmq server queue and the message has been determined to contain an object by querying the message itself using a method of the message , the message is processed according to the flow diagram of fig5 b . in step 555 , the object message type is evaluated and if it is of a “ streamed object ” type , then processing continues with steps 560 - 565 wherein the received message object creates a stream which is initialized by the message buffer memory , and a class identifier ( clsid ) is obtained from the stream . otherwise , the object message is of a “ storage object ” type , and steps 570 - 575 are performed wherein the received message object creates a storage which is initialized by the message buffer memory , and a class identifier ( clsid ) is obtained from the storage . next , in step 580 , the ole interface cocreateinstance is used to instantiate the message object ( i . e ., the persistent dictionary object ). then , the load method 322 ( fig3 a ) of the instantiated object is invoked to load the serialized data ( from the appropriate initialized storage or stream that was created in step 560 or 570 ) in step 585 . finally , in step 590 , the receiving msmq server returns the message object ( i . e ., the instantiated and loaded dictionary object ) to the recipient application in step 590 . the recipient application then uses the received self - contained message object as described herein with reference to the flow diagram of fig4 b . first , in step 455 , a msmq queue q , a msmq message m , and a persistent data dictionary d are dimensioned . next , in step 460 , m is set to the message received from the sender application via the msmq network as explained herein with reference to fig4 a , 5 a and 5 b . having obtained the message m containing the self - descriptive object , the recipient application processes the message however it desires . the remaining steps 465 - 499 illustrate one embodiment of such processing . first , if the body of the received message is not a persistent dictionary as determined in step 465 , then the non - persistent data object ( e . g ., an integer , record , string ) is processed by the application . for example , the recipient application could print the address book previously described herein by setting d to the message body of a received message containing an address book entry , and then using the statement : otherwise , the received message is a persistent dictionary as determined in step 465 , and d is set to the message body in step 470 . next , while there are elements remaining in the persistent dictionary d , steps 477 - 495 are performed for each element . in step 477 , an element is enumerated from the data dictionary . next , steps 480 - 495 are performed which embody a case statement switching upon the typeof ( ) the element ( i . e ., the type of the persistent dictionary element received in the msmq message ). for example , if the type of the element is an excel spreadsheet , then excel operations are performed . otherwise , processing continues in the case statement with a generic type “ casetype ” provided for illustrative purposes in steps 490 , 495 to signify the diverse and rich types of elements that can be sent across a network in a self - descriptive message using the present invention . this casetype could be any data type , including an integer , string , data record , address book entries , or even a persistent dictionary . many different configurations are also possible , including the recipient application being a casetype application and processing the received element , or a casetype application being invoked by the recipient application or message queuing system to process the received the data element . in view of the many possible embodiments to which the principles of our invention may be applied , it will be appreciated that the embodiment described herein with respect to the drawing figures is only illustrative and should not be taken as limiting the scope of the invention . to the contrary , the invention as described herein contemplates all such embodiments as may come within the scope of the following claims and equivalents thereof .